Automated Invariant Generation for the Verification of Real-Time Systems

15 pages•Published: June 22, 2012

Bahareh Badban, Stefan Leue and Jan-Georg Smaus

Abstract

We present an approach to automatically generating invariants for timed automata models. The CIPM algorithm that we propose first computes new invariants for timed automata control locations taking their originally defined invariants as well as the constrains on clock variables imposed by incoming state transitions into account. In doing so the CIPM algorithm also prunes idle transitions, which are transitions that can never be taken, from the automaton. We discsuss a prototype implementation of the CIPM algorithm as well as some initial experimental results.

Keyphrases: invariant generation, program verification, real time systems

In: Andrei Voronkov, Laura Kovacs and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 44-58.

Links:	https://easychair.org/publications/paper/Z
	https://doi.org/10.29007/npn7

BibTeX entry

@inproceedings{WING2010:Automated_Invariant_Generation_Verification,
  author    = {Bahareh Badban and Stefan Leue and Jan-Georg Smaus},
  title     = {Automated Invariant Generation for the Verification of Real-Time Systems},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Z},
  doi       = {10.29007/npn7},
  pages     = {44-58},
  year      = {2012}}

Download PDF Open PDF in browser