Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

DOI10.1007/978-3-642-02658-4_39zbMath1242.68058OpenAlexW1551108348MaRDI 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

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (7)

Model Checking Concurrent Programs ⋮ Verification of Higher-Order Concurrent Programs with Dynamic Resource Creation ⋮ Reachability for Dynamic Parametric Processes ⋮ Using Dynamic Pushdown Networks to Automate a Modular Information-Flow Analysis ⋮ Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation ⋮ Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order ⋮ Model checking dynamic pushdown networks

Uses Software

• Isabelle/HOL

This page was built for publication: Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints