Model checking
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
Debugging Ada Tasking Programs
IEEE Software
Compositional Verification for Component-Based Systems and Application
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
D-Finder: A Tool for Compositional Deadlock Detection and Verification
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Incremental Invariant Generation for Compositional Design
TASE '10 Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
D-finder 2: towards efficient correctness of incremental design
NFM'11 Proceedings of the Third international conference on NASA Formal methods
A formal approach for incremental construction with an application to autonomous robotic systems
SC'11 Proceedings of the 10th international conference on Software composition
Runtime verification of component-based systems
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Rigorous system design: the BIP approach
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Knowledge-Based distributed conflict resolution for multiparty interactions and priorities
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
| Hi-index | 0.00 |
We propose invariant-based techniques for the efficient verification of safety and deadlock properties of concurrent systems. We assume that components and component interactions are described within the BIP framework, a tool for component-based design. We build on a compositional methodology in which the invariant is obtained by combining the invariants of the individual components with an interaction invariant that takes concurrency and interaction between components into account. In this paper, we propose new efficient techniques for computing interaction invariants. This is achieved in several steps. First, we propose a formalization of incremental component-based design. Then we suggest sufficient conditions that ensure the preservation of invariants through the introduction of new interactions. For cases in which these conditions are not satisfied, we propose methods for generation of new invariants in an incremental manner. The reuse of existing invariants reduces considerably the verification effort. Our techniques have been implemented in the D-Finder toolset. Among the experiments conducted, we have been capable of verifying properties and deadlock-freedom of DALA, an autonomous robot whose behaviors in the functional level are described with 500000 lines of C Code. This experiment, which is conducted with industrial partners, is far beyond the scope of existing academic tools such as NuSMV or SPIN.