Programming and Computer Software

, Volume 34, Issue 6, pp 307–321

Generation of correctness conditions for imperative programs

Article

DOI: 10.1134/S0361768808060029

Cite this article as:
Shilov, N.V., Anureev, I.S. & Bodin, E.V. Program Comput Soft (2008) 34: 307. doi:10.1134/S0361768808060029

Abstract

Verification of imperative programs in the sense of Floyd-Hoare is an approach to proving correctness of programs annotated by preconditions, postconditions, and loop invariants. It is based on generation of correctness conditions. In the structured deterministic case, the problem of generation of correctness conditions seems trivial, since it is solved by a syntax-driven algorithm, the complexity of which linearly depends on the number of control constructs. Vice versa, in the unstructured nondeterministic case, it seems a priori clear that the complexity of generation of the correctness conditions exponentially depends on the number of statements in the program. In the paper, an efficient and complete algorithm for the generation of the correctness conditions is presented and justified. It can be used both in the structured deterministic and unstructured nondeterministic cases. The algorithm complexity linearly depends on the number of control constructs and/or program statements.

Copyright information

© MAIK Nauka 2008

Authors and Affiliations

  1. 1.Ershov Institute of Information Systems, Siberian BranchRussian Academy of SciencesNovosibirskRussia

Personalised recommendations