Projects per year
Abstract / Description of output
We offer a lattice-theoretic account of the problem of dynamic slicing for -calculus, building on prior work in the sequential setting. For any particular run of a concurrent program, we exhibit a Galois connection relating forward and backward slices of the initial and terminal configurations. We prove that, up to lattice isomorphism, the same Galois connection arises for any causally equivalent execution, allowing an efficient concurrent implementation of slicing via a standard interleaving semantics. Our approach has been formalised in the dependently-typed programming language Agda.
| Original language | English |
|---|---|
| Title of host publication | The 27th International Conference on Concurrency Theory (CONCUR 2016) |
| Place of Publication | Québec City, Canada |
| Publisher | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany |
| Pages | 18:1-18:15 |
| Number of pages | 15 |
| Volume | 59 |
| ISBN (Print) | 978-3-95977-017-0 |
| DOIs | |
| Publication status | Published - 26 Aug 2016 |
| Event | 27th International Conference on Concurrency Theory - Québec City, Canada Duration: 23 Aug 2016 → 26 Aug 2016 https://www.concur2016.ulaval.ca/no_cache/home/ |
Publication series
| Name | Leibniz International Proceedings in Informatics (LIPIcs) |
|---|---|
| Publisher | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik |
| Volume | 59 |
| ISSN (Print) | 1868-8969 |
Conference
| Conference | 27th International Conference on Concurrency Theory |
|---|---|
| Abbreviated title | CONCUR 2016 |
| Country/Territory | Canada |
| City | Québec City |
| Period | 23/08/16 → 26/08/16 |
| Internet address |
Fingerprint
Dive into the research topics of 'Causally consistent dynamic slicing'. Together they form a unique fingerprint.Projects
- 2 Finished
-
From Data Types to Session Types - A Basis for Concurrency and Distribution
20/05/13 → 19/11/20
Project: Research
-