107 search results - page 10 / 22 » Improving Abstract Interpretations by Combining Domains |
104
click to vote
CAV
2010
Springer
15 years 5 months ago
2010
Springer
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
82
Voted
AGP
1999
IEEE
15 years 6 months ago
1999
IEEE
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
228
Voted
POPL
2008
ACM
16 years 2 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
124
Voted
SARA
2009
Springer
15 years 8 months ago
2009
Springer
We present algorithms for testing the satisfiability and finding the tightened transitive closure of conjunctions of addition constraints of the form ±x ± y ≤ d and bound co...
107
Voted
PPDP
2000
Springer
15 years 5 months ago
2000
Springer
an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of tech...