Verifying CSP-OZ-DC specifications with complex data types and timing parameters

  • Authors:
  • Johannes Faber;Swen Jacobs;Viorica Sofronie-Stokkermans

  • Affiliations:
  • Department of Computing Science, University of Oldenburg, Germany;Max-Planck-Institut Informatik, Saarbrücken, Germany;Max-Planck-Institut Informatik, Saarbrücken, Germany

  • Venue:
  • IFM'07 Proceedings of the 6th international conference on Integrated formal methods
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend existing verification methods for CSP-OZ-DC to reason about real-time systems with complex data types and timing parameters. We show that important properties of systems can be encoded in well-behaved logical theories in which hierarchic reasoning is possible. Thus, testing invariants and bounded model checking can be reduced to checking satisfiability of ground formulae over a simple base theory. We illustrate the ideas by means of a simplified version of a case study from the European Train Control System standard.