Reversible debugging of concurrent Erlang programs: supporting imperative primitives
From MaRDI portal
Publication:6197585
DOI10.1016/j.jlamp.2024.100944OpenAlexW4390938886WikidataQ129754725 ScholiaQ129754725MaRDI QIDQ6197585
Claudio Sacerdoti Coen, Pietro Lami, Jean-Bernard Stefani, Giovanni Fabbretti, Ivan Lanese
Publication date: 20 March 2024
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2024.100944
Cites Work
- Unnamed Item
- Reversibility in the higher-order \(\pi\)-calculus
- Causal-consistent rollback in a tuple-based language
- Cauder: a causal-consistent reversible debugger for Erlang
- A theory of reversibility for Erlang
- Reversibility in Erlang: imperative constructs
- An axiomatic approach to reversible computation
- 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
- Finding race conditions in Erlang with QuickCheck and PULSE
- Controlling Reversibility in Higher-Order Pi
- An improved Landauer principle with finite-size corrections
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Irreversibility and Heat Generation in the Computing Process
- Time, clocks, and the ordering of events in a distributed system
- Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs
- Causal-Consistent Debugging of Distributed Erlang Programs
- Reversible Imperative Parallel Programs and Debugging
- CONCUR 2004 - Concurrency Theory
- A Shared Memory Computer Display System
This page was built for publication: Reversible debugging of concurrent Erlang programs: supporting imperative primitives
