CSL 2008: Computer Science Logic pp 79-93

# Pure Pointer Programs with Iteration

• Martin Hofmann
• Ulrich Schöpp
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5213)

## Abstract

Many logspace algorithms are naturally described as programs that operate on a structured input (e.g. a graph), that store in memory only a constant number of pointers (e.g. to graph nodes) and that do 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 formal class purple of pure pointer programs and study them on locally ordered graphs. Existing classes of pointer algorithms, such as Jumping Automata on Graphs (jags) or Deterministic Transitive Closure (dtc) logic, often exclude simple programs. purple subsumes these classes and allows for a natural representation of many graph algorithms that access the input graph by a constant number of pure pointers. It does so by providing a primitive for iterating an algorithm over all nodes of the input graph in an unspecified order.

Since pointers are given as an abstract data type rather than as binary digits we expect that logarithmic-size worktapes cannot be encoded using pointers as is done, e.g. in totally-ordered dtc logic. We show that this is indeed the case by proving that the property “the number of nodes is a power of two,” which is in logspace, is not representable in purple.

## Preview

### References

1. 1.
Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms 8(3), 385–394 (1987)
2. 2.
Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM Journal of Computing 9(3), 636–652 (1980)
3. 3.
Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)
4. 4.
Edmonds, J., Poon, C.K., Achlioptas, D.: Tight lower bounds for st-connectivity on the NNJAG model. SIAM Journal of Computing 28(6), 2257–2284 (1999)
5. 5.
Etessami, K., Immerman, N.: Reachability and the power of local ordering. Theoretical Computer Science 148(2), 261–279 (1995)
6. 6.
Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341–363 (2002)
7. 7.
Gonthier, G.: A computer-checked proof of the four-colour theorem, http://research.microsoft.com/~gonthier
8. 8.
Grädel, E., McColm, G.L.: On the power of deterministic transitive closures. Information and Computation 119(1), 129–135 (1995)
9. 9.
Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)
10. 10.
Johannsen, J.: Satisfiability problems complete for deterministic logarithmic space. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 317–325. Springer, Heidelberg (2004)Google Scholar
11. 11.
Neven, F., Schwentick, T.: On the power of tree-walking automata. In: Welzl, E., Montanari, U., Rolim, J. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 547–560. Springer, Heidelberg (2000)
12. 12.
Pitts, A.M., Stark, I.D.B.: Observable properties of higher order functions that dynamically create local names, or: What’s new? In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 122–141. Springer, Heidelberg (1993)Google Scholar
13. 13.
Reingold, O.: Undirected st-connectivity in log-space. In: STOC, pp. 376–385 (2005)Google Scholar