Some equivalent transformations of recursive programs based on their schematic properties

DOI10.1016/0020-0190(84)90007-3zbMath0541.68004OpenAlexW2018564246MaRDI QIDQ794422

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)

Cites Work

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

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