Causally consistent dynamic slicing

Roly Perera, Deepak Garg, James Cheney

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationThe 27th International Conference on Concurrency Theory (CONCUR 2016)
Place of PublicationQuébec City, Canada
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
Number of pages15
ISBN (Print)978-3-95977-017-0
Publication statusPublished - 26 Aug 2016
Event27th International Conference on Concurrency Theory - Québec City, Canada
Duration: 23 Aug 201626 Aug 2016

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
ISSN (Print)1868-8969


Conference27th International Conference on Concurrency Theory
Abbreviated titleCONCUR 2016
CityQuébec City
Internet address


Dive into the research topics of 'Causally consistent dynamic slicing'. Together they form a unique fingerprint.

Cite this