Introduction to algorithms
Process algebra
Concurrency analysis in the presence of procedures using a data-flow framework
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-sensitive synchronization-sensitive analysis is undecidable
ACM Transactions on Programming Languages and Systems (TOPLAS)
The regular viewpoint on PA-processes
Theoretical Computer Science
A generic approach to the static analysis of concurrent programs with procedures
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parameterized Verification of Multithreaded Software Libraries
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards the Automated Verification of Multithreaded Java Programs
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Efficient Algorithms for Model Checking Pushdown Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Constraint-based inter-procedural analysis of parallel programs
Nordic Journal of Computing
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Parikh's Theorem in Commutative Kleene Algebra
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
On computing reachability sets of process rewrite systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Verification of Boolean programs with unbounded thread creation
Theoretical Computer Science
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
Electronic Notes in Theoretical Computer Science (ENTCS)
Constrained Reachability of Process Rewrite Systems
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Approximation-based tree regular model-checking
Nordic Journal of Computing
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
Rewriting models of boolean programs
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Name Creation vs. Replication in Petri Net Systems
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
We present a generic approach for the analysis of concurrent programs with (unbounded) dynamic creation of threads and recursive procedure calls. We define a model for such programs based on a set of term rewrite rules where terms represent control configurations. The reachability problem for this model is undecidable. Therefore, we propose a method for analyzing such models based on computing abstractions of their sets of computation paths. Our approach allows to compute such abstractions as least solutions of a system of (path language) constraints. More precisely, given a program and two regular sets of configurations (process terms) T and T^', we provide (1) a construction of a system of constraints which characterizes the set of computation paths leading from T to T^', and (2) a generic framework, based on abstract interpretation, allowing to solve this system in various abstract domains leading to abstract analysis with different precision and cost.