Formal Verification for Components and Connectors

Christel BaierChristel Baier, Tobias BlechmannTobias Blechmann, Joachim KleinJoachim Klein, Sascha KlüppelholzSascha Klüppelholz

DOI Link

Christel Baier, Tobias Blechmann, Joachim Klein, Sascha Klüppelholz
Formal Verification for Components and Connectors
Proc. of the 7th International Symposium on Formal Methods for Components and Objects (FMCO), volume 5751 of Lecture Notes in Computer Science, 82--101, 2008. Springer

Details
Bibtex

KurzfassungAbstract
In previous work, constraint automata have been introduced as a uniform model for behavioral interfaces of components, (possibly dynamic) component connectors and systems consisting of several components and their glue code. The purpose of the paper is to provide an overview of the techniques for specifying and verifying temporal requirements, conditions on the data flow at the I/O-ports of components and alternating-time properties that have been designed for constraint automata. The paper presents the syntax and semantics of the logics, sketches the model checking algorithms, summarizes the main features of the implementation within the tool Vereofy and reports on experimental studies.
Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-04167-9_5.

@inproceedings{BBKK2008,
  author    = {Christel Baier and Tobias Blechmann and Joachim Klein and Sascha
               Kl{\"{u}}ppelholz},
  title     = {Formal Verification for Components and Connectors},
  booktitle = {Proc. of the 7th International Symposium on Formal Methods for
               Components and Objects (FMCO)},
  series    = {Lecture Notes in Computer Science},
  volume    = {5751},
  publisher = {Springer},
  year      = {2008},
  pages     = {82--101},
  doi       = {10.1007/978-3-642-04167-9_5}
}