Sciweavers

2974 search results - page 100 / 595
» Model-Driven Constraint Programming
Sort
View
PLDI
2004
ACM
15 years 11 months ago
The set constraint/CFL reachability connection in practice
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...
John Kodumal, Alexander Aiken
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 6 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
SARA
2009
Springer
15 years 10 months ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
CP
2005
Springer
15 years 11 months ago
SPREAD: A Balancing Constraint Based on Statistics
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...
Gilles Pesant, Jean-Charles Régin
ICSOC
2007
Springer
16 years 13 days ago
Pattern Based SOA Deployment
Abstract. A key function of a Service Oriented Architecture is the separation between business logic and the platform of its implementation and deployment. Much of the focus in SOA...
William Arnold, Tamar Eilam, Michael H. Kalantar, ...