2974 search results - page 101 / 595 » Model-Driven Constraint Programming |
167
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
act notation, so separating the abstract syntax and semantics of the language constructs from their different concrete notations. Although the foundation constituents of the MDE a...
162
click to vote
ECOOP
2001
Springer
15 years 10 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...
166
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
178
click to vote
IJCAI
1989
15 years 7 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
157
click to vote
CPP
2011
14 years 6 months ago
2011
Abstract. In this paper we present a new technique for automatically verifying typing constraints in the setting of Dminor, a first-order data processing language with refinement...