Skip to main content
SpringerLink
Log in

VCC: A Practical System for Verifying Concurrent C

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5674))

Included in the following conference series:

Abstract

VCC is an industrial-strength verification environment for low-level concurrent system code written in C. VCC takes a program (annotated with function contracts, state assertions, and type invariants) and attempts to prove the correctness of these annotations. It includes tools for monitoring proof attempts and constructing partial counterexample executions for failed proofs. This paper motivates VCC, describes our verification methodology, describes the architecture of VCC, and reports on our experience using VCC to verify the Microsoft Hyper-V hypervisor.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Verisoft XT: The Verisoft XT project (2007), http://www.verisoftxt.de

  2. Cohen, E., Moskal, M., Schulte, W., Tobies, S.: A precise yet efficient memory model for C. In: SSV 2009. ENTCS. Elsevier Science B.V., Amsterdam (2009)

    Google Scholar 

  3. Flanagan, C., Freund, S.N., Qadeer, S.: Thread-modular verification for shared-memory programs. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 262–277. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Jacobs, B., Piessens, F., Leino, K.R.M., Schulte, W.: Safe concurrency for aggregate objects with invariants. In: Aichernig, B.K., Beckert, B. (eds.) SEFM 2005, pp. 137–147. IEEE, Los Alamitos (2005)

    Google Scholar 

  5. Maus, S., Moskal, M., Schulte, W.: Vx86: x86 assembler simulated in C powered by automated theorem proving. In: Meseguer, J., Roşu, G. (eds.) AMAST 2008. LNCS, vol. 5140, pp. 284–298. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Advanced Micro Devices (AMD), Inc.: AMD64 Architecture Programmer’s Manual: Vol. 1-3 (2006)

    Google Scholar 

  7. Intel Corporation: Intel 64 and IA-32 Architectures Software Developer’s Manual: Vol. 1-3b (2006)

    Google Scholar 

  8. Flanagan, C., Leino, K.R.M., Lillibridge, M., Nelson, G., Saxe, J.B., Stata, R.: Extended static checking for Java. SIGPLAN Notices 37(5), 234–245 (2002)

    Article  Google Scholar 

  9. Barnett, M., Leino, K.R.M., Schulte, W.: The Spec# programming system: An overview. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 49–69. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Microsoft Research: The HAVOC property checker, http://research.microsoft.com/projects/havoc

  11. Hillebrand, M.A., Leinenbach, D.C.: Formal verification of a reader-writer lock implementation in C. In: SSV 2009. ENTCS, Elsevier Science B.V., Amsterdam (2009); Source code, http://www.verisoftxt.de/PublicationPage.html

    Google Scholar 

  12. Microsoft Research: Common compiler infrastructure, http://ccimetadata.codeplex.com/

  13. Botinĉan, M., Parkinson, M., Schulte, W.: Separation logic verification of C programs with an SMT solver. In: SSV 2009. ENTCS. Elsevier Science B.V., Amsterdam (2009)

    Google Scholar 

  14. Barnett, M., Chang, B.Y.E., Deline, R., Jacobs, B., Leino, K.R.M.: Boogie: A modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364–387. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Böhme, S., Moskal, M., Schulte, W., Wolff, B.: HOL-Boogie: An interactive prover-backend for the Verifiying C Compiler. Journal of Automated Reasoning (to appear, 2009)

    Google Scholar 

  16. de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  17. Owicki, S., Gries, D.: Verifying properties of parallel programs: An axiomatic approach. Communications of the ACM 19(5), 279–285 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  18. Ashcroft, E.A.: Proving assertions about parallel programs. Journal of Computer and System Sciences 10(1), 110–135 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  19. Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Transactions on Programming Languages and Systems 5(4), 596–619 (1983)

    Article  MATH  Google Scholar 

  20. O’Hearn, P.W.: Resources, concurrency, and local reasoning. Theoretical Computer Science 375(1-3), 271–307 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS 2002, pp. 55–74. IEEE, Los Alamitos (2002)

    Google Scholar 

  22. Bornat, R., Calcagno, C., O’Hearn, P.W., Parkinson, M.J.: Permission accounting in separation logic. In: Palsberg, J., Abadi, M. (eds.) POPL 2005, pp. 259–270. ACM, New York (2005)

    Google Scholar 

  23. Vafeiadis, V., Parkinson, M.J.: A marriage of rely/guarantee and separation logic. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 256–271. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  24. Leino, K.R.M., Müller, P.: A basis for verifying multi-threaded programs. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 378–393. Springer, Heidelberg (2009)

    Google Scholar 

  25. Leino, K.R.M., Schulte, W.: Using history invariants to verify observers. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 80–94. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Klein, G.: Operating system verification – An overview. Sādhanā: Academy Proceedings in Engineering Sciences 34(1), 27–69 (2009)

    MathSciNet  MATH  Google Scholar 

  27. Journal of Automated Reasoning: Operating System Verification 42(2–4) (2009)

    Google Scholar 

  28. Hohmuth, M., Tews, H.: The VFiasco approach for a verified operating system. In: 2nd ECOOP Workshop in Programming Languages and Operating Systems (2005)

    Google Scholar 

  29. Heiser, G., Elphinstone, K., Kuz, I., Klein, G., Petters, S.M.: Towards trustworthy computing systems: Taking microkernels to the next level. SIGOPS Oper. Syst. Rev. 41(4), 3–11 (2007)

    Article  Google Scholar 

  30. Ni, Z., Yu, D., Shao, Z.: Using XCAP to certify realistic systems code: Machine context management. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 189–206. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  31. Alkassar, E., Hillebrand, M.A., Leinenbach, D.C., Schirmer, N.W., Starostin, A., Tsyban, A.: Balancing the load: Leveraging a semantics stack for systems verification. Journal of Automated Reasoning: Operating System Verification 27, 389–454

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Corporation, Redmond, WA, USA

    Ernie Cohen

  2. European Microsoft Innovation Center, Aachen, Germany

    Markus Dahlweid, Michał Moskal, Thomas Santen & Stephan Tobies

  3. German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany

    Mark Hillebrand & Dirk Leinenbach

  4. Microsoft Research, Redmond, WA, USA

    Wolfram Schulte

Authors
  1. Ernie Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Dahlweid
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Hillebrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dirk Leinenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Michał Moskal
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Thomas Santen
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Wolfram Schulte
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Stephan Tobies
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Boltzmannstraße 3, 85748, Garching, Germany

    Stefan Berghofer , Tobias Nipkow , Christian Urban  & Makarius Wenzel , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, E. et al. (2009). VCC: A Practical System for Verifying Concurrent C. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2009. Lecture Notes in Computer Science, vol 5674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03359-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03359-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03358-2

  • Online ISBN: 978-3-642-03359-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation