6608 search results - page 39 / 1322 » On the Completeness of Model Checking |
TC
2002
15 years 11 days ago
2002
-- Here the method proposed in [13] for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of t...
213
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
CAV
2008
Springer
15 years 2 months ago
2008
Springer
Ideally, a model checking tool should successfully tackle state space explosion for complete system validation, while providing short counterexamples when an error exists. Techniqu...
89
Voted
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
93
Voted
IROS
2007
IEEE
15 years 7 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...