License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.18
URN: urn:nbn:de:0030-drops-61584
Go to the corresponding LIPIcs Volume Portal

Perera, Roly ; Garg, Deepak ; Cheney, James

Causally Consistent Dynamic Slicing

LIPIcs-CONCUR-2016-18.pdf (0.7 MB)


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.

BibTeX - Entry

  author =	{Roly Perera and Deepak Garg and James Cheney},
  title =	{{Causally Consistent Dynamic Slicing}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{18:1--18:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Jos{\'e}e Desharnais and Radha Jagadeesan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-61584},
  doi =		{10.4230/LIPIcs.CONCUR.2016.18},
  annote =	{Keywords: pi-calculus; dynamic slicing; causal equivalence; Galois connection}

Keywords: pi-calculus; dynamic slicing; causal equivalence; Galois connection
Collection: 27th International Conference on Concurrency Theory (CONCUR 2016)
Issue Date: 2016
Date of publication: 24.08.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI