Detection of Conflicting Compliance Rules

Web-based dynamic systems and pressured business environments need more than ever formal methods to analyze evolving compliance rules. Providing adequate tools to tackle the problem of debugging conflicting temporal compliance rules is an ongoing research topic. This problem is of paramount importance to achieve automatic support for early declarative design and to support evolution of rules in contract-based or service-based systems. In this paper we investigate the problem of extracting temporal unsatisfiable cores in order to detect the inconsistent part of a specification. We survey existing techniques to extract core and provide a new depth-first-search model checking which also enables to extract small unsatisfiable cores.

[1]  Stephan Merz,et al.  Model Checking , 2000 .

[2]  Lubos Brim,et al.  Scalable Multi-core LTL Model-Checking , 2007, SPIN.

[3]  Cheng Wu,et al.  BPSL Modeler - Visual Notation Language for Intuitive Business Property Reasoning , 2008, Electron. Notes Theor. Comput. Sci..

[4]  Moshe Y. Vardi,et al.  LTL Satisfiability Checking , 2007, SPIN.

[5]  Marco Pistore,et al.  Model checking early requirements specifications in Tropos , 2001, Proceedings Fifth IEEE International Symposium on Requirements Engineering.

[6]  Mathias Weske,et al.  Efficient Compliance Checking Using BPMN-Q and Temporal Logic , 2008, BPM.

[7]  Mike P. Papazoglou,et al.  A Business-Aware Web Services Transaction Model , 2006, ICSOC.

[8]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[9]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[10]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[11]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[12]  Inês Lynce,et al.  On Computing Minimum Unsatisfiable Cores , 2004, SAT.

[13]  Viktor Schuppan.  Towards a Notion of Unsatisfiable Cores for LTL , 2009, FSEN.

[14]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[15]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[16]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[17]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[18]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[19]  Rolf Drechsler,et al.  Using unsatisfiable cores to debug multiple design errors , 2008, GLSVLSI '08.

[20]  Kedar S. Namjoshi.  An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model Checking , 2004, CAV.

[21]  Xin Zhou,et al.  Regulations Expressed As Logical Models (REALM) , 2005, JURIX.

[22]  Thomas A. Henzinger,et al.  Logics and Models of Real Time: A Survey , 1991, REX Workshop.

[23]  Joël Ouaknine,et al.  Computational challenges in bounded model checking , 2005, International Journal on Software Tools for Technology Transfer.

[24]  Mary Sheeran,et al.  Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.

[25]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.

[26]  Jan Vanthienen,et al.  Compliant and Flexible Business Processes with Business Rules , 2006, BPMDS.

[27]  Felix Sheng-Ho Chang,et al.  Finding Minimal Unsatisfiable Cores of Declarative Specifications , 2008, FM.

[28]  Moshe Y. Vardi,et al.  Efficient LTL compilation for SAT-based model checking , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[29]  Viktor Schuppan,et al.  Linear Encodings of Bounded LTL Model Checking , 2006, Log. Methods Comput. Sci..

[30]  E. Clarke,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361).

[31]  Sharad Malik,et al.  Extracting small unsatis able cores from unsatis able boolean formulas , 2003 .

[32]  Frank Dignum,et al.  Designing a Deontic Logic of Deadlines , 2004, DEON.

[33]  Clare Dixon,et al.  A Graph-Based Approach to Resolution in Temporal Logic , 1994, ICTL.

[34]  Zohar Manna,et al.  A Decision Algorithm for Full Propositional Temporal Logic , 1993, CAV.

[35]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[36]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[37]  Maria E. Orlowska,et al.  Towards a Methodology for Deriving Contract-Compliant Business Processes , 2006, Business Process Management.

[38]  Marsha Chechik,et al.  Exploiting resolution proofs to speed up LTL vacuity detection for BMC , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[39]  Aditya K. Ghose,et al.  Auditing Business Process Compliance , 2007, ICSOC.

[40]  Gordon J. Pace,et al.  Automatic Conflict Detection on Contracts , 2009, ICTAC.

[41]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[42]  Ronald G. Ross.  Expressing business rules , 2000, SIGMOD '00.

[43]  Alberto Griggio,et al.  A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories , 2007, SAT.

[44]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[45]  Éric Grégoire,et al.  On Finding Minimally Unsatisfiable Cores of CSPS , 2008, Int. J. Artif. Intell. Tools.

[46]  Orna Kupferman,et al.  Vacuity Detection in Temporal Model Checking , 1999, CHARME.

[47]  Viktor Schuppan,et al.  Boolean Abstraction for Temporal Logic Satisfiability , 2007, CAV.

[48]  Frank Dignum,et al.  Combining dynamic deontic logic and temporal logic for the specification of deadlines , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

[49]  Annapaola Marconi,et al.  Synthesis and Composition of Web Services , 2009, SFM.

[50]  Michael Fisher,et al.  A Resolution Method for Temporal Logic , 1991, IJCAI.

[51]  Paola Mello,et al.  Declarative specification and verification of service choreographiess , 2010, TWEB.