Three ways of proving termination of loops

DOI10.1007/978-3-031-73887-6_19MaRDI QIDQ7007844zbMATH OpenFDO

Authors Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog

Publication date 25 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-73887-6_19

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites work

• An axiomatic basis for computer programming
• An axiomatic proof technique for parallel programs
• Axiomatic approach to total correctness of programs
• Effectively eliminating auxiliaries
• Fifty years of Hoare's logic
• How the design of JML accommodates both runtime assertion checking and formal verification
• scientific article; zbMATH DE number 3784244 (Why is no real title available?)
• scientific article; zbMATH DE number 1105469 (Why is no real title available?)
• scientific article; zbMATH DE number 2110620 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Recursive assertions and parallel programs
• Rigorous software development. An introduction to program verification.
• Theories of Programming Languages
• Verification of sequential and concurrent programs

This page was built for publication: Three ways of proving termination of loops

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