Formal verification of an O.S. submodule

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

Volumn 1530 LNCS, Issue , 1998, Pages 197-209

  Pendharkar, N S ^a   Gopinath, K ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER CACHES; CONCURRENT SYSTEMS; FORMAL VERIFICATIONS; SUBMODULES; UNIX SYSTEMS; VERIFICATION METHODOLOGY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE;

SOFTWARE ENGINEERING;

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

References (7)

1. K. L McMillan. Symbolic Model Checking: An approach to the state explosion problem. PhD thesis, School of Computer Science, CMU, 1992 199
2. John Rushby. Specification, proof checking, and model checking for protocols and distributed systems with PVS. Tutorial presented at FORTE X/PSTV XVII '97. 198, 199, 202, 203, 206
3. N. Shankar. A lazy approach to compositional verification. Technical Report SRICSL- 93-8, SRI Inti, Menio Park, CA, Dec 1993. 198
4. Klaus Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In FME'96, LNCS 1051, Mar 1996. 199
5. Steven P. Miller and M. Srivas. Formal Verification of the AAMP5 Microprocessor. WIFT'95, Boca Raton, Florida, Apr 1995. 199
6. Maurice J. Bach. The Design of the UNIX Operating System. Prentice Hall New Delhi, India, 1994. 199, 200, 201, 202
7. E.M. Clarke, 0. Grumberg and D.E. Long. Model Checking and Abstraction. ACM Transaction on Programming Languages & Systems, Sep 1994 198