E. Duesterwald and M. So#a. Concurrency analysis in the presence of of procedures using a data-flow framework. In Proc. of the Symposium on Testing, Analysis, and Verification, Victoria, Canada, pages 36--48. ACM Press, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....algorithm computes B4 relationships among pairs of statements based on control flow within individual threads of control and the pattern of post and wait commands in those threads. In the worst case, the complexity of B4 analysis is cubic in the number of program statements. Duesterwald and Soffa [5] proposed an algorithm for solving the B4 problem for Ada programs in the presence of procedures and demonstrated its usefulness for detecting data races in concurrent software. The worst case complexity of this algorithm is also cubic in the number of statements in the program. While computing ....

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the 4th ACM SIGSOFT Workshop on Software Testing, Analysis, and Verification, pages 36--48, Oct. 1991.

....since they give rise to errors which actually cannot occur. In [20] the authors propose symbolic execution to detect infeasible paths. Their approach is based on interleaving the execution of component processes. The interleaving approach, however, is poorly suited for formal verification. In [9, 10] concurrency analysis of programs is studied. The approach allows recursive procedures and dynamically allocated tasks to be present. The presented approach can handle (recursive) procedures but cannot take into account the individual instances of the procedures and tasks, i.e. it is based on ....

E. Duesterwald and M. L. Sofia, Concurrency analysis in the presence of procedures using a data-flow flamework, Proceedings of the 4th Symp. on Testing, Analysis and Verification (TAV4), pp. 36-48.

.... program holds the lock whenever it accesses the corresponding data [94, 28] Other analyses trace the control transfers associated with the use of synchronization constructs such as the post and wait constructs used in parallel dialects of Fortran [71, 18, 36, 17] the Ada rendezvous constructs [95, 99, 33, 70, 35], or the Java wait and notify constructs [73, 74] The goal is to determine that the synchronization actions temporally separate conflicting accesses to shared data. In some cases it may be important to recognize that parallel tasks access disjoint regions of the same data structure. Researchers ....

....remove edges between these regions. The characteristics of the analysis depend on the specific synchronization constructs. Researchers have developed algorithms for programs that use the post and wait constructs used in parallel dialects of Fortran [18, 36, 17] for the Ada rendezvous constructs [95, 33, 70, 35], and for the Java wait and notify constructs [73, 74] The basic idea behind these algorithms is to match each blocking action (such as a wait or accept) with its potential corresponding trigger actions (such as post or notify) from other threads. The analysis uses the information to determine ....

E. Duesterwald and M. Soffa. Concurrency analysis in the presence of procedures using a data-flow analysis framework. In Proceedings of the ACM Symposium on Analysis, Verification, and Testing, Victoria, B.C., Oct. 1991.

....the significant software development cost of building data flow analyzers is a barrier to comparing competing design. Various forms of data flow analysis have been used in program optimization. Software engineering researchers have also used this technique to support software validation [CK93, DS91, FO76, OO92, TO80] Even very different data flow analyzers share a number of common features. As has been found with domain analysis of other software areas, such as database systems, network protocols and data structures [BO92, BST 94] domain analysis of data flow analyzers can identify ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....since they give rise to errors which actually cannot occur. In [20] the authors propose symbolic execution to detect infeasible paths. Their approach is based on interleaving the execution of component processes. The interleaving approach, however, is poorly suited for formal verification. In [9, 10] concurrency analysis of programs is studied. The approach allows recursive procedures and dynamically allocated tasks to be present. The presented approach can handle (recursive) procedures but cannot take into account the individual instances of the procedures and tasks, i.e. it is based on ....

E. Duesterwald and M. L. Soffa, Concurrency analysis in the presence of procedures using a data-flow framework, Proceedings of the 4th Symp. on Testing, Analysis and Verification (TAV4), pp. 36--48.

....claims about the utility of the analysis. Its not clear from this work how useful the analysis is for a broader class of programs as the structure of FORTRAN parallel DO loops may not be indicative of the kinds of control and communication structure that concurrent programs exhibit. Duesterwald [22] extends the work of Callahan to Ada tasking programs and demonstrates the utility of statement ordering information for data race and static deadlock analysis. 27 Masticola [52] describes a technique to efficiently compute a set of potential static deadlock cycles for Ada tasking programs. A ....

....(X) Y : X;Y P(N)g Where the f misc are included to make F closed under composition. Note that, for this problem, N and = An instance of this framework is defined as (G; M) where M(n) f n . For concurrent programs we are also interested in gathering statement precedence information [8, 9, 22, 32, 52]. Unfortunately, using Dom information often yields an overly pessimistic safe approximation. Recall the example concurrent flow graph in Figure 3.1. The statement end is clearly preceded by the statement def 1 , since all program executions that lead to the last statement of the process must pass ....

Duesterwald, E. and Soffa, M.L. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....of those conditions by the program [ABC 91] Unfortunately, in the worst case, the integer programming algorithm for performing this analysis requires exponential time. Data flow analysis techniques are one of the few concurrency analysis approaches that do not have exponential cost [CK93, DS91, DC94, MR91] These techniques formulate a set of conditions, related to the property to be analyzed, as a set of data flow analyses whose solution provides information about the validity or satisfiability of those conditions by the program. Combining a variety of different sub analyses provides ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification, pages 36--48, October 1991.

....primitives impose some constraints on the order in which different statements may execute, static analyses that take these constraints into account can compute more precise results than those don t. The following example (in Ada syntax) illustrates this: task body X is begin [1] V : 0; [2] invoke Y.E; 3] invoke Y.E; 4] Z : V; end X; task body Y is begin [5] accept E; 6] V : 1; 7] accept E; end Y; 1 In an execution of the above example program, statements [2] and [5] will synchronize with each other. Similarly, the execution of statements [3] and [7] will be ....

....than those don t. The following example (in Ada syntax) illustrates this: task body X is begin [1] V : 0; 2] invoke Y.E; 3] invoke Y. E; 4] Z : V; end X; task body Y is begin [5] accept E; 6] V : 1; 7] accept E; end Y; 1 In an execution of the above example program, statements [2] and [5] will synchronize with each other. Similarly, the execution of statements [3] and [7] will be synchronized. Consequently, the execution of statement [1] is constrained to occur before the execution of statement [6] which is constrained to occur before the execution of statement [4] ....

[Article contains additional citation context not shown here]

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, pages 36--48, October 1991.

....of spurious pairs was small compared to the total number of ideal MHP pairs. 1 Introduction Information about which statements in a concurrent program may happen in parallel (MHP) has a number of important applications. It can be used for detecting synchronization anomalies, such as data races [6], for improving the accuracy of various data flow analysis and verification approaches (e.g. 9, 14, 19] for improving program understanding tools, such as debuggers, and for detecting program optimizations. For example, in optimization, if it is known that two threads of control will never ....

....mechanisms have been suggested. Callahan and Subhlok [4] proposed a data flow algorithm that computes, for each statement in a concurrent program with post wait synchronization, the set of statements that must be executed before this statement can be executed (B4 analysis) Duesterwald and Soffa [6] applied this approach to the Ada rendezvous model and extended B4 analysis to be interprocedural. Masticola and Ryder [15] proposed an iterative approach that computes a conservative estimate of the set of pairs of communication statements that can never happen in parallel in a concurrent Ada ....

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, pages 36--48, Oct. 1991.

.... models, which often yield smaller state space representations but are still exponential in the worst case [McM93] While the bulk of flow analysis research has been aimed at sequential software, interesting recent work has applied flow analysis to the evaluation of concurrent software [CKS90, DS91, GS93, Mas93, RS90] Most of this work has been directed at the analysis of a restricted class of behaviors, such as deadlock, and does not require representations of interleavings among the actions in separate tasks. These analyses use flow graph models that are, essentially, a collection of ....

....in separate tasks. These analyses use flow graph models that are, essentially, a collection of task CFGs with additional edges, or labels, to represent inter task synchronization and communication. These include analyses to detect the potential for statements to execute concurrently [CKS90, DS91, MR93, Mer92, NA98, NAC99b] data races [TO80, NM90] reaching definitions [GS93] and dead code [RS90, CK93] Knoop et al. KSV96] have shown that for a class of rapid bit vector problems, a flow graph without explicit interleavings is conservative. For more general analysis, however, ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....be a chain of control edges and or synchronizations from one to the other, if both statements occur. This form of analysis is called B4 analysis, and is closely related to the SCPreserved analysis in loopless programs performed by Callahan and Subhlok [CS88] More recently, Duesterwald and Soffa [DS91], Dues91] formulated a before analysis of Adalike programs; our analysis is similar to theirs in principle, although they use a different graph representation and execution model. Our sync hypergraphs extend their representation by including the accept do construct, selective wait, and ....

....extend their representation by including the accept do construct, selective wait, and conditional entry calls 3 . Though [Dues91] proposes to eliminate spurious sync edges using their ordering relation, they do not mention doing so iteratively, or in combination with other refinements. However, [DS91] represents recursion and process creation, while we require that subroutines be fully inlined and all processes created at the start of the program. While we find little or no use of recursive process creation in practice, we hope to eliminate these restrictions in future research. Lastly, while ....

[Article contains additional citation context not shown here]

Duesterwald, E. and Soffa, M. L. "Concurrency analysis in the presence of procedures using a data-flow framework." ACM Symposium on Testing, Analysis and Verification (TAV4), Vancouver, October 1991, 36-48.

....(X) Y : X;Y P(N)g Where the f misc are included to make F closed under composition. Note that, for this problem, N and = An instance of this framework is defined as (G; M) where M(n) f n . For concurrent programs we are also interested in gathering statement precedence information [CKS90, CK93, DS91, GS93, Mas93]. Unfortunately, using Dom information often yields an overly pessimistic safe approximation. Recall the example concurrent flow graph in Figure 1. The statement end is clearly preceded by the statement def 1 , since all program executions that lead to the last statement of the process must pass ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....must be strong so that the number of spurious analysis results is small. Unfortunately, in the worst case, the algorithm for analyzing these conditions requires exponential time. Data flow analysis techniques are one of the few concurrency analysis approaches that do not have exponential cost [4, 6, 8, 14]. These techniques formulate a set of conditions related to the property to be analyzed as a set of data flow problems whose solution provides information about the validity or satisfiability of those conditions by the program. These conditions must be strong so that the number of spurious ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....these cases, the significant software development cost of building data flow analyzers is a barrier to comparing competing designs. Various forms of data flow analysis have been used in program optimization. Software engineering researchers have used this technique to support software validation [5, 7, 11, 19, 20]. Even very different data flow analyzers share a number of common features. As has been found with domain analysis of other software areas, such as database systems, network protocols and data structures [2, 3] domain analysis of data flow analyzers can identify common reusable software ....

E. Duesterwald and M.L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Symposium on Testing, Analysis and Verification (TAV4), October 1991.

....mechanisms have been proposed. Callahan and Subhlok [4] proposed a data flow algorithm that computes, for each statement in a concurrent program with post wait synchronization, the set of statements that must be executed before this statement can be executed (B4 analysis) Duesterwald and Soffa [5] applied this approach to the Ada rendezvous model and extended B4 analysis to be interprocedural. Masticola and Ryder proposed an iterative approach of non concurrency analysis [12] that computes a conservative estimate of the set of pairs of communication statements that can never happen in ....

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, pages 36--48, Victoria, B.C., October 1991.

No context found.

E. Duesterwald and M. So#a. Concurrency analysis in the presence of of procedures using a data-flow framework. In Proc. of the Symposium on Testing, Analysis, and Verification, Victoria, Canada, pages 36--48. ACM Press, 1991.

No context found.

E. Duesterwald and M. Soa. Concurrency analysis in the presence of of procedures using a data- ow framework. In Proc. of the Symposium on Testing, Analysis, and Veri cation, Victoria, Canada, ACM Press, 1991.

No context found.

E. Duesterwald and M. So#a. Concurrency analysis in the presence of procedures using a data-flow framework. In Proc. Symp. Testing, Analysis and Verification (TAV4), pages 36--48, 1993.

No context found.

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data-flow framework. In TAV 91: Testing, Analysis and Verification, pages 36--48. ACM, 1991.

No context found.

E. Duesterwald and M. So#a. Concurrency analysis in the presence of procedures using a data-flow framework. In Proc. Symp. Testing, Analysis and Verification (TAV4), pages 36--48, 1993.

No context found.

E. Duesterwald and M. So#a. Concurrency analysis in the presence of procedures using a data-flow analysis framework. In Proceedings of the ACM Symposium on Analysis, Verification, and Testing, Victoria, B.C., Oct. 1991.

No context found.

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the 4th ACM SIGSOFT Workshop on Software Testing, Analysis, and Verification, pages 36--48, Oct. 1991.

No context found.

E. Duesterwald and M. So#a. Concurrency analysis in the presence of of procedures using a data-flow framework. In Proc. of the Symposium on Testing, Analysis, and Verification, Victoria, Canada, pages 36--48. ACM Press, 1991.

No context found.

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT '91 Fourth Symposium on Testing, Analysis, and Verification (TAV4), pages 36--48, October 1991.

No context found.

E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data flow framework. In Proceedings of the ACM SIGSOFT Fourth Workshop on Software Testing, Analysis, and Verification, pages 36--48, Victoria, B.C., October 1991.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC