Testing and verifying invariant based programs in the SOCOS environment

  • Authors:
  • Ralph-Johan Back;Johannes Eriksson;Magnus Myreen

  • Affiliations:
  • Åbo Akademi University, Department of Information Technologies, Turku, Finland;Åbo Akademi University, Department of Information Technologies, Turku, Finland;University of Cambridge, Computer Laboratory, Cambridge, UK

  • Venue:
  • TAP'07 Proceedings of the 1st international conference on Tests and proofs
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

SOCOS is a prototype tool for constructing programs and reasoning about their correctness. It supports the invariant based programming methodology by providing a diagrammatic environment for specification, implementation, verification and execution of procedural programs. Invariants and contracts (pre- and postconditions) are evaluated at runtime, following the Design by Contract paradigm. Furthermore, SOCOS generates correctness conditions for static verification based on the weakest precondition semantics of statements. To verify the program 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.