A formal approach to undo operations in programming languages

DOI10.1145/5001.5005zbMath0592.68015OpenAlexW1987371135WikidataQ60305009 ScholiaQ60305009MaRDI QIDQ3721785

George B. jun. Leeman

Publication date: 1986

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1986-8/

zbMATH Keywords

checkpointprogramming languagesrecoverylanguage constructspreprocessorsreverse executionUndo facility

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (9)

Reversibility in the higher-order \(\pi\)-calculus ⋮ Running programs backwards: The logical inversion of imperative computation ⋮ Fundamentals of reversible flowchart languages ⋮ Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach ⋮ Reversible computing from a programming language perspective ⋮ Undoing the effects of action sequences ⋮ Causal-consistent rollback in a tuple-based language ⋮ Controlling Reversibility in Higher-Order Pi ⋮ Unnamed Item

This page was built for publication: A formal approach to undo operations in programming languages