Handling Conflicts in Depth-First-Search for LTL Tableau to Debug Compliance Based Languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Handling Conflicts in Depth-First-Search for LTL Tableau to Debug Compliance Based Languages

François Hantry
  • Fonction : Auteur
  • PersonId : 987722
Mohand-Said Hacid

Résumé

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, whithout re-exploring the history of the solver. We provide sound and complete proofs together with complexity results.

Dates et versions

hal-01354475 , version 1 (18-08-2016)

Identifiants

Citer

François Hantry, Mohand-Said Hacid. Handling Conflicts in Depth-First-Search for LTL Tableau to Debug Compliance Based Languages. Fifth Workshop on Formal Languages and Analysis of Contract-Oriented Software (FLACOS 2011), Sep 2011, Malaga, Spain. pp.39-53, ⟨10.4204/EPTCS.68.5⟩. ⟨hal-01354475⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More