Properties of Programs and the First-Order Predicate Calculus

DOI10.1145/321510.321516MaRDI QIDQ5594890zbMATH OpenOpenAlexFDO

Authors Zohar Manna

Publication date 1969

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321510.321516

zbMATH Keywords

computer science and automata

Cited in

(16)

• Program termination using Z-transform theory
• The temporal semantics of concurrent programs
• Programs as partial graphs. I: Flow equivalence and correctness
• Program schemata and the first-order decision problem
• Program schemata as automata. I
• Function iteration logics and flowchart schemata
• Automatic synthesis of logical models for order-sorted first-order theories
• Proving semantic properties as first-order satisfiability
• Out of order quantifier elimination for standard quantified linear programs
• Pair grammars, graph languages and string-to-graph translations
• Translating recursion equations into flow charts
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
• Description of restricted automata by first-order formulae
• A method for pogram analysis and Its applications to program-correctness problems
• scientific article; zbMATH DE number 3797730 (Why is no real title available?)
• On the non-compactness of the class of program schemas

This page was built for publication: Properties of Programs and the First-Order Predicate Calculus

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