2026-07-21T03:08:34Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6158 2024-03-06T10:38:29Z ddc:004 open_access

Causally Consistent Dynamic Slicing Perera, Roly Garg, Deepak Cheney, James pi-calculus; dynamic slicing; causal equivalence; Galois connection We offer a lattice-theoretic account of the problem of dynamic slicing for pi-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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Roly Perera and Deepak Garg and James Cheney 2016 Is Part Of LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2016.18 urn:nbn:de:0030-drops-61584 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.18 eng https://creativecommons.org/licenses/by/3.0/legalcode