6608 search results - page 272 / 1322 » On the Completeness of Model Checking |
158
click to vote
ICALP
2000
Springer
15 years 9 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...
167
click to vote
EUC
2008
Springer
15 years 7 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...
179
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...
165
click to vote
CBSE
2006
Springer
15 years 9 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...
150
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...