Verifying invariant based programs in the SOCOS environment

Authors:
Ralph-Johan Back;Johannes Eriksson;Magnus Myreen
Affiliations:
Turku Centre for Computer Science, Åbo Akademi University, Department of Information Technologies, Turku, Finland;Turku Centre for Computer Science, Åbo Akademi University, Department of Information Technologies, Turku, Finland;Turku Centre for Computer Science, Åbo Akademi University, Department of Information Technologies, Turku, Finland
Venue:
TFM'06 Proceedings of the 2006 conference on Teaching Formal Methods: practice and experience
Year:
2006

Citing 8
Cited 1

Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Extended static checking for Java

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
A Discipline of Programming

A Discipline of Programming
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
Tool Support for Invariant Based Programming

APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Invariant based programming

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
The spec# programming system: an overview

CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices

Data Refinement of Invariant Based Programs

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An invariant based program is a state transition diagram consisting of nested situations (predicates over program variables) and transitions between situations (predicate transformers). Reasoning about correctness is performed in a local fashion by examining each situation at a time and proving that the situation is satisfied for all possible executions. Since the invariants are in place from the beginning and the verification conditions are easily extracted from the diagram there is no need for complicated proof rules, making invariant diagrams a suitable notation for introducing formal verification to students and programmers. Our preliminary experience from using invariant diagrams in the classroom has prompted the need for a tool to support the method: we introduce here SOCOS, an environment for invariant based programming. SOCOS generates correctness conditions based on weakest precondition semantics, and the user can attempt to automatically discharge these conditions using the Simplify theorem prover; conditions which were not automatically discharged can be proved interactively in the PVS theorem prover.