Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

@inproceedings{Lammich2009PredecessorSO,
  title={Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints},
  author={Peter Lammich and Markus M{\"u}ller-Olm and Alexander Wenner},
  booktitle={CAV},
  year={2009}
}
Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniques for more expressive reachability analysis of DPNs. In the first part of the paper we introduce a new tree-based view on executions. Traditional interleaving semantics model executions by… CONTINUE READING