475 search results - page 28 / 95 » Temporal Logic Model Checking (Abstract) |
145
click to vote
LMCS
2007
15 years 5 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...
153
click to vote
ENTCS
2007
15 years 5 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...
234
click to vote
SPIN
2001
Springer
15 years 10 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...
171
click to vote
LFCS
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
179
click to vote
TIME
2009
IEEE
16 years 19 days ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...