Reachability Analysis of Asynchronous Dynamic Pushdown Networks Based on Tree Semantics Approach

Guodong Wu, Junyan Qian


ADPN (Asynchronous Dynamic Pushdown Networks) are an abstract model for concurrent programs with recursive procedures and dynamic thread creation. Usually, asynchronous dynamic pushdown networks are described with interleaving semantics, in which the backward analysis is not effective. In order to improve interleaving semantics, tree semantics approach was introduced. This paper extends the tree semantics to ADPN. Because the reachability problem of ADPN is also undecidable, we address the context-bounded reachability problem and provide an algorithm for backward reachability analysis with tree-based semantics Approach.

Full Text:




  • There are currently no refbacks.

Copyright (c) 2017 Guodong Wu, Junyan Qian

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Copyright © SCHOLINK INC.  ISSN 2375-9747 (Print)  ISSN 2332-5534 (Online)