54 search results - page 5 / 11 » Non-termination Inference for Constraint Logic Programs |
SAS
2004
Springer
15 years 2 months ago
2004
Springer
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
CLEF
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
113
click to vote
COMMA
2010
14 years 4 months ago
2010
Abstract. Constrained argumentation frameworks (CAF) generalize Dung's frameworks by allowing additional constraints on arguments to be taken into account in the definition of...
PLDI
2003
ACM
15 years 2 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....
174
click to vote
POPL
2007
ACM
15 years 10 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...