622 search results - page 44 / 125 » Answer Set Programming and Bounded Model Checking |
131
click to vote
CAV
2000
Springer
15 years 5 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
116
click to vote
CHARME
2001
Springer
15 years 6 months ago
2001
Springer
We present a set of reduction rules for LTL model-checking of 1-safe Petri nets. Our reduction techniques are of two kinds: (1) Linear programming techniques which are based on wel...
111
click to vote
TACAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Model checking suffers not only from the state-space explosion problem, but also from the environment modeling problem: how can one create an accurate enough model of the...
134
click to vote
JUCS
2010
14 years 8 months ago
2010
: This paper formalizes UML class diagrams and structural patterns as mathematical objects and provides a precise notion of conformance of a structural model specified as a class d...
122
click to vote
LOPSTR
1994
Springer
15 years 6 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...