Sciweavers

210 search results - page 5 / 42
» Universal Booleanization of Constraint Models
Sort
View
ECOOP
2011
Springer
12 years 10 months ago
Tunable Static Inference for Generic Universe Types
Object ownership is useful for many applications, including program verification, thread synchronization, and memory management. However, the annotation overhead of ownership type...
Werner Dietl, Michael D. Ernst, Peter Müller
AUSDM
2006
Springer
144views Data Mining» more  AUSDM 2006»
14 years 2 months ago
A Characterization of Wordnet Features in Boolean Models For Text Classification
Supervised text classification is the task of automatically assigning a category label to a previously unlabeled text document. We start with a collection of pre-labeled examples ...
Trevor N. Mansuy, Robert J. Hilderman
DATE
2010
IEEE
168views Hardware» more  DATE 2010»
14 years 2 months ago
Verifying UML/OCL models using Boolean satisfiability
Abstract--Nowadays, modeling languages like UML are essential in the design of complex software systems and also start to enter the domain of hardware and hardware/software codesig...
Mathias Soeken, Robert Wille, Mirco Kuhlmann, Mart...
PDPTA
2003
13 years 11 months ago
A Universal Parallel SAT Checking Kernel
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
Wolfgang Blochinger, Carsten Sinz, Wolfgang Kü...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
12 years 23 days ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich