Running programs backwards: The logical inversion of imperative computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3740740 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 48279 (Why is no real title available?)
- scientific article; zbMATH DE number 53085 (Why is no real title available?)
- scientific article; zbMATH DE number 517330 (Why is no real title available?)
- scientific article; zbMATH DE number 3992919 (Why is no real title available?)
- A formal approach to undo operations in programming languages
- Derivation of Invariant Assertions During Program Development by Transformation
- Grammar-related transformations of logic programs
- Invertible cellular automata: A review
- Logical Reversibility of Computation
- Metalogical control for logic programs
- On the synthesis of function inverses
- Program inversion in the refinement calculus
- Program inversion: More than fun!
- Simulation of hybrid circuits in constraint logic programming
Cited in
(4)
This page was built for publication: Running programs backwards: The logical inversion of imperative computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377325)