5216 search results - page 884 / 1044 » Planning as Model Checking |
118
Voted
PLDI
2005
ACM
15 years 9 months ago
2005
ACM
We present a new technique, path slicing, that takes as input a possibly infeasible path to a target location, and eliminates all the operations that are irrelevant towards the re...
120
Voted
ATVA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
150
Voted
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
122
Voted
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
140
Voted
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...