Is “sometime” sometimes better than “always”?
From MaRDI portal
Publication:4144164
DOI10.1145/359340.359353zbMATH Open0367.68011OpenAlexW2012220159MaRDI QIDQ4144164FDOQ4144164
Richard Waldinger, Zohar Manna
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
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 \(\equiv\) 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
- Title not available (Why is that?)
- Verifying programs by induction on their data structure: general format and applications
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)
