Verification of Business Rules Programs

This publication enables rule authors and tool developers to understand, express formally, and prove properties of the execution behavior of business rules programs. It includes a compositional verification method for proving correctness properties.

Rules represent a simplified means of programming, congruent with our understanding of human brain constructs. With the advent of business rules management systems, it has been possible to introduce rule-based programming to nonprogrammers, allowing them to map expert intent into code in applications such as fraud detection, financial transactions, healthcare, retail, and marketing. However, a remaining concern is the quality, safety, and reliability of the resulting programs.

This book is on business rules programs, that is, rule programs as handled in business rules management systems. Its conceptual contribution is to present the foundation for treating business rules as a topic of scientific investigation in semantics and program verification, while its technical contribution is to present an approach to the formal verification of business rules programs. The author proposes a method for proving correctness properties for a business rules program in a compositional way, meaning that the proof of a correctness property for a program is built up from correctness properties for the individual rulesthus bridging a gap between the intuitive understanding of rules and the formal semantics of rule programs. With this approach the author enables rule authors and tool developers to understand, express formally, and prove properties of the execution behavior of business rules programs.

This work will be of interest to practitioners and researchers in the areas of program verification, enterprise computing, database management, and artificial intelligence.

Approach to the formal verification of rule programs as found in business rules management systems Enables rule authors and tool developers to understand, express formally, and prove properties of the execution behavior of business rules programs Interesting for practitioners, researchers and graduate students Includes supplementary material: sn.pub/extras

Autorentext

Dr. Bruno Berstel-Da Silva graduated in 1990 from the École Nationale Supérieure d'Électrotechnique, d'Électronique, d'Informatique, d'Hydraulique et des Télécommunications (ENSEEIHT) in Toulouse with an engineering degree in computer science. He completed an M.Sc. (D.E.A.) in theoretical computer science at the Université Pierre et Marie Curie, Paris VI in 1991. He has worked for ILOG, now part of IBM, as a software engineer since 1996. He completed his PhD on the topic of Business Rules Management Systems in the Software Engineering group of the University of Freiburg. His main areas of interest are program verification, and more generally the static analysis of programs.

Inhalt

Chap. 1 - Introduction.- Chap. 2 - Related Work.- Chap. 3 - Syntax of Rules and Rule Programs.- Chap. 4 - States and State Assertions.- Chap. 5 - Operational Semantics of Rule Programs.- Chap. 6 - Correctness of Rule Programs.- Chap. 7 - Correctness of Programs: A Comparison.- Chap. 8 - Main Steps in Rule Program Verification.- Chap. 9 - A Verification Method for Rule Programs.- Chap. 10 - Specialized Proof Rules.- Chap. 11 - Conclusion.- Appendix A - Verification in an Industrial Business Rules Management System.- List of Proof Rules.- Index.