Inductive methods for proving properties of programs
From MaRDI portal
Publication:4404415
DOI10.1145/355609.362336zbMath0278.68019OpenAlexW1998555378MaRDI QIDQ4404415
Stephen Ness, Zohar Manna, Jean E. Vuillemin
Publication date: 1973
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/355609.362336
Related Items (28)
A theory for nondeterminism, parallelism, communication, and concurrency ⋮ On merging software extensions ⋮ On proving the termination of algorithms by machine ⋮ Unnamed Item ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ Un modello di \(\lambda\)-calcolo fortemente equivalente agli schemi ricorsivi ⋮ Program schemata and the first-order decision problem ⋮ Deriving graphs from graphs by applying a production ⋮ Program equivalence and context-free grammars ⋮ A class of functions synthesized from a finite number of examples and a lisp program scheme ⋮ Completeness results for the equivalence of recursive schemas ⋮ Unnamed Item ⋮ Least fixed points revisited ⋮ Relationships between classes of monotonic functions ⋮ On the completeness of the inductive assertion method ⋮ Backtracking in recursive computations ⋮ IO and OI. I ⋮ IO and OI. II ⋮ On an equivalence between continuation and stack semantics ⋮ Recursive converters on a memory ⋮ A mechanical proof of the termination of Takeuchi's function ⋮ Current methods for proving program correctness ⋮ Transformations predefining a program ⋮ Sulla computazione di funzioni ricorsive ⋮ Implementation of data types by algebraic methods ⋮ Some equivalent transformations of recursive programs based on their schematic properties ⋮ Acceptable functional programming systems ⋮ Modular semantics for a UML statechart diagrams kernel and its extension to multicharts and branching time model-checking
Uses Software
This page was built for publication: Inductive methods for proving properties of programs
