Is “sometime” sometimes better than “always”?

DOI10.1145/359340.359353MaRDI QIDQ4144164zbMATH OpenOpenAlexFDO

Authors Zohar Manna, Richard Waldinger

Publication date 1978

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(14)

• Automated temporal reasoning about reactive systems
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
• Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
• Inter-program Properties
• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Total correctness in nonstandard logics of programs
• The Schorr-Waite graph marking algorithm
• Non-standard algorithmic and dynamic logic
• The correctness of the Schorr-Waite list marking algorithm
• On proving the termination of algorithms by machine
• Semantics of algorithmic languages
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II
• Verifying programs by induction on their data structure: general format and applications
• scientific article; zbMATH DE number 3797730 (Why is no real title available?)

This page was built for publication: Is “sometime” sometimes better than “always”?

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