Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (original) (raw)
Related papers
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Alexander Wenner, Peter Lammich, Markus Müller-Olm
Lecture Notes in Computer Science, 2009
Reachability Analysis of Multithreaded Software with Asynchronous Communication
Lecture Notes in Computer Science, 2005
Graph models for reachability analysis of concurrent programs
ACM Transactions on Software Engineering and Methodology, 1995
Graph Models for Reachability of Concurrent Programs
Iterable Forward Reachability Analysis of Monitor-DPNs
Electronic Proceedings in Theoretical Computer Science, 2013
Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking
Lecture Notes in Computer Science, 2014
Computing reachable states of parallel programs
Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging - PADD '91, 1991
Reachability for Dynamic Parametric Processes
Lecture Notes in Computer Science, 2017
The complexity of reachability in distributed communicating processes
Acta Informatica, 1988
Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems
Lecture Notes in Computer Science, 2005
Exploiting predicate structure for efficient reachability detection
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering - ASE '05, 2005
Symbolic reachability analysis of higher-order context-free processes
… 2004: Foundations of Software Technology and …, 2005
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
Lecture Notes in Computer Science, 2009
On Verification of Parallel Message-Passing Processes
Formal Aspects of Computing, 2002
Decidability Problems in Petri Nets with Names and Replication
Fundamenta Informaticae
Reachability is decidable for weakly extended process rewrite systems
Information and Computation, 2009
Reducing concurrent analysis under a context bound to sequential analysis
Formal Methods in System Design, 2009
A Reduced Reachability Tree for a Class of Unbounded Petri Nets
2013
Reachability Analysis of Synchronized PA Systems
Electronic Notes in Theoretical Computer Science, 2005
Proceedings of the 42nd annual conference on Design automation - DAC '05, 2005
On persistent reachability in Petri nets
Information and Computation, 2013
Interprocedural Analysis of Concurrent Programs Under a Context Bound
A model for recursive-parallel programs
Electronic Notes in Theoretical Computer Science, 1997
Symbolic context-bounded analysis of multithreaded Java programs
2008
A Formal Framework for the Analysis of Recursive-Parallel Programs
Philippe Schnoebelen, Olga Kouchnarenko
Pact, 1997
On decidability of LTL model checking for process rewrite systems
Jan Strejček, Mojmír Křetínský
Acta Informatica, 2009
On the Algorithmic Properties of Concurrent Programs
1979
Reachability Problem for Weak Multi-Pushdown Automata
Logical Methods in Computer Science, 2013
Compositional reachability analysis using process algebra
Proceedings of the Symposium on Testing Analysis and Verification, 1991