348 search results - page 10 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
174
Voted
ISSTA
2009
ACM
16 years 27 days 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 ...
171
Voted
ASIAN
2004
Springer
15 years 11 months ago
2004
Springer
A central problem in extending the von Neumann architecture to petaflop computers with millions of hardware threads and with a shared memory is defining the memory model [Lam79,...
175
Voted
ZUM
1998
Springer
15 years 10 months ago
1998
Springer
We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z [10] with a combination of Z and predicat...
165
Voted
AAECC
1999
Springer
15 years 6 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
350
Voted
COSIT
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We sy...