Is Sometimes Ever Better Than Always?

DOI10.1145/357073.357080zbMath0452.68012OpenAlexW2133177916MaRDI QIDQ3899467

David Gries

Publication date: 1979

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

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

zbMATH Keywords

axiomatic methodAckermann functioncorrectness of programsintermittent assertion methodsimulating recursion using iteration

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

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

This page was built for publication: Is Sometimes Ever Better Than Always?