Regular symbolic analysis of dynamic networks of pushdown systems

Authors:
Ahmed Bouajjani;Markus Müller-Olm;Tayssir Touili
Affiliations:
LIAFA, University of Paris, Paris cedex 5, France;Universität Dortmund, Dortmund, Germany;LIAFA, University of Paris, Paris cedex 5, France
Venue:
CONCUR 2005 - Concurrency Theory
Year:
2005

Citing 10
Cited 42

Process algebra

Process algebra
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Constraint-Based Inter-Procedural Analysis of Parallel Programs

ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Precise interprocedural dependence analysis of parallel programs

Theoretical Computer Science
Context-Bounded model checking of concurrent software

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On computing reachability sets of process rewrite systems

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

On the analysis of interacting pushdown systems

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of well-formed communicating recursive state machines

Theoretical Computer Science
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors

SAS '08 Proceedings of the 15th international symposium on Static Analysis
Symbolic Context-Bounded Analysis of Multithreaded Java Programs

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
On Bifix Systems and Generalizations

Language and Automata Theory and Applications
On the Reachability Analysis of Acyclic Networks of Pushdown Systems

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism

Electronic Notes in Theoretical Computer Science (ENTCS)
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A Decision Procedure for Detecting Atomicity Violations for Communicating Processes with Locks

Proceedings of the 16th International SPIN Workshop on Model Checking Software
Program Analysis through Finite Tree Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Verifying Parallel Programs with Dynamic Communication Structures

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Constrained Reachability of Process Rewrite Systems

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
A generic framework for reasoning about dynamic networks of infinite-state processes

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Interprocedural analysis of concurrent programs under a context bound

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Verifying parallel programs with dynamic communication structures

Theoretical Computer Science
From multi to single stack automata

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complexity of pattern-based verification for multithreaded programs

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Normalization of linear horn clauses

SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Regularity and context-freeness over word rewriting systems

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On probabilistic parallel programs with process creation and synchronisation

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Refining the process rewrite systems hierarchy via ground tree rewrite systems

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Analysis of recursively parallel programs

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computing transitive closures of hedge transformations

International Journal of Critical Computer-Based Systems
From logic to games

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Reachability analysis of multithreaded software with asynchronous communication

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Model checking multithreaded programs with asynchronous atomic methods

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Dynamic cutoff detection in parameterized concurrent programs

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Verification of well-formed communicating recursive state machines

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Rewriting models of boolean programs

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Weighted dynamic pushdown networks

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Reachability analysis of communicating pushdown systems

FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Synchronisation- and reversal-bounded analysis of multithreaded programs with counters

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Weakly-Synchronized ground tree rewriting

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Precise fixpoint-based analysis of programs with thread-creation and procedures

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Reachability problem for weak multi-pushdown automata

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Linear-Time model-checking for multithreaded programs under scope-bounding

ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Efficient may happen in parallel analysis for async-finish parallelism

SAS'12 Proceedings of the 19th international conference on Static Analysis
Analysis of Recursively Parallel Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Safety verification of asynchronous pushdown systems with shaped stacks

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce two abstract models for multithreaded programs based on dynamic networks of pushdown systems. We address the problem of symbolic reachability analysis for these models. More precisely, we consider the problem of computing effective representations of their reachability sets using finite-state automata. We show that, while forward reachability sets are not regular in general, backward reachability sets starting from regular sets of configurations are always regular. We provide algorithms for computing backward reachability sets using word/tree automata, and show how these algorithms can be applied for flow analysis of multithreaded programs.