Proving the Correctness of the Implementation of a Control-Command Algorithm

  • Olivier Bouissou
Conference paper

DOI: 10.1007/978-3-642-03237-0_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Bouissou O. (2009) Proving the Correctness of the Implementation of a Control-Command Algorithm. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

Abstract

In this article, we study the interactions between a control-command program and its physical environment via sensors and actuators. We are interested in finding invariants on the continuous trajectories of the physical values that the program is supposed to control. The invariants we are looking for are periodic sequences of intervals that are abstractions of the values read by the program. To compute them, we first build octrees that abstract the impact of the program on its environment. Then, we compute a period of the abstract periodic sequence and we finally define the values of this sequence as the fixpoint of a monotone map. We present a prototype analyzer that computes such invariants for C programs using a simple specification language for describing the continuous environment. It shows good results on classical benchmarks for hybrid systems verification.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Olivier Bouissou
    • 1
  1. 1.CEA LIST, Laboratory of Modelling and Analysis of Systems in InteractionFrance

Personalised recommendations