Abstract
This chapter studies the semantics of rule programs from the viewpoint of the relation between their initial and final states. To this end, it defines correctness formulas in the classical form of so-called Hoare triples \(\{p_{}\}\,r_{}\,\{q_{}\}\), where r is a rule. It then defines correctness formulas of the same form \(\{p_{}\}\,\mathcal{R}_{}\,\{q_{}\}\), where \(\mathcal{R}\) now is a rule program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apt, K.R.: Ten years of Hoare’s logic: A survey—part I. ACM Trans. Program. Lang. Syst. 3(4), 431–483 (1981)
Apt, K.R.: Ten years of Hoare’s logic: A survey—part II: Nondeterminism. Theor. Comp. Sci. 28, 83–109 (1984)
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)
de Bakker, J.W., de Bruin, A., Zucker, J.: Mathematical Theory of Program Correctness. Prentice-Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (1980)
Floyd, R.W.: Assigning meaning to programs. In: Proceedings of the Symposium on Applied Math, vol. 19, pp. 19–32. American Mathematical Society, Providence (1967)
Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–580 (1969)
Manna, Z.: Mathematical Theory of Computation. Dover Books on Mathematics. Dover, New York (2003)
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)
Olderog, E.R.: Hoare’s logic for programs with procedures—What has been achieved? In: Clarke, E.M., Kozen, D. (eds.) Logics of Programs. Lecture Notes in Computer Science, vol. 164, pp. 383–395. Springer, Berlin (1984)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Berstel-Da Silva, B. (2014). Correctness of Rule Programs. In: Verification of Business Rules Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40038-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-40038-4_6
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)