1032 search results - page 18 / 207 » Extended Computation Tree Logic |
135
click to vote
VMCAI
2010
Springer
16 years 25 days ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
90
Voted
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
136
click to vote
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
140
Voted
FUIN
2010
15 years 28 days ago
2010
Bounded Model Checking (BMC) is an efficient technique applicable to verification of temporal properties of (timed) distributed systems. In this paper we show for the first time ho...