2451 search results - page 119 / 491 » The Octagon Abstract Domain |
173
click to vote
CAV
2010
Springer
15 years 10 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...
161
click to vote
FLAIRS
2003
15 years 8 months ago
2003
In our previous research, we investigated the properties of case-based plan recognition with incomplete plan libraries. Incremental construction of plan libraries along with retri...
306
click to vote
POPL
2008
ACM
16 years 7 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...
190
click to vote
ICPP
1993
IEEE
15 years 11 months ago
1993
IEEE
Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les ....
170
click to vote
APLAS
2001
ACM
15 years 10 months ago
2001
ACM
The garbage collection is a safe and efficient method for managing the heap. However it is not efficient for temporary storages that are allocated often and deallocated quickly. R...