The Experts below are selected from a list of 324 Experts worldwide ranked by ideXlab platform
Alexander Wenner - One of the best experts on this subject based on the ideXlab platform.
-
join lock sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Verification Model Checking and Abstract Interpretation, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Markus Mullerolm, Helmut Seidl, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
VMCAI - Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Lecture Notes in Computer Science, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Helmut Seidl, Markus Müller-olm, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
CAV - Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Computer Aided Verification, 2009Co-Authors: Peter Lammich, Markus Müller-olm, Alexander WennerAbstract: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 totally ordered sequences. Instead, we model an execution by a partially ordered set of rule applications, that only specifies the per-Process ordering and the causality due to Process Creation, but no ordering between rule applications on Processes that run in parallel. Tree-based executions allow us to compute predecessor sets of regular sets of DPN configurations relative to (tree-) regular constraints on executions. The corresponding problem for interleaved executions is not effective. In the second part of the paper, we extend DPNs with (well-nested) locks. We generalize Kahlon and Gupta's technique of acquisition histories to DPNs, and apply the results of the first part of this paper to compute lock-sensitive predecessor sets.
Peter Lammich - One of the best experts on this subject based on the ideXlab platform.
-
join lock sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Verification Model Checking and Abstract Interpretation, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Markus Mullerolm, Helmut Seidl, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
VMCAI - Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Lecture Notes in Computer Science, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Helmut Seidl, Markus Müller-olm, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
CAV - Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Computer Aided Verification, 2009Co-Authors: Peter Lammich, Markus Müller-olm, Alexander WennerAbstract: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 totally ordered sequences. Instead, we model an execution by a partially ordered set of rule applications, that only specifies the per-Process ordering and the causality due to Process Creation, but no ordering between rule applications on Processes that run in parallel. Tree-based executions allow us to compute predecessor sets of regular sets of DPN configurations relative to (tree-) regular constraints on executions. The corresponding problem for interleaved executions is not effective. In the second part of the paper, we extend DPNs with (well-nested) locks. We generalize Kahlon and Gupta's technique of acquisition histories to DPNs, and apply the results of the first part of this paper to compute lock-sensitive predecessor sets.
Thomas Martin Gawlitza - One of the best experts on this subject based on the ideXlab platform.
-
join lock sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Verification Model Checking and Abstract Interpretation, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Markus Mullerolm, Helmut Seidl, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
VMCAI - Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Lecture Notes in Computer Science, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Helmut Seidl, Markus Müller-olm, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
Javier Esparza - One of the best experts on this subject based on the ideXlab platform.
-
VMCAI - Analysis of systems with stochastic Process Creation
Lecture Notes in Computer Science, 2010Co-Authors: Javier EsparzaAbstract:In many computer science systems entities can “reproduce”, “replicate”, or “create new instances”. Paramount examples are threads in multithreaded programs, Processes in operating systems, and computer viruses, but many others exist: procedure calls create new incarnations of the callees, web crawlers discover new pages to be explored (and so “create” new tasks), divide-and-conquer procedures split a problem into subproblems, and leaves of tree-based data structures become internal nodes with children. I use the generic term systems with Process Creation to refer to all these entities.
-
MFCS - Stochastic Process Creation
Mathematical Foundations of Computer Science 2009, 2009Co-Authors: Javier EsparzaAbstract:In many areas of computer science entities can "reproduce", "replicate", or "create new instances". Paramount examples are threads in multithreaded programs, Processes in operating systems, and computer viruses, but many others exist: procedure calls create new incarnations of the callees, web crawlers discover new pages to be explored (and so "create" new tasks), divide-and-conquer procedures split a problem into subproblems, and leaves of tree-based data structures become internal nodes with children. For lack of a better name, I use the generic term systems with Process Creation to refer to all these entities.
Helmut Seidl - One of the best experts on this subject based on the ideXlab platform.
-
join lock sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Verification Model Checking and Abstract Interpretation, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Markus Mullerolm, Helmut Seidl, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
-
VMCAI - Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic Process Creation
Lecture Notes in Computer Science, 2011Co-Authors: Thomas Martin Gawlitza, Peter Lammich, Helmut Seidl, Markus Müller-olm, Alexander WennerAbstract:Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and dynamic Process Creation. Constraints on the sequences of spawned Processes allow to extend the basic model with joining of created Processes [2]. Orthogonally DPNs can be extended with nested locking [9]. Reachability of a regular set R of configurations in presence of stable constraints as well as reachability without constraints but with nested locking are based on computing the set of predecessors pre* (R). In the present paper, we present a forward-propagating algorithm for deciding reachability for DPNs. We represent sets of executions by sets of execution trees and show that the set of all execution trees resulting in configurations from R which either allow a lock-sensitive execution or a join-sensitive execution, is regular. Here, we rely on basic results about macro tree transducers. As a second contribution, we show that reachability is decidable also for DPNs with both nested locking and joins.
