798 search results - page 62 / 160 » Proving More Properties with Bounded Model Checking |
114
click to vote
CHARME
2005
Springer
15 years 9 months ago
2005
Springer
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
127
click to vote
ICONIP
2004
15 years 5 months ago
2004
Variational methods have proved popular and effective for inference and learning in intractable graphical models. An attractive feature of the approaches based on the Kullback-Lei...
130
click to vote
JFP
2006
15 years 4 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
140
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
132
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract— This paper presents some recent developments of the LAAS architecture for autonomous mobile robots. In particular, we specify the role of the Execution Control level of...