A Hoare-like proof system for analysing the computation time of programs

DOI10.1016/0167-6423(87)90029-3zbMath0622.68026OpenAlexW1967175382MaRDI QIDQ1091122

Hanne Riis Nielson

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90029-3

zbMATH Keywords

Hoare logicbubble sorting algorithmclock variablepartial and total correctness properties of programswhile programs

Mathematics Subject Classification ID

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

Related Items (4)

Semantic foundations for cost analysis of pipeline-optimized programs ⋮ Graded Hoare logic and its categorical semantics ⋮ Fifty years of Hoare's logic ⋮ Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs

This page was built for publication: A Hoare-like proof system for analysing the computation time of programs