The tree width of auxiliary storage

DOI10.1145/1926385.1926419MaRDI QIDQ5408550zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

model checkingautomatadecision proceduresbounded tree-width

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Trees (05C05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Deciding emptiness for stack automata on infinite trees
• Emptiness problems for distributed automata
• Distributed graph automata
• Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
• Emptiness problems for distributed automata

Cited in

(32)

• Context-bounded analysis of TSO systems
• What's decidable about program verification modulo axioms?
• Bounded context switching for valence systems
• When input-driven pushdown automata meet reversiblity
• Reachability analysis of reversal-bounded automata on series-parallel graphs
• Digging input-driven pushdown automata
• scientific article; zbMATH DE number 7471708 (Why is no real title available?)
• On the complexity of intersecting regular, context-free, and tree languages
• Analyzing timed systems using tree automata
• A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
• Revisiting underapproximate reachability for multipushdown systems
• 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
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• Emptiness problems for distributed automata
• 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
• On exteriority notions in book embeddings and treewidth
• Reachability analysis of reversal-bounded automata on series-parallel graphs
• Data multi-pushdown automata
• Ramsey-based inclusion checking for visibly pushdown automata
• Realizability of concurrent recursive programs
• Tinput-Driven Pushdown Automata
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• On the path-width of integer linear programming
• Towards an Efficient Tree Automata based technique for Timed Systems
• Reachability of multistack pushdown systems with scope-bounded matching relations

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)