Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages
Logic in Computer Science
2011-09-14 v1
Abstract
Providing adequate tools to tackle the problem of inconsistent compliance rules is a critical 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 extend conflict-driven SAT-solver to provide a new conflict-driven depth-first-search solver for temporal logic. We use this solver to compute LTL unsatisfiable cores without re-exploring the history of the solver.
Cite
@article{arxiv.1109.2656,
title = {Handling Conflicts in Depth-First Search for LTL Tableau to Debug Compliance Based Languages},
author = {Francois Hantry and Mohand-Said Hacid},
journal= {arXiv preprint arXiv:1109.2656},
year = {2011}
}
Comments
In Proceedings FLACOS 2011, arXiv:1109.2399