Causally consistent dynamic slicing

TL;DR

This paper introduces a lattice-theoretic framework for dynamic slicing in concurrent -calculus, establishing a Galois connection that relates forward and backward slices across causally equivalent executions, enabling efficient implementation.

Contribution

It provides a novel lattice-theoretic account of dynamic slicing for concurrent programs, extending prior sequential work with formal proofs and an Agda implementation.

Findings

Galois connection relates slices of concurrent executions

Framework applies to causally equivalent runs

Formalised in dependently-typed Agda language

Abstract

We offer a lattice-theoretic account of dynamic slicing for {\pi}-calculus, building on prior work in the sequential setting. For any run of a concurrent program, we exhibit a Galois connection relating forward slices of the start configuration to backward slices of the end 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 dependently-typed language Agda.