Reasoning about infinite computations
Information and Computation
Software reliability methods
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
On Solving Temporal Logic Queries
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
chi-Chek: A Multi-valued Model-Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Efficient Detection of Vacuity in ACTL Formulas
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Expressibility results for linear-time and branching-time logics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Three optimizations for Assume---Guarantee reasoning with L*
Formal Methods in System Design
Temporal Logic Query Checking: A Tool for Model Exploration
IEEE Transactions on Software Engineering
An abstraction-refinement framework for trigger querying
SAS'11 Proceedings of the 18th international conference on Static analysis
| Hi-index | 0.00 |
Given a model M and a temporal logic formula ϕ[?], where ? is a placeholder, the query checking problem, as defined for the case of CTL by Chan in 2000, is to find the strongest propositional formula f such that M |= ϕ[? ← f]. The motivation for solving this problem is, among other things, to get insight on the model. We consider various objectives to the LTL query-checking problem, and study the question of whether there is a better solution than simply enumerating all possible formulas (modulo logical equivalence). It turns out that in most cases the answer is no, but there is one particular objective for which the answer - in practice - is definitely yes. The solution is based on a reduction to a Pseudo-Boolean Solving problem.