Formalization of Properties of Functional Programs

DOI10.1145/321592.321606zbMath0206.17503OpenAlexW2039586513WikidataQ56170162 ScholiaQ56170162MaRDI QIDQ5606281

Amir Pnueli, Zohar Manna

Publication date: 1970

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (20)

Automatic synthesis of logical models for order-sorted first-order theories ⋮ The \(\mu\)-calculus as an assertion-language for fairness arguments ⋮ Formalization of equivalence of recursively defined functions ⋮ Formalization of properties of nondeterministic recursive definitions ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II ⋮ Control extension in a recursive language ⋮ Programs as partial graphs. I: Flow equivalence and correctness ⋮ Resolution for some first-order modal systems ⋮ Reasoning about programs ⋮ Proving assertions about parallel programs ⋮ Alternative semantics for temporal logics ⋮ On the completeness of the inductive assertion method ⋮ Formalization of correctness of recursive definitions ⋮ Program invariants as fixedpoints ⋮ The correctness of nondeterministic programs ⋮ Mathematical theory of partial correctness ⋮ Current methods for proving program correctness ⋮ Verifying programs by induction on their data structure: general format and applications ⋮ A multiprocess network logic with temporal and spatial modalities ⋮ Computation of equilibria in noncooperative games

This page was built for publication: Formalization of Properties of Functional Programs