2584 search results - page 76 / 517 » On the Forward Checking Algorithm |
166
Voted
TACAS
2000
Springer
15 years 5 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
119
Voted
ATVA
2008
Springer
15 years 4 months ago
2008
Springer
e Abstraction Arie Gurfinkel1 , Ou Wei2 , and Marsha Chechik2 1 Software Engineering Institute, Carnegie Mellon University 2 Department of Computer Science, University of Toronto A...
100
Voted
IJRR
2002
15 years 1 months ago
2002
: This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: single-query
127
Voted
ICFEM
2009
Springer
14 years 12 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
123
click to vote
KBSE
2005
IEEE
15 years 7 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...