5 search results - page 1 / 1 » An Incremental Heap Canonicalization Algorithm |
63
Voted
SPIN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...
92
Voted
PLDI
2006
ACM
15 years 3 months ago
2006
ACM
The widely used Mark-and-Sweep garbage collector has a drawback in that it does not move objects during collection. As a result, large long-running realistic applications, such as...
151
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
ALGORITHMICA
2010
14 years 9 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
172
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...