Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
From MaRDI portal
Publication:3646258
DOI10.1007/978-3-642-04420-5_13zbMath1260.68105OpenAlexW2134126189MaRDI QIDQ3646258
Publication date: 19 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04420-5_13
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- XML schema, tree logic and sheaves automata
- Semigroups, Presburger formulas, and languages
- On the analysis of interacting pushdown systems
- Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
- Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
- Regular canonical systems
- Automated Deduction – CADE-20
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order