3147 search results - page 556 / 630 » Open-Source Model Checking |
ATVA
2005
Springer
14 years 1 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 ...
EMSOFT
2005
Springer
14 years 1 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...
PPDP
2005
Springer
14 years 1 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...
WEA
2005
Springer
14 years 1 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...
AIMSA
2004
Springer
14 years 1 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...