Formal Verification of an O.S. Submodule | SpringerLink
Skip to main content
Springer Nature Link
Log in

Formal Verification of an O.S. Submodule

  • Conference paper
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1530))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 9151
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. Shankar, N.: A lazy approach to compositional verification. Technical Report SRICSL-93-8, SRI Inti, Menio Park, CA (December 1993)

    Google Scholar 

  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. Miller, S.P., Srivas, M.: Formal Verification of the AAMP5 Microprocessor. In: WIFT 1995, Boca Raton, Florida (April 1995)

    Google Scholar 

  6. Bach, M.J.: The Design of the UNIX Operating System. Prentice Hall, New Delhi (1994)

    Google Scholar 

  7. Clarke, E.M., Grumberg, O., Long, D.E.: Model Checking and Abstraction. ACM Transaction on Programming Languages & Systems (September 1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science & Automation Indian Institute of Science, Bangalore

    N. S. Pendharkar & K. Gopinath

Authors
  1. N. S. Pendharkar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Gopinath
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pendharkar, N.S., Gopinath, K. (1998). Formal Verification of an O.S. Submodule. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65384-4

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics