Model exploration with temporal logic query checking
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Model exploration with temporal logic query checking
ACM SIGSOFT Software Engineering Notes
On Solving Temporal Logic Queries
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
chi-Chek: A Multi-valued Model-Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Checking Finite Traces Using Alternating Automata
Formal Methods in System Design
Parameterized Interfaces for Open System Verification of Product Lines
Proceedings of the 19th IEEE international conference on Automated software engineering
Efficient temporal-logic query checking for presburger systems
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Collecting Statistics Over Runtime Executions
Formal Methods in System Design
Data structures for symbolic multi-valued model-checking
Formal Methods in System Design
Query-Based Model Checking of Ad Hoc Network Protocols
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Framework for Compositional Verification of Multi-valued Systems via Abstraction-Refinement
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Specification, Verification and Explanation of Violation for Data Aware Compliance Rules
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Consistent Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
On the distributivity of LTL specifications
ACM Transactions on Computational Logic (TOCL)
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Finding state solutions to temporal logic queries
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Latticed simulation relations and games
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
On the notion of vacuous truth
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Visually specifying compliance rules and explaining their violations for business processes
Journal of Visual Languages and Computing
Variants of LTL query checking
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Minimizing deterministic lattice automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
An abstraction-refinement framework for trigger querying
SAS'11 Proceedings of the 18th international conference on Static analysis
Linear temporal logic with until and before on integer numbers, deciding algorithms
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Multi-valued model checking games
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Multi-valued model checking games
Journal of Computer and System Sciences
Sanity checks in formal verification
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Approximating deterministic lattice automata
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Parameterized weighted containment
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Abstract: A temporal logic query checker takes as input a Kripke structure and a temporal logic formula with a hole, and returns the set of propositional formulas that, when put in the hole, are satisfied by the Kripke structure. By allowing the temporal properties of a system to be discovered, query checking is useful in the study and reverse engineering of systems. Temporal logic query checking was first proposed in [2]. In this paper, we generalize and simplify Chan's work by showing how a new class of alternating automata can be used for query checking with a wide range of temporal logics.