Causally Consistent Dynamic Slicing

Perera, R. , Garg, D. and Cheney, J. (2016) Causally Consistent Dynamic Slicing. In: CONCUR 2016: The 27th International Conference on Concurrency Theory, Québec City, Canada, 23-26 Aug 2016, p. 18. ISBN 9783959770170 (doi:10.4230/LIPIcs.CONCUR.2016.18)

120265.pdf - Published Version
Available under License Creative Commons Attribution.



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 slices of the initial configuration to backward slices of the terminal configuration. 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 dependentlytyped programming language Agda.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Perera, Dr Roland
Authors: Perera, R., Garg, D., and Cheney, J.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2016 The Authors
First Published:First published in Proceedings of the 27th International Conference on Concurrency Theory (CONCUR 2016): 18
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
612411From Data Types to Session Types - A Basis for Concurrency and Distribution.Simon GayEngineering & Physical Sciences Research Council (EPSRC)EP/K034413/1COM - COMPUTING SCIENCE