1179 search results - page 141 / 236 » Programming in Hybrid Constraint Languages |
195
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
CP
2003
Springer
15 years 6 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
136
click to vote
PEPM
1993
ACM
15 years 5 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
120
click to vote
PPDP
2010
Springer
14 years 12 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
120
click to vote
PADO
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We present a high-level approach to array bound check optimization that is neither hampered by recursive functions, nor disabled by the presence of partially redundant ch...