The tree width of auxiliary storage
From MaRDI portal
Publication:5408550
DOI10.1145/1926385.1926419zbMath1284.68358OpenAlexW4214848047MaRDI QIDQ5408550
Gennaro Parlato, P. Madhusudan
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
Trees (05C05) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, Realizability of concurrent recursive programs, Revisiting Underapproximate Reachability for Multipushdown Systems, Descriptional Complexity of Input-Driven Pushdown Automata, Parameterized Verification of Communicating Automata under Context Bounds, On the Complexity of Intersecting Regular, Context-Free, and Tree Languages, The complexity of model checking multi-stack systems, Tinput-Driven Pushdown Automata, Automata and Logics for Concurrent Systems: Five Models in Five Pages, When input-driven pushdown automata meet reversiblity, Unnamed Item, Unnamed Item, Unnamed Item, Temporal logics for concurrent recursive programs: satisfiability and model checking, The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity, Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete, Bounded Context Switching for Valence Systems, Reachability analysis of reversal-bounded automata on series-parallel graphs, On the path-width of integer linear programming, What’s Decidable About Program Verification Modulo Axioms?, Context-Bounded Analysis of TSO Systems, Decidable models of integer-manipulating programs with recursive parallelism, On exteriority notions in book embeddings and treewidth, Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations, Non axiomatisability of positive relation algebras with constants, via graph homomorphisms, Data Multi-Pushdown Automata, Towards an Efficient Tree Automata based technique for Timed Systems, Deterministic input-driven queue automata: finite turns, decidability, and closure properties, Digging input-driven pushdown automata, Unnamed Item
