Skip to main content

Main Steps in Rule Program Verification

  • Chapter
  • First Online:
Verification of Business Rules Programs
  • 505 Accesses

Abstract

This chapter is the first of Part IV, in which propose a compositional verification method to derive a correctness formula for a rule program from individual correctness formulas for its rules. This verification method is composed of several proof rules that are suited to various types of rule programs and assertions. In the present chapter, we introduce a simpler proof rule for a particular class of rule programs, so as to exhibit the core mechanism at play.

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

Access this chapter

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 EPUB and 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
Hardcover Book
USD 54.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

Institutional subscriptions

References

  1. Apt, K.R., Olderog, E.R.: Verification of Sequential and Concurrent Programs, 2nd edn. Texts in Computer Science. Springer, Berlin (1997)

    Book  MATH  Google Scholar 

  2. Apt, K.R., de Boer, F.S., Olderog, E.R.: Verification of Sequential and Concurrent Programs, 3rd edn. Texts in Computer Science. Springer, Berlin (2009)

    Book  MATH  Google Scholar 

  3. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. 3(2), 125–143 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lipton, R.J.: Reduction: A method of proving properties of parallel programs. Comm. ACM 18(12), 717–721 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  5. Morris, J.M.: A general axiom of assignment. In: Bauer, F.L., Dijkstra, E.W., Hoare, C.A.R. (eds.) Theoretical Foundations of Programming Methodology: Lecture Notes of an International Summer School. Reidel, Dordrecht (1982)

    Google Scholar 

  6. Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Informatica 6, 319–340 (1976)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Berstel-Da Silva, B. (2014). Main Steps in Rule Program Verification. In: Verification of Business Rules Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40038-4_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40038-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40037-7

  • Online ISBN: 978-3-642-40038-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics