Pure Pointer Programs with Iteration

DOI10.1007/978-3-540-87531-4_8zbMATH Open1156.68612OpenAlexW1498351939MaRDI QIDQ3540172FDOQ3540172

Authors: Martin Hofmann, Ulrich Schöpp 

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_8

Recommendations

• Pure pointer programs with iteration
• Pure Pointer Programs and Tree Isomorphism
• Computing with a fixed number of pointers (invited talk)
• Hierarchies and space measures for pointer machines
• Towards pointer algebra

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Descriptive complexity and finite models (68Q19)

Cites Work

• On the power of deterministic transitive closures
• Title not available (Why is that?)
• A new approach to abstract syntax with variable binding
• Problems complete for deterministic logarithmic space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Undirected ST-connectivity in log-space
• Space Lower Bounds for Maze Threadability on Restricted Machines
• The Four Colour Theorem: Engineering of a Formal Proof
• Tight Lower Bounds for st-Connectivity on the NNJAG Model
• STACS 2004
• Reachability and the power of local ordering

Cited In (3)

• Pure Pointer Programs and Tree Isomorphism
• Computing with a fixed number of pointers (invited talk)
• Pure pointer programs with iteration

This page was built for publication: Pure Pointer Programs with Iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540172)