2896 search results - page 201 / 580 » Curricula Modeling and Checking |
141
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...
156
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...
157
click to vote
STTT
2008
15 years 5 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...
249
click to vote
CONCUR
2011
Springer
14 years 5 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...
148
click to vote
CBSE
2006
Springer
15 years 8 months ago
2006
Springer
Ideally in the deployment phase, components should be composable, and their composition checked. Current component models fall short of this ideal. Most models do not allow composi...