Service Verification

A framework for fast service verification and query execution using Boolean service rules


The problem of service rule verification has attracted some attention in recent years. In this paper, we consider service rules in simple Boolean logic and present a new method for business rule verification using simultaneous minimal support set computation. As we show here, the problem is similar in flavor to the problem of prime implicant generation of a given Boolean function which has alluded researchers for several decades and significant efforts in this direction have been reported in literature, with proposals of widely varying algorithms and data structures. In this work, we revisit this problem in the context of business rules and present a new method that aids in rule verification and also in query execution at runtime. Our method builds on the classical binary decision diagram data structure for representing business rules and generates the test scenarios by a simple traversal algorithm.


Publication:

  1. S. Chattopadhyay, S. Dutta, A. Banerjee, “A framework for fast service verification and query execution using Boolean service rules”, Proc. Asia Pacific Service Computing Conference (APSCC), Thailand, pp. 17-32, 2015.(link)