Testing and Verifying Invariant Based Programs in the SOCOS Environment

  • Ralph-Johan Back
  • Johannes Eriksson
  • Magnus Myreen
Conference paper

DOI: 10.1007/978-3-540-73770-4_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4454)
Cite this paper as:
Back RJ., Eriksson J., Myreen M. (2007) Testing and Verifying Invariant Based Programs in the SOCOS Environment. In: Gurevich Y., Meyer B. (eds) Tests and Proofs. TAP 2007. Lecture Notes in Computer Science, vol 4454. Springer, Berlin, Heidelberg

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.

Keywords

Invariant based programming static program verification verification conditions state charts 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ralph-Johan Back
    • 1
  • Johannes Eriksson
    • 1
  • Magnus Myreen
    • 2
  1. 1.Åbo Akademi University, Department of Information Technologies, Turku, FI-20520Finland
  2. 2.University of Cambridge, Computer Laboratory, Cambridge CB3 0FDUK

Personalised recommendations