skip to main content
tutorial

Bounded model checking of high-integrity software

Authors Info & Claims
Published:10 November 2013Publication History
Skip Abstract Section

Abstract

Model checking [5] is an automated algorithmic technique for exhaustive verification of systems, described as finite state machines, against temporal logic [9] specifications. It has been used successfully to verify hardware at an industrial scale [6]. One of the most successful variants of model checking is Bounded Model Checking (BMC) [2] which leverages the power of state-of-the-art satisfiability (SAT) 1 and satisfiability-modulo-theory (SMT) 2 to push the boundaries of automated verification. Like model checking, BMC was developed originally for hardware, but has since been extended and applied successfully to verify sequential [4], multi-threaded [1, 10], as well as real-time software [3].

A key benefit of BMC-based software model checkers, such as CBMC [4], is that they are able to handle bit-level semantics of programs precisely. Thus, they are able to detect errors due to integer overflows, and prove correctness of programs that use bit-level operations, without reporting false warnings, or missing bugs. This makes BMC ideal for verifying high-integrity software, where the cost of failure is substantial. Indeed, CBMC has been used to verify a wide variety of low-level safety and security-critical systems, such as co-pilots [8], OS schedulers [7], and hypervisors [11] (see url{http://www.cprover.org/cbmc/applications.shtml} for a more expansive list).

This tutorial will provide an introduction to BMC, its underlying technical principles, and applications to verifying sequential, multi-threaded, and real-time software. The tutorial will be hands-on, with live demonstrations of using BMC tools for verifying sample programs written in C.

References

  1. J. Alglave, D. Kroening, V. Nimal, and M. Tautschnig. Software Verification for Weak Memory via Program Transformation. In M. Felleisen and P. Gardner, editors, Proceedings of the 22nd European Symposium On Programming (ESOP '13), volume 7792 of Lecture Notes in Computer Science, pages 512--532, Rome, Italy, March 2013. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Biere, A. Cimatti, E. M. Clarke, O. Strichman, and Y. Zue. Bounded Model Checking, volume 58 of Advances in computers. Academic Press, 2003.Google ScholarGoogle Scholar
  3. S. Chaki, A. Gurfinkel, S. Kong, and O. Strichman. Compositional Sequentialization of Periodic Programs. In R. Giacobazzi, J. Berdine, and I. Mastroeni, editors, Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI '13), volume 7737 of Lecture Notes in Computer Science, pages 536--554, Rome, Italy. New York, January 2013. Springer-Verlag.Google ScholarGoogle Scholar
  4. E. Clarke, D. Kroening, and F. Lerda. A Tool for Checking ANSI-C Programs. In K. Jensen and A. Podelski, editors, Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '04), volume 2988 of Lecture Notes in Computer Science, pages 168--176, Barcelona, Spain, March 29--April 2, 2004. New York, NY, March--April 2004. Springer-Verlag.Google ScholarGoogle Scholar
  5. E. M. Clarke, E. A. Emerson, and J. Sifakis. Model checking: algorithmic verification and debugging. Communications of the ACM (CACM), 52(11):74--84, November 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. M. Clarke, O. Grumberg, H. Hiraishi, S. Jha, D. E. Long, K. L. McMillan, and L. A. Ness. Verification of the FuturebusGoogle ScholarGoogle Scholar
  7. Cache Coherence Protocol. Formal Methods in System Design (FMSD), 6(2):217--232, March 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. K. Ludwich and A. A. Fröhlich. On the formal verification of component-based embedded operating systems. Operating Systems Review, 46(1):28--34, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. Pike, S. Niller, and N. Wegmann. Runtime Verification for Ultra-Critical Systems. In S. Khurshid and K. Sen, editors, Proceedings of the 2nd International Conference on Runtime Verification (RV '11), volume 7186 of Lecture Notes in Computer Science, pages 310--324, San Francisco, CA, USA, September 2011. Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. A. Pnueli. The Temporal Logic of Programs. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS '77), pages 46--57, Providence, RI, October 31--November 2, 1977. New York, NY, October--November 1977. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. Sinha and C. Wang. Staged concurrent program analysis. In Proceedings of the 18th ACM SIGSOFT Symposium on Foundations of Software Engineering (FSE '10), pages 47--56, Santa Fe, NM, USA, November 7--11, 2010, November 2010. Association for Computing Machinery. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Vasudevan, S. Chaki, L. Jia, J. M. McCune, J. Newsome, and A. Datta. Design, Implementation and Verification of an eXtensible and Modular Hypervisor Framework. In Proceedings of the 34th IEEE Symposium on Security and Privacy (Oakland '13), pages 430--444, San Francisco, CA, USA, May 2013. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Bounded model checking of high-integrity software

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!