An automatic abstraction technique for verifying featured, parameterised systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1614699 (Why is no real title available?)
- scientific article; zbMATH DE number 1670785 (Why is no real title available?)
- scientific article; zbMATH DE number 522852 (Why is no real title available?)
- scientific article; zbMATH DE number 734956 (Why is no real title available?)
- scientific article; zbMATH DE number 1927557 (Why is no real title available?)
- scientific article; zbMATH DE number 1744963 (Why is no real title available?)
- scientific article; zbMATH DE number 1418468 (Why is no real title available?)
- scientific article; zbMATH DE number 7088727 (Why is no real title available?)
- A structural induction theorem for processes
- Automatic verification of parameterized networks of processes
- Characterizing finite Kripke structures in propositional temporal logic
- Computer aided verification. 5th international conference, CAV '93, Elounda, Greece, June 28 - July 1, 1993. Proceedings
- Computer aided verification. 8th international conference, CAV '96, New Brunswick, NJ, USA, July 31 -- August 3, 1996. Proceedings
- Counterexample-guided abstraction refinement for symbolic model checking
- FM 2005: Formal Methods
- Interpolants and Symbolic Model Checking
- Objects, Agents, and Features
- Reasoning about networks with many identical finite state processes
- Reasoning about systems with many processes
- Verifying programs with unreliable channels
Cited in
(3)
This page was built for publication: An automatic abstraction technique for verifying featured, parameterised systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947791)