Program inversion: More than fun!

DOI10.1016/0167-6423(90)90042-CzbMATH Open0715.68055MaRDI QIDQ751841FDOQ751841

Authors: Wei Chen, Jan Tijmen Udding 

Publication date: 1990

Published in: Science of Computer Programming (Search for Journal in Brave)

Recommendations

• Rebuilding a tree from its traversals: a case study of program inversion
• Constructing a binary tree from its traversals by reversible recursion and iteration
• A program inverter for a functional language with equality and constructors.
• A theoretical approach to program inversion
• A grammar-based approach to invertible programs

zbMATH Keywords

program derivationprogram inversionproof rulesfree traversal

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (11)

• Program inversion in the refinement calculus
• Rebuilding a tree from its traversals: a case study of program inversion
• Deriving a fast inverse of the generalized Cantor \(n\)-tupling bijection
• Enabledness and termination in refinement algebra
• Constructing a binary tree from its traversals by reversible recursion and iteration
• Reverse Hoare logic
• A program inverter for a functional language with equality and constructors.
• Categories, relations and dynamic programming
• Inversion of a recursive tree traversal
• Running programs backwards: The logical inversion of imperative computation
• Determinization of inverted grammar programs via context-free expressions

This page was built for publication: Program inversion: More than fun!

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