Results 1 
8 of
8
Regular Symbolic Analysis of Dynamic Networks of Pushdown Processes
, 2005
"... 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 us ..."
Abstract

Cited by 58 (20 self)
 Add to MetaCart
(Show Context)
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 finitestate 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. 1
Model checking multithreaded programs with asynchronous atomic methods
 In CAV 06, LNCS 4314
, 2006
"... ..."
(Show Context)
Formalization of conflict analysis of programs with procedures, thread creation, and monitors
 THE ARCHIVE OF FORMAL PROOFS. HTTP://AFP.SF.NET/ENTRIES/DISKPAXOS.SHTML
, 2007
"... We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NPcomplete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpointbase ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NPcomplete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpointbased complete conflict detection algorithm. Our algorithm needs worstcase exponential time in the number of monitors, but is linear in the program size.
Computing Interprocedurally Valid Relations in Affine Programs
"... We consider an abstraction of programs which preserves affine assignments exactly while conservatively dealing with other assignments and ignoring conditions at branches. We present an interprocedural analysis of such abstracted programs which for every program point v determines the set of all affi ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider an abstraction of programs which preserves affine assignments exactly while conservatively dealing with other assignments and ignoring conditions at branches. We present an interprocedural analysis of such abstracted programs which for every program point v determines the set of all affine relations between program variables which are valid when reaching v. The runtime of this algorithm is linear in the program size and polynomial in the number of occurring variables. We extend this result to a polynomialtime algorithm which determines for every program point the set of all valid polynomial relations between program variables of bounded degree.
Precise fixpointbased analysis of programs with threadcreation
 IN PROC. OF CONCUR 2007
, 2007
"... We present a fixpointbased algorithm for contextsensitive interprocedural kill/genanalysis of programs with thread creation. Our algorithm is precise up to abstraction of synchronization common in this line of research; it can handle forward as well as backward problems. We exploit a structural p ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
We present a fixpointbased algorithm for contextsensitive interprocedural kill/genanalysis of programs with thread creation. Our algorithm is precise up to abstraction of synchronization common in this line of research; it can handle forward as well as backward problems. We exploit a structural property of kill/genproblems that allows us to analyze the influence of environment actions independently from the local transfer of data flow information. While this idea has been used for programs with parbegin/parend blocks before in work of Knoop/Steffen/Vollmer and Seidl/Steffen, considerable refinement and modification is needed to extend it to thread creation, in particular for backward problems. Our algorithm computes annotations for all program points in time depending linearly on the program size, thus being faster than a recently proposed automata based algorithm by Bouajjani et. al..
Tree Automata for Analyzing Dynamic Pushdown Networks
"... Dynamic Pushdown Networks (DPNs) are an abstract model for concurrent programs with recursive procedures and dynamic process creation. Usually, DPNs are described with an interleaving semantics, where an execution is a sequence of steps. Recently, we introduced a trueconcurrency semantics for DPN ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Dynamic Pushdown Networks (DPNs) are an abstract model for concurrent programs with recursive procedures and dynamic process creation. Usually, DPNs are described with an interleaving semantics, where an execution is a sequence of steps. Recently, we introduced a trueconcurrency semantics for DPNs, where executions are trees. The standard analysis methods for DPNs are based on a saturation algorithm, that, given a set of configurations, computes the set of all predecessor configurations. In this paper we present an alternative analysis algorithm that is based on tree automata. DPN executions as well as the properties to be analyzed are represented as tree automata, and the analysis is done by standard treeautomata algorithms for intersection and emptiness check.
Precise fixed point based analysis of programs with threadcreation
 FACULTY OF INFORMATION TECHNOLOGY, BRNO UNIVERSITY OF TECHNOLOGY
, 2006
"... This paper presents an efficient, fixed point based algorithm for precise kill/gen analysis of interprocedural flow graphs with thread creation. The main idea of the algorithm is to separate a path reaching a control node into those steps required to reach the node and interfering steps, that are e ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
This paper presents an efficient, fixed point based algorithm for precise kill/gen analysis of interprocedural flow graphs with thread creation. The main idea of the algorithm is to separate a path reaching a control node into those steps required to reach the node and interfering steps, that are executed concurrently. These two parts are analyzed separately and combined afterwards. Exploiting the structure of kill/gen analysis we can show soundness and precision.
Precise data race detection of programs with procedures, threads
"... and monitors ..."
(Show Context)