700 search results - page 114 / 140 » On Termination of Constraint Logic Programs |
254
click to vote
PLDI
2003
ACM
15 years 11 months ago
2003
ACM
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
208
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
304
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
150
click to vote
LPNMR
2009
Springer
15 years 10 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...
163
click to vote
JFP
2000
15 years 5 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...