First-order-CTL model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1530 LNCS, Issue , 1998, Pages 283-295

  Bohn, Jürgen ^a   Damm, Werner ^a   Grumberg, Orna ^a   Hungar, Hardi ^a   Laster, Karen ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

DATA-INDEPENDENT SYSTEMS; EXPLICIT MODEL CHECKING; FIRST-ORDER CONDITIONS; FIRST-ORDER MODELS; SYMBOLIC MODEL CHECKING; SYSTEM VARIABLES; VERIFICATION CONDITION; VERIFICATION TASK;

ALGORITHMS; SOFTWARE ENGINEERING;

MODEL CHECKING;

EID: 84887074204     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-49382-2_27     Document Type: Conference Paper

References (11)

1. S. Berezin, A. Biere, E. Clarke, and Y. Zhu. Combining symbolic model checking with uninterpreted functions for out-of-order processor verification. submitted for publication. 285
2. Bernholtz, O., Vardi, M. and Wolper, P. An automata-theoretic approach to branching-time model checking, CAV '94, LNCS 818, 142-155. 284
3. Burch, J.R. and Dill, D.L. Automatic verification of pipelined microprocessor control, CAV '94, LNCS 818, 68-80. 284
4. Clarke, E.M., Grumberg, O. and Long, D.E. Model checking and abstraction, ACM TOPLAS, vol. 16, 5. 1512-1542. 1994. 284
5. Damm W., Hungar H., and Grumberg O. What if model checking must be truly symbolic. LNCS 987, 1995. 283, 284, 290, 291
6. Dingel, J. and Filkorn, T. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving, CAV '95, LNCS 939, 1995 284
7. Graf, S. Verification of a distributed cache memory by using abstractions, CAV '94, LNCS 818 (1994), 207-219. 284
8. A.J. Isles, R. Hojati, and R.K. Brayton. Computing reachability control states of systems modeled with uninterpreted functions and infinite memory. In Proc. of CAV'98, LNCS. 284
9. K. Sajid, A. Goel, H. Zhou, A. Aziz, S. Barber, and V. Singhal. BDD based procedures for the theory of equality with uninterpreted functions. In Proc. of CAV'98, LNCS, 1998. 284
10. Wolper, P. Expressing interesting properties of programs in propositional temporal logic, POPL '86, 184-193. 283, 284
11. Xu Y., Cerny E., Song X., Corella F., and Mohamed O.A. Model checking for a first-order temporal logic using multiway decision graphs. In Proc. of CAV'98, LNCS, 1998.