Reversible debugging of concurrent Erlang programs: supporting imperative primitives
From MaRDI portal
Cites work
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- A Shared Memory Computer Display System
- A theory of reversibility for Erlang
- An axiomatic approach to reversible computation
- An improved Landauer principle with finite-size corrections
- Cauder: a causal-consistent reversible debugger for Erlang
- Causal-Consistent Debugging of Distributed Erlang Programs
- Causal-consistent replay reversible semantics for message passing concurrent programs
- Causal-consistent rollback in a tuple-based language
- CONCUR 2004 - Concurrency Theory
- Controlling Reversibility in Higher-Order Pi
- Finding race conditions in Erlang with quickcheck and PULSE
- Fundamental approaches to software engineering. 17th international conference, FASE 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014, Proceedings
- scientific article; zbMATH DE number 7559489 (Why is no real title available?)
- Irreversibility and Heat Generation in the Computing Process
- Reversibility in Erlang: imperative constructs
- Reversibility in the higher-order \(\pi\)-calculus
- Reversible Imperative Parallel Programs and Debugging
- Time, clocks, and the ordering of events in a distributed system
Cited in
(2)
This page was built for publication: Reversible debugging of concurrent Erlang programs: supporting imperative primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197585)
