Sciweavers

1032 search results - page 18 / 207
» Extended Computation Tree Logic
Sort
View
VMCAI
2010
Springer
15 years 7 months ago
Collections, Cardinalities, and Relations
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Kuat Yessenov, Ruzica Piskac, Viktor Kuncak
FSTTCS
2000
Springer
15 years 1 months ago
Model Checking CTL Properties of Pushdown Systems
: 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 ...
Igor Walukiewicz
FUIN
2010
172views more  FUIN 2010»
14 years 7 months ago
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
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...
Michal Knapik, Wojciech Penczek, Maciej Szreter, A...