2974 search results - page 258 / 595 » Model-Driven Constraint Programming |
192
click to vote
AGP
1996
IEEE
15 years 10 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 ...
166
click to vote
FORTE
2004
15 years 8 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 ...
181
click to vote
ISSTA
2009
ACM
16 years 1 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 ...
206
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
187
click to vote
HOPL
2007
15 years 10 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+...