Pith. sign in

REVIEW

A Modular Formalization of Reversibility for Concurrent Models and Languages

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1608.03325 v1 pith:STS63KUO submitted 2016-08-11 cs.LO cs.PL

A Modular Formalization of Reversibility for Concurrent Models and Languages

Alexis Bernadet (Dalhousie University , Canada) , Ivan Lanese (Focus Team , University of Bologna/INRIA , Italy) This is my paper
classification cs.LO cs.PL
keywords concurrentreversibilitycausal-consistentdifferentextensionsframeworklanguagesmodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework can be used to define reversible extensions of formalisms as different as CCS and concurrent X-machines. The generality of the approach allows for the reuse of theories and techniques in different settings.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.