2873 search results - page 201 / 575 » Model Checking and the Mu-calculus |
133
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
141
click to vote
EUC
2008
Springer
15 years 6 months ago
2008
Springer
Static path analysis is a key process of Worst Case Execution Time (WCET) estimation, the objective of which is to find the execution path that has the largest execution time. Cur...
151
Voted
STTT
2008
15 years 4 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
147
click to vote
FUIN
2010
15 years 1 months 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...
236
click to vote
CONCUR
2011
Springer
14 years 4 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...