Compositional verification for component-based systems and applicationReport as inadecuate




Compositional verification for component-based systems and application - Download this document for free, or read online. Document in PDF available to download.

Presented at: Automated Technology for Verification and Analysis. Proceedings 6th International Symposium, ATVA 2008, Berlin, Germany Published in: Automated Technology for Verification and Analysis. Proceedings 6th International Symposium, ATVA 2008, p. 64 - 79 Publication date: 2008

We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transfer. The method is based on the use of two kinds of invariants. Component invariants which are over-approximations of components' reachability sets. Interaction invariants which are constraints on the states of components involved in interactions. Interaction invariants are obtained by computing traps of finite-state abstractions of the verified system. The method is applied for deadlock verification in the D-Finder tool. D-finder is an interactive tool that takes as input BIP programs and applies proof strategies to eliminate potential deadlocks by computing increasingly stronger invariants. The experimental results on non-trivial examples allow either to prove deadlock-freedom or to identify very few deadlock configurations that can be analyzed by using state space exploration.

Keywords: object-oriented programming ; program verification ; software tools ; system recovery ; user interfaces Reference EPFL-CONF-185010





Author: Bensalem, S.; Bozga, M.; Sifakis, J.; Nguyen, Thanh-Hung

Source: https://infoscience.epfl.ch/record/185010?ln=en







Related documents