A formal approach to undo operations in programming languages

DOI10.1145/5001.5005MaRDI QIDQ3721785zbMATH OpenOpenAlexWikidataFDO

Authors 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

checkpointlanguage constructspreprocessorsprogramming languagesrecoveryreverse executionUndo facility

Mathematics Subject Classification ID

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

Recommendations

• A recovery mechanism for shells
• Undoing the effects of action sequences
• Controlled Reversibility and Compensations
• Towards a Theory of Forward Error Recovery
• An Undo Framework for P2P Collaborative Editing

Cited in

(11)

• Running programs backwards: The logical inversion of imperative computation
• Reversibility in the higher-order \(\pi\)-calculus
• Reversible computing from a programming language perspective
• Controlling Reversibility in Higher-Order Pi
• Towards a Theory of Forward Error Recovery
• Reversing place transition nets
• Causal-consistent rollback in a tuple-based language
• Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
• Relating reversible Petri nets and reversible event structures, categorically
• Fundamentals of reversible flowchart languages
• Undoing the effects of action sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721785)