Towards Certified Model Checking for PLTL Using One-Pass Tableaux
Ver/
Fecha
2019-10-19Autor
Abuin Yepes, Alex
Bolotov, Alexander
Díaz de Cerio, Unai
Hermo Huguet, Montserrat
Lucio Carrasco, Francisca
Metadatos
Mostrar el registro completo del ítem
26th International Symposium on Temporal Representation and Reasoning LIPIcs 147 : (2019)
Resumen
The standard model checking setup analyses whether the given system specification satisfies a dedicated temporal property of the system, providing a positive answer here or a counter-example. At the same time, it is often useful to have an explicit proof that certifies the satisfiability. This is exactly what the certified model checking (CMC) has been introduced for. The paper argues that one-pass (context-based) tableau for PLTL can be efficiently used in the CMC setting, emphasising the following two advantages of this technique. First, the use of the context in which the eventualities occur forces them to fulfil as soon as possible. Second, a dual to the tableau sequent calculus can be used to formalise the certificates. The combination of the one-pass tableau and the dual sequent calculus enables us to provide not only counter-examples for unsatisfied properties but also proofs for satisfied properties that can be checked in a proof assistant. In addition, the construction of the tableau is enriched by an embedded solver, to which we dedicate those (propositional) computational tasks that are costly for the tableaux rules applied solely. The combination of the above techniques is particularly helpful in reasoning about large (system) specifications.