30 search results - page 1 / 6 » Pure Pointer Programs with Iteration |
CSL
2008
Springer
13 years 6 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
CADE
2003
Springer
14 years 4 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
SAS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
ISCA
1999
IEEE
13 years 8 months ago
1999
IEEE
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...