Properties of Programs and the First-Order Predicate Calculus
From MaRDI portal
Publication:5594890
DOI10.1145/321510.321516zbMath0198.22001OpenAlexW2032847002MaRDI QIDQ5594890
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
Related Items (16)
Program termination using Z-transform theory ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ The temporal semantics of concurrent programs ⋮ Unnamed Item ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Description of restricted automata by first-order formulae ⋮ Out of order quantifier elimination for standard quantified linear programs ⋮ A method for pogram analysis and Its applications to program-correctness problems ⋮ Program schemata and the first-order decision problem ⋮ Program schemata as automata. I ⋮ Function iteration logics and flowchart schemata ⋮ Proving semantic properties as first-order satisfiability ⋮ On the non-compactness of the class of program schemas ⋮ 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
This page was built for publication: Properties of Programs and the First-Order Predicate Calculus
