Sciweavers

68 search results - page 13 / 14
» Resolution Tunnels for Improved SAT Solver Performance
Sort
View
ISSTA
2004
ACM
13 years 11 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
CP
2006
Springer
13 years 10 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
FM
2008
Springer
152views Formal Methods» more  FM 2008»
13 years 8 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
IPPS
2007
IEEE
14 years 20 days ago
Inverse Space-Filling Curve Partitioning of a Global Ocean Model
In this paper, we describe how inverse space-filling curve partitioning is used to increase the simulation rate of a global ocean model. Space-filling curve partitioning allows ...
John M. Dennis
CF
2010
ACM
13 years 11 months ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross