348 search results - page 44 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
117
click to vote
CL
1999
Springer
15 years 2 months ago
1999
Springer
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
141
click to vote
SMI
2010
IEEE
15 years 7 days ago
2010
IEEE
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
111
click to vote
PLDI
2005
ACM
15 years 8 months ago
2005
ACM
We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external...
114
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
129
click to vote
ICFEM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...