Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
From MaRDI portal
Publication:3636879
DOI10.1007/978-3-642-02658-4_39zbMath1242.68058MaRDI QIDQ3636879
Markus Müller-Olm, Alexander Wenner, Peter Lammich
Publication date: 30 June 2009
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_39
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
Related Items
Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis, Model checking dynamic pushdown networks, Reachability for Dynamic Parametric Processes, Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation, Model Checking Concurrent Programs, Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation, Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Uses Software