Sciweavers

Share
34 search results - page 1 / 7
» Pure Pointer Programs with Iteration
Sort
View
CSL
2008
Springer
9 years 11 months ago
Pure Pointer Programs with Iteration
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...
Martin Hofmann, Ulrich Schöpp
LICS
2009
IEEE
10 years 4 months ago
Pointer Programs and Undirected Reachability
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...
Martin Hofmann, Ulrich Schöpp
CADE
2003
Springer
10 years 10 months ago
Proving Pointer Programs in Higher-Order Logic
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...
Farhad Mehta, Tobias Nipkow
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
10 years 3 months ago
A Scalable Nonuniform Pointer Analysis for Embedded Programs
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively deļ¬ned data structures and e...
Arnaud Venet
ISCA
1999
IEEE
90views Hardware» more  ISCA 1999»
10 years 2 months ago
Effective Jump-Pointer Prefetching for Linked Data Structures
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...
Amir Roth, Gurindar S. Sohi
books