Sciweavers

351 search results - page 54 / 71
» On the Learnability of Boolean Formulae
Sort
View
ATVA
2007
Springer
226views Hardware» more  ATVA 2007»
14 years 1 months ago
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
David Walter, Scott Little, Chris J. Myers
VLDB
2004
ACM
103views Database» more  VLDB 2004»
14 years 1 months ago
Distributed Set Expression Cardinality Estimation
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...
Abhinandan Das, Sumit Ganguly, Minos N. Garofalaki...
DAC
2010
ACM
13 years 11 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
CP
2006
Springer
13 years 11 months ago
Preprocessing QBF
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...
Horst Samulowitz, Jessica Davies, Fahiem Bacchus
FORMATS
2006
Springer
13 years 11 months ago
Temporal Logic Verification Using Simulation
In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the...
Georgios E. Fainekos, Antoine Girard, George J. Pa...