Symbolic model checking with rich assertional languages
- 1 April 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 256 (1-2) , 93-112
- https://doi.org/10.1016/s0304-3975(00)00103-1
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Automatic verification of parameterized synchronous systemsPublished by Springer Nature ,1996
- Mona: Monadic second-order logic in practicePublished by Springer Nature ,1995
- Verifying parameterized networks using abstraction and regular languagesPublished by Springer Nature ,1995
- Reasoning about ringsPublished by Association for Computing Machinery (ACM) ,1995
- An experience in proving regular networks of processes by modular model checkingActa Informatica, 1992
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Using branching time temporal logic to synthesize synchronization skeletonsScience of Computer Programming, 1982
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970