The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about infinite computations
Information and Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Formal verification in a commercial setting
DAC '97 Proceedings of the 34th annual Design Automation Conference
Model Checking of Safety Properties
Formal Methods in System Design
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
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of solvable cases of the decision problem for the predicate calculus
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
A topological characterization of weakness
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Coverage metrics for requirements-based testing
Proceedings of the 2006 international symposium on Software testing and analysis
25 Years of Model Checking
An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Explaining Counterexamples Using Causality
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Model checking PSL using HOL and SMV
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Syntactic optimizations for PSL verification
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
PSL for runtime verification: theory and practice
RV'07 Proceedings of the 7th international conference on Runtime verification
Pillars of computer science
The theory and practice of SALT
NFM'11 Proceedings of the Third international conference on NASA Formal methods
SALT—structured assertion language for temporal logic
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
From PSL to LTL: a formal validation in HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
An asymptotically correct finite path semantics for LTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |
There has been a major emphasis recently in the semiconductor industry on designing industrial-strength property specification languages. Two major languages are ForSpec and Sugar 2.0, which are both extensions of Pnueli's LTL. Both ForSpec and Sugar 2.0 directly support reset/abort signals, in which a check for a property ψ may be terminated and declared successful by a reset/abort signal, provided the check has not yet failed. ForSpec and Sugar 2.0, however, differ in their definition of failure. The definition of failure in ForSpec is syntactic, while the definition in Sugar 2.0 is semantic. In this work we examine the implications of this distinction between the two approaches, which we refer to as the reset approach (for ForSpec) and the abort approach (for Sugar 2.0). In order to focus on the reset/abort issue, we do not consider the full languages, which are quite rich, but rather the extensions of LTL with the reset/abort constructs. We show that the distinction between syntactic and semantic failure has a dramatic impact on the complexity of using the language in a model-checking tool. We prove that Reset-LTL enjoys the "fast-compilation property": there is a linear translation of Reset-LTL formulas into alternating Büchi automata, which implies a linear translation of Reset-LTL formulas into a symbolic representation of nondeterministic Büchi automata. In contrast, the translation of Abort-LTL formulas into alternating Büchi automata is nonelementary (i.e., cannot be bounded by a stack of exponentials of a bounded height); each abort yields an exponential blow-up in the translation. This complexity bounds also apply to model checking; model checking Reset-LTL formulas is exponential in the size of the property, while model checking Abort-LTL formulas is nonelementary in the size of the property (the same bounds apply to satisfiability checking).