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