Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
A Textbook of Belief Dynamics: Solutions to Exercises
A Textbook of Belief Dynamics: Solutions to Exercises
Bounded model checking for the universal fragment of CTL
Fundamenta Informaticae
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Structure Preserving Encoding of Z in Isabelle/HOL
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Another Look at LTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
| Hi-index | 0.00 |
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.