2864 search results - page 248 / 573 » Constraint Programming in OPL |
159
click to vote
AGP
1996
IEEE
15 years 8 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
137
click to vote
FORTE
2004
15 years 6 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
138
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
150
click to vote
HOPL
2007
15 years 8 months ago
2007
This paper outlines the history of the C++ programming language from the early days of its ISO standardization (1991), through the 1998 ISO standard, to the later stages of the C+...
136
click to vote
ECOOP
2006
Springer
15 years 8 months ago
2006
Springer
In spite of the more advanced modularisation mechanisms, aspect-oriented programs still suffer from evolution problems. Due to the fragile pointcut problem, seemingly safe modifica...