Computing preconditions and postconditions of while loops

Document Type

Conference Proceeding

Publication Date

9-19-2011

Abstract

Weakest preconditions were introduced by Dijkstra as a tool to define the semantics of programming constructs, and thereby as a means to prove the correctness of programs; the dual concept of strongest postcondition was introduced subsequently as an alternative means for the same ends. In this paper, we present and discuss a method to compute weakest preconditions and strongest postconditions of while loops in a C-like programming language; to this effect, we use the concept of invariant relation. Whereas the task of computing weakest preconditions and strongest postconditions of while loops is usually approached by limiting the number of iterations and applying successive sequential compositions, invariant relations afford us a crisper, closed form solution. © 2011 Springer-Verlag.

Identifier

80052726204 (Scopus)

ISBN

[9783642232824]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-642-23283-1_13

e-ISSN

16113349

ISSN

03029743

First Page

173

Last Page

193

Volume

6916 LNCS

This document is currently not available here.

Share

COinS