A Hoare-style verification calculus for control state ASMs

Authors:
Werner Gabrisch;Wolf Zimmermann
Affiliations:
Martin-Luther-Universität Halle-Wittenberg, Halle/Saale, Germany;Martin-Luther-Universität Halle-Wittenberg, Halle/Saale, Germany
Venue:
Proceedings of the Fifth Balkan Conference in Informatics
Year:
2012

Citing 11
Cited 0

Evolving algebras 1993: Lipari guide

Specification and validation methods
An axiomatic basis for computer programming

Communications of the ACM
A Programmer Friendly Modular Definition of the Semantics of Java

Formal Syntax and Semantics of Java
Verification of Compilers

Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Model Checking Support for the ASM High-Level Language

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
The Semantics of the C Programming Language

CSL '92 Selected Papers from the Workshop on Computer Science Logic
A Logic for Abstract State Machines

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Model Checking Object-Z Using ASM

IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Formal verification of a realistic compiler

Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
A framework for modeling the semantics of expression evaluation with abstract state machines

ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a Hoare-style calculus for control-state Abstract State Machines (ASM) such that verification of control-state ASMs is possible. In particular, a Hoare-Triple {ϕ}A{ψ} for an ASM A means that if an initial state T satisfies the precondition ϕ and a final state F is reached by A, then the final state satisfies the postcondition ψ. While it is straightforward to generalize the assignment axiom of the Hoare-Calculus to a single state transition, the composition of Hoare-Triples is challenging since typical programming language concepts are not present in ASMs.