Rule-based programming has been gaining a lot of interest in the industry lately, through the growing use of rules to model the behavior of software systems. A demand for verifying and analyzing rule based systems has thus emerged. In this paper we propose a methodology, based on rewriting logic specifications written in CafeOBJ, for reasoning about structural errors of systems whose behavior is expressed in terms of reactive rules and verifying safety properties within the same framework. We present our approach through a simple but illustrative example of an e-commerce web site. © 2014 Springer International Publishing.
CITATION STYLE
Ksystra, K., Triantafyllou, N., & Stefaneas, P. (2014). On verifying reactive rules using rewriting logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8620 LNCS, pp. 67–81). Springer Verlag. https://doi.org/10.1007/978-3-319-09870-8_5
Mendeley helps you to discover research relevant for your work.