Algebraic Semantics of Imperative Programs

Algebraic Semantics of Imperative Programs

4.11 - 1251 ratings - Source

Algebraic Semantics of Imperative Programs presents a self-contained and novel qexecutableq introduction to formal reasoning about imperative programs. The authors' primary goal is to improve programming ability by improving intuition about what programs mean and how they run.The semantics of imperative programs is specified in a formal, implemented notation, the language OBJ; this makes the semantics highly rigorous yet simple, and provides support for the mechanical verification of program properties.OBJ was designed for algebraic semantics; its declarations introduce symbols for sorts and functions, its statements are equations, and its computations are equational proofs. Thus, an OBJ qprogramq is an equational theory, and every OBJ computation proves some theorem about such a theory. This means that an OBJ program used for defining the semantics of a program already has a precise mathematical meaning. Moreover, standard techniques for mechanizing equational reasoning can be used for verifying axioms that describe the effect of imperative programs on abstract machines. These axioms can then be used in mechanical proofs of properties of programs.Intended for advanced undergraduates or beginning graduate students, Algebraic Semantics of Imperative Programs contains many examples and exercises in program verification, all of which can be done in OBJ.This procedure was defined by the following equation: var AV : Arvar . vars El E2 : Exp . eq swap(AV, El, E2) = a#39;T := AV[E1] ... For example, suppose we are writing a large program that makes extensive use of code to sort array segments.

Title:Algebraic Semantics of Imperative Programs
Author:Joseph Goguen, Grant Malcolm
Publisher:MIT Press - 1996


You Must CONTINUE and create a free account to access unlimited downloads & streaming