Skip to main content
SpringerLink
Log in

Conclusion

  • Chapter
  • First Online:
Verification of Business Rules Programs

  • 495 Accesses

Abstract

This chapters provides a summary of the work exposed in this book. It reviews our contribution from the standpoint of the tension between local and global approaches to rule programs as handled by Business Rules Management Systems. In this last chapter, we also suggest directions for extensions of this work.

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

Access this chapter

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 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

Notes

  1. 1.

    See p. 57 for the definition of \({\mathsf{Id}}^{-}\).

  2. 2.

    All URLs were successfully accessed on January 22, 2013.

References

All URLs were successfully accessed on January 22, 2013.

  1. Apple: Introducing iPad. http://movies.apple.com/media/us/ipad/2010/tours/apple-ipad-video-us-20100127_r640-9cie.mov

  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. Basler, G., Mazzucchi, M., Wahl, T., Kroening, D.: Symbolic counter abstraction for concurrent software. In: Bouajjani, A., Maler, O. (eds.) CAV. Lecture Notes in Computer Science, vol. 5643, pp. 64–78. Springer, Berlin (2009)

    Google Scholar 

  4. Berstel-Da Silva, B.: Formalizing both refraction-based and sequential executions of production rule programs. In: Bikakis, A., Giurca, A. (eds.) Rules on the Web: Research and Applications. Lecture Notes in Computer Science, vol. 7438, pp. 47–61. Springer, Berlin (2012)

    Chapter  Google Scholar 

  5. Cook, B., Podelski, A., Rybalchenko, A.: Proving thread termination. In: Ferrante, J., McKinley, K.S. (eds.) PLDI, pp. 320–330. ACM, New York (2007)

    Google Scholar 

  6. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL’77, pp. 238–252. ACM, New York (1977)

    Google Scholar 

  7. Emerson, E.A., Trefler, R.J.: From asymmetry to full symmetry: New techniques for symmetry reduction in model checking. In: Pierre, L., Kropf, T. (eds.) CHARME. Lecture Notes in Computer Science, vol. 1703, pp. 142–156. Springer, Berlin (1999)

    Google Scholar 

  8. Fair, Isaac, and Company: High-volume batch processing with Blaze Advisor. Computer World UK (2007). http://www.computerworlduk.com/white-paper/business-process/5092/high-volume-batch-processing-with-blaze-advisor/

  9. Graf, S., Saïdi, H.: Construction of abstract state graphs with PVS. In: Grumberg, O. (ed.) CAV. Lecture Notes in Computer Science, vol. 1254, pp. 72–83. Springer, Berlin (1997)

    Google Scholar 

  10. IBM: IBM Operational Decision Manager v8.0 User’s Manual (2012). http://publib.boulder.ibm.com/infocenter/dmanager/v8r0/

  11. Jhala, R., Majumdar, R.: Software model checking. ACM Comput. Surv. 41(4), 21:1–21:54 (2009)

    Google Scholar 

  12. Knuth, D., Bendix, P.: Simple word problems in universal algebra. In: Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, Oxford (1970)

    Google Scholar 

  13. Lahiri, S.K., Bryant, R.E., Cook, B.: A symbolic approach to predicate abstraction. In: Hunt, W.A. Jr., Somenzi, F. (eds.) CAV. Lecture Notes in Computer Science, vol. 2725, pp. 141–153. Springer, Berlin (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  15. Pnueli, A., Xu, J., Zuck, L.D.: Liveness with (0, 1, ∞)-counter abstraction. In: Brinksma, E., Larsen, K.G. (eds.) CAV. Lecture Notes in Computer Science, vol. 2404, pp. 107–122. Springer, Berlin (2002)

    Google Scholar 

  16. Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32–41. IEEE Computer Society, Silver Spring (2004)

    Google Scholar 

  17. Podelski, A., Rybalchenko, A.: Transition predicate abstraction and fair termination. In: Palsberg, J., Abadi, M. (eds.) POPL, pp. 132–144. ACM, New York (2005)

    Google Scholar 

  18. Red Hat: JBoss Rules 5 Reference Guide (2012). https://access.redhat.com/knowledge/docs/en-US/JBoss_Enterprise_BRMS_Platform/5/html-single/JBoss_Rules_5_Reference_Guide/index.html#Sequential_Mode

  19. de Sainte Marie, C., Hallmark, G., Paschke, A.: Rule Interchange Format, Production Rule Dialect. Recommendation, W3C (2010). http://www.w3.org/TR/rif-prd/

  20. Schmolze, J.G., Snyder, W.: Using confluence to control parallel production systems. In: Kanal, L.N. (ed.) Parallel Processing for Artificial Intelligence. Elsevier Science, New York (1994)

    Google Scholar 

  21. Schmolze, J.G., Snyder, W.: Detecting redundancy among production rules using term rewrite semantics. Knowl. Base. Syst. 12(1–2), 3–11 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Engineering group, University of Freiburg, Georges-Köhler-Allee 52, 79110, Freiburg, Germany

    Bruno Berstel-Da Silva

Authors
  1. Bruno Berstel-Da Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Berstel-Da Silva, B. (2014). Conclusion. In: Verification of Business Rules Programs. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40038-4_11

Download citation

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

  • 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

Search

Navigation