Some equivalent transformations of recursive programs based on their schematic properties

DOI10.1016/0020-0190(84)90007-3MaRDI QIDQ794422zbMATHOpenAlexFDO

Authors Mark B. Trakhtenbrot

Publication date 1984

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(84)90007-3

zbMATH Keywords

recursive programsequivalent transformationsschematic properties

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• scientific article; zbMATH DE number 3963179
• scientific article; zbMATH DE number 1614686
• How powerful are folding/unfolding transformations?
• Equivalent transformations of recursive schemes with finite deconvolution

Cites work

• A Transformation System for Developing Recursive Programs
• A synthesis of several sorting algorithms
• Inductive methods for proving properties of programs
• On Classes of Program Schemata
• Program equivalence and context-free grammars
• Program transformations and algebraic semantics
• Tree equivalence of linear recursive schemata is polynomial-time decidable

Cited in

(11)

• scientific article; zbMATH DE number 4016172 (Why is no real title available?)
• scientific article; zbMATH DE number 3917685 (Why is no real title available?)
• scientific article; zbMATH DE number 4037258 (Why is no real title available?)
• scientific article; zbMATH DE number 4041248 (Why is no real title available?)
• scientific article; zbMATH DE number 3947605 (Why is no real title available?)
• scientific article; zbMATH DE number 3963179 (Why is no real title available?)
• scientific article; zbMATH DE number 1614686 (Why is no real title available?)
• Equivalent transformations of recursive schemes with finite deconvolution
• scientific article; zbMATH DE number 5572668 (Why is no real title available?)
• Equivalent transformations of program schemes for ``Entangling programs
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars

This page was built for publication: Some equivalent transformations of recursive programs based on their schematic properties

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