322 search results - page 40 / 65 » Combinations of Abstract Domains for Logic Programming |
143
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
179
Voted
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
175
click to vote
ICFP
2012
ACM
13 years 6 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
124
click to vote
IRFC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Information Retrieval (IR) systems combine a variety of techniques stemming from logical, vector-space and probabilistic models. This variety of combinations has produced...
128
click to vote
CC
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...