By Topic

A Calculus for Imperative Programs: Formalization and Implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Madalina Erascu ; Res. Inst. for Symbolic Comput., Johannes Kepler Univ., Linz, Austria ; Tudor Jebelean

As an extension of our previous work on imperative program verification, we present a formalism for handling the total correctness of While loops in imperative programs, consisting in functional based definitions of the verification conditions for both partial correctness and for termination.A specific feature of our approach is the generation of verification conditions as first order formulae, including the termination condition which is expressed as an induction principle.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on

Date of Conference:

26-29 Sept. 2009