7092 search results - page 358 / 1419 » Parallelizing constraint programs |
123
click to vote
APSEC
2005
IEEE
15 years 8 months ago
2005
IEEE
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
111
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
108
click to vote
CAV
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
118
click to vote
LPAR
2001
Springer
15 years 7 months ago
2001
Springer
When writing a constraint program, we have to decide what to make the decision variable, and how to represent the constraints on these variables. In many cases, there is considerab...
109
click to vote
AISC
2006
Springer
15 years 6 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...