168 search results - page 28 / 34 » On Models for Quantified Boolean Formulas |
FORMATS
2004
Springer
14 years 26 days ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
VLDB
1992
ACM
13 years 11 months ago
1992
ACM
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
FMCAD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
FMCAD
2009
Springer
14 years 2 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
VLDB
2004
ACM
14 years 25 days ago
2004
ACM
We consider the problem of estimating set-expression cardinality in a distributed streaming environment where rapid update streams originating at remote sites are continually tran...