The tree width of auxiliary storage
DOI10.1145/1926385.1926419zbMATH Open1284.68358OpenAlexW4214848047MaRDI QIDQ5408550FDOQ5408550
Authors: Parthasarathy Madhusudan, Gennaro Parlato 
Publication date: 10 April 2014
Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/272444/1/graphautomata.pdf
Recommendations
Formal languages and automata (68Q45) Trees (05C05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (32)
- When input-driven pushdown automata meet reversiblity
- Digging input-driven pushdown automata
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Title not available (Why is that?)
- On the complexity of intersecting regular, context-free, and tree languages
- Analyzing timed systems using tree automata
- Revisiting underapproximate reachability for multipushdown systems
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Automata and Logics for Concurrent Systems: Five Models in Five Pages
- Parameterized Verification of Communicating Automata under Context Bounds
- Temporal logics for concurrent recursive programs: satisfiability and model checking
- Decidable models of integer-manipulating programs with recursive parallelism
- Emptiness problems for distributed automata
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
- Descriptional complexity of input-driven pushdown automata
- Emptiness of ordered multi-pushdown automata is 2ETIME-complete
- Reasoning About Data Trees Using CHCs
- The complexity of model checking multi-stack systems
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- On exteriority notions in book embeddings and treewidth
- Data multi-pushdown automata
- Ramsey-based inclusion checking for visibly pushdown automata
- Tinput-Driven Pushdown Automata
- Realizability of concurrent recursive programs
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
- Towards an Efficient Tree Automata based technique for Timed Systems
- On the path-width of integer linear programming
- Reachability of multistack pushdown systems with scope-bounded matching relations
- Context-bounded analysis of TSO systems
- What's decidable about program verification modulo axioms?
- Bounded context switching for valence systems
This page was built for publication: The tree width of auxiliary storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408550)
