Sciweavers

7092 search results - page 135 / 1419
» Parallelizing constraint programs
Sort
View
PADL
2010
Springer
14 years 7 months ago
Lazy Explanations for Constraint Propagators
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
Ian P. Gent, Ian Miguel, Neil C. A. Moore
ICMT
2009
Springer
14 years 3 months ago
Solving Constraints in Model Transformations
Abstract. Constraint programming holds many promises for model driven software development (MDSD). Up to now, constraints have only started to appear in MDSD modeling languages, bu...
Andreas Petter, Alexander Behring, Max Mühlh&...
CP
2003
Springer
14 years 3 months ago
Box Constraint Collections for Adhoc Constraints
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
Chi Kan Cheng, Jimmy Ho-Man Lee, Peter J. Stuckey
ISCA
1992
IEEE
113views Hardware» more  ISCA 1992»
14 years 2 months ago
Dynamic Dependency Analysis of Ordinary Programs
A quantitative analysis of program execution is essential to the computer architecture design process. With the current trend in architecture of enhancing the performance of unipr...
Todd M. Austin, Gurindar S. Sohi
ISSTA
2006
ACM
14 years 4 months ago
Using model checking with symbolic execution to verify parallel numerical programs
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...
Stephen F. Siegel, Anastasia Mironova, George S. A...