816 search results - page 2 / 164 » SAT-Based Image Computation with Application in Reachability... |
CAV
2009
Springer
14 years 5 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
CONCUR
1997
Springer
13 years 9 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
CHARME
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
ICCAD
2001
IEEE
14 years 2 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...