Revising Specifications with CTL Properties Using Bounded Model Checking

During the process of software development, it is very common that inconsistencies arise between the formal specification and some desired property. Belief Revision deals with the problem of accommodating new information that may be inconsistent with an existing knowledge base. In this paper, we propose the use of belief revision techniques in order to deal with inconsistencies in formal specifications. The main problem to be solved is that the most well known results for belief revision only hold for logics which are monotonic and compact, while most discrete-time temporal logics used to express system properties --- and in particular, CTL -- are not compact. We suggest the use of bounded model-checking, transforming the problem from CTL into classical propositional logic and then transforming back the results to suggest revisions to the user.

[1]  Adam J. Grove,et al.  Two modellings for theory change , 1988, J. Philos. Log..

[2]  Armin Biere,et al.  Symbolic Model Checking without BDDs , 1999, TACAS.

[3]  David Aspinall,et al.  Formalising Java's Data Race Free Guarantee , 2007, TPHOLs.

[4]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[5]  Robert Büssow,et al.  Model checking combined Z and statechart specifications , 2003 .

[6]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Michael J. Butler,et al.  ProB: A Model Checker for B , 2003, FME.

[8]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[9]  Sven Ove Hansson,et al.  A Textbook Of Belief Dynamics , 1999 .

[10]  Stefania Gnesi,et al.  FME 2003: Formal Methods: International Symposium of Formal Methods Europe, Pisa, Italy, September 8-14, 2003. Proceedings , 2003, Lecture Notes in Computer Science.

[11]  Peter Gärdenfors,et al.  Knowledge in Flux: Modeling the Dynamics of Epistemic States , 2008 .

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

[13]  Mark Ryan,et al.  Logic in Computer Science: Modelling and Reasoning about Systems , 2000 .

[14]  Edmund M. Clarke,et al.  Another Look at LTL Model Checking , 1994, CAV.

[15]  Wojciech Penczek,et al.  Bounded Model Checking for the Universal Fragment of CTL , 2002, Fundam. Informaticae.

[16]  Kirsten Winter,et al.  Model Checking for Abstract State Machines , 2008, J. Univers. Comput. Sci..

[17]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[18]  Sven Ove Hansson.  A Textbook of Belief Dynamics: Solutions to Exercises , 2001 .

[19]  Burkhart Wolff,et al.  A Structure Preserving Encoding of Z in Isabelle/HOL , 1996, TPHOLs.

[20]  G. Flouris,et al.  On belief change and ontology evolution , 2006 .