Modular Verification of Recursive Programs

Authors:
Krzysztof R. Apt;Frank S. Boer;Ernst-Rüdiger Olderog
Affiliations:
Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands and Institute of Language, Logic and Computation, University of Amsterdam, Amsterdam,;Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands and Leiden Institute of Advanced Computer Science, University of Leiden, The Netherlands;Department of Computing Science, University of Oldenburg, Germany
Venue:
Languages: From Formal to Natural
Year:
2009

Citing 9
Cited 0

Compositionality, concurrency and partial correctness

Compositionality, concurrency and partial correctness
Proving total correctness of recursive procedures

Information and Computation
Programming: the derivation of algorithms

Programming: the derivation of algorithms
Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof of a program: FIND

Communications of the ACM
Algorithm 65: find

Communications of the ACM
Modular verification of concurrent programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automating modular program verification by refining specifications

Automating modular program verification by refining specifications
Verification of Sequential and Concurrent Programs

Verification of Sequential and Concurrent Programs

Quantified Score

Hi-index	0.00

Visualization

Abstract

We argue that verification of recursive programs by means of the assertional method of C.A.R. Hoare can be conceptually simplified using a modular reasoning. In this approach some properties of the program are established first and subsequently used to establish other program properties. We illustrate this approach by providing a modular correctness proof of the Quicksort program.