Symbolic model checking with rich assertional languages
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 424-435
- https://doi.org/10.1007/3-540-63166-6_41
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- Branching-Time Temporal Logic and Tree AutomataInformation and Computation, 1996
- Reasoning about systems with many processesJournal of the ACM, 1992
- An experience in proving regular networks of processes by modular model checkingActa Informatica, 1992
- Verifying properties of large sets of processes with network invariantsLecture Notes in Computer Science, 1990
- Network grammars, communication behaviors and automatic verificationLecture Notes in Computer Science, 1990
- 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
- Tree acceptors and some of their applicationsJournal of Computer and System Sciences, 1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968