320 search results - page 23 / 64 » Coverage Metrics for Temporal Logic Model Checking |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
LMCS
2007
14 years 9 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
ENTCS
2007
14 years 9 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
STACS
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...
110
click to vote
SPIN
2001
Springer
15 years 1 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...