The verification of concurrent systems with a large number of interacting components poses a significant challenge to the existing verification methodologies. We consider in this paper the formal verification of buffer cache algorithms of SVR3-type Unix systems using PVS.


Model Check Theorem Prove Mutual Exclusion Safety Property Concurrent System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    McMillan, K.L.: Symbolic Model Checking: An approach to the state explosion problem. PhD thesis, School of Computer Science, CMU (1992) Google Scholar
  2. 2.
    Rushby, J.: Specification, proof checking, and model checking for protocols and distributed systems with PVS. Tutorial presented at FORTE X/PSTV XVII (1997)Google Scholar
  3. 3.
    Shankar, N.: A lazy approach to compositional verification. Technical Report SRICSL-93-8, SRI Inti, Menio Park, CA (December 1993)Google Scholar
  4. 4.
    Havelund, K., Shankar, N.: Experiments in theorem proving and model checking for protocol verification. In: Gaudel, M.-C., Woodcock, J.C.P. (eds.) FME 1996. LNCS, vol. 1051, Springer, Heidelberg (1996)Google Scholar
  5. 5.
    Miller, S.P., Srivas, M.: Formal Verification of the AAMP5 Microprocessor. In: WIFT 1995, Boca Raton, Florida (April 1995)Google Scholar
  6. 6.
    Bach, M.J.: The Design of the UNIX Operating System. Prentice Hall, New Delhi (1994)Google Scholar
  7. 7.
    Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transaction on Programming Languages & Systems (September 1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • N. S. Pendharkar
    • 1
  • K. Gopinath
    • 1
  1. 1.Computer Science & Automation Indian Institute of ScienceBangalore

Personalised recommendations