Is “sometime” sometimes better than “always”?
From MaRDI portal
Publication:4144164
DOI10.1145/359340.359353zbMath0367.68011OpenAlexW2012220159MaRDI QIDQ4144164
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
Related Items
Non-standard algorithmic and dynamic logic, On proving the termination of algorithms by machine, The Schorr-Waite graph marking algorithm, Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II, Unnamed Item, ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs, Total correctness in nonstandard logics of programs, The correctness of the Schorr-Waite list marking algorithm, Inter-program Properties, Semantics of algorithmic languages, Verifying programs by induction on their data structure: general format and applications, Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
