2864 search results - page 94 / 573 » Constraint Programming in OPL |
PLDI
2004
ACM
14 years 2 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
SARA
2009
Springer
14 years 1 months ago
2009
Springer
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
ECOOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...