Skip to main content
SpringerLink
Log in
Book cover

Scalable Techniques for Formal Verification pp 53–64Cite as

Sequential Programs

  • Chapter
  • First Online:

  • 698 Accesses

Abstract

In this chapter, we discuss models of sequential programs, formalize the statement of correctness that we want to prove, and present the standard deductive approaches to derive such a correctness statement. We then discuss some deficiencies in the standard approaches.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Notes

  1. 1.

    Stepwise invariants are also often referred to as inductive invariants. We do not use this term for sequential programs, since we want to reserve its use to apply to an analogous concept for reactive systems.

References

  1. G. Hamon and J. Rushby. An Operational Semantics for Stateflow. In M. Wermelinger and T. Margaria, editors, Proceedings of the 7th International Conference on Fundamental Approaches to Software Engineering (FASE 2004), volume 2984 of LNCS, pages 229–243, Barcelona, Spain, 2004. Springer-Verlag.

    Chapter  Google Scholar 

  2. H. Liu and J. S. Moore. Executable JVM model for Analytical Reasoning: A Study. Science of Computer Programming, 57(3):253–274, 2005.

    Article  MathSciNet  MATH  Google Scholar 

  3. J. McCarthy. Towards a Mathematical Science of Computation. In Proceedings of the Information Processing Congress, volume 62, pages 21–28. North-Holland, August 1962.

    Google Scholar 

  4. M. Norrish. C Formalised in HOL. PhD thesis, University of Cambridge, 1998.

    Google Scholar 

  5. M. Strecker. Formal Verification of a Java Compiler in Isabelle. In A. Voronkov, editor, Proeedings of the 18th International Conference on Automated Deduction (CADE 2002), volume 2392 of LNCS, pages 63–77. Springer-Verlag, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, University of Texas, Austin, University Station 1 MS C0500, 78712-0233, Austin, Texas, USA

    Dr. Sandip Ray

Authors
  1. Dr. Sandip Ray
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sandip Ray .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Ray, S. (2010). Sequential Programs. In: Scalable Techniques for Formal Verification. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5998-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-5998-0_4

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5997-3

  • Online ISBN: 978-1-4419-5998-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation