Pure Pointer Programs with Iteration

DOI10.1007/978-3-540-87531-4_8zbMath1156.68612OpenAlexW1498351939MaRDI QIDQ3540172

Ulrich Schöpp, Martin Hofmann

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

Mathematics Subject Classification ID

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

Cites Work

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

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