Combining model checking and theorem proving to verify parallel processes

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

Volumn 697 LNCS, Issue , 1993, Pages 154-165

  Hungar, Hardi ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; SPECIFICATIONS; THEOREM PROVING;

COMBINING MODEL; DERIVATION SYSTEM; FORMAL PROOFS; PARALLEL PROCESS; THEOREM PROVERS; VERIFICATION TECHNIQUES; VIA MODELING;

MODEL CHECKING;

EID: 84956986947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_13     Document Type: Conference Paper

References (9)

1. 20states and beyond, in: Proc. 5th IEEE Symp. Logic in Computer Science (1990).
2. Damm, W., Döhmen, G., Gerstner, V., and Josko, B. Modular verification of Petri nets: the temporal logic approach, in: deBakker, deRoever, Rozenberg (eds) Stepwise refinement of distributed systems: models, formalisms, correctness, Springer LNCS 430 (1990), 180-207.
3. Filkorn, T. Functional extension of symbolic model checking, in: Proc. CAV’91.
4. Fourman, M., Palmer, W., and Zimmer, R. Proof and synthesis, in Proc. ICCD’88, Rye Brook, NY, 1988.
5. Gordon, M.J.C. HOL: A proof generating system for higher-order logic, in: Birtwistle, Subrahmanyam (eds) VLSI specification, verification and synthesis, Kluwer (1988), 73-128.
6. Josko, B. Verifying the correctness of AADL modules using model checking, in: deBakker, deRoever, Rozenberg (eds) Stepwise refinement of distributed systems: models, formalisms, correctness, Springer LNCS 430 (1990), 386-400.
7. Mayger, E., and Fourman, M. Integration of formal methods with system design, in Proc. VLSI’91, Edinburgh.
8. Paulson, L., and Nipkow T. ISABELLE tutorial and user’s manual, Tech. Rep. No. 189, Univ. Cambridge Comp. Lab. (1990).
9. Wolper, P. Expressing interesting properties of programs in propositional temporal logic, POPL ’86, 184-193.