D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the ACM Symposium on Analysis, Verification, and Testing, Victoria, B.C., Oct. 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....model checking algorithms to analyze this abstract model, and then (3) mapping abstract counter examples back to the code. The investigation of this approach can be traced back to early attempts to analyze concurrent programs written in concurrent programming languages such as Ada (e.g. [30, 26, 27, 9]) Other relevant work includes static analyses geared towards analyzing communication patterns in concurrent programs (e.g. 8, 11, 31] Recently, several efforts have started aiming at providing model checking tools based on source code abstraction for mainstream popular programming languages ....

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, Oct. 1991.

....if each philosopher holds exactly one fork and tries to pick up the second one, which is held by its neighbor. Thus our framework obtains the correct answer to the problem. 4 Related Work A large number of papers deals with detecting tasking anomalies in multi tasking (Ada) programs, e.g. [5, 7 11, 13, 18 20]. SSA form for explicitly parallel programs is treated theoretically in [18] Explicitly parallel programs are restricted to a (cobegin . coend) like structure and are in strict contrast to the tasking in Ada. The semantic chosen for global variables is far too weak to model Ada programs with ....

....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 the source code of the tasks and procedures and not on their runtime equivalent. In [13 15] static detection of infinite wait anomalies is studied. Clas sic data flow analysis is employed to solve this problem. This allows polynomial time analysis but cannot solve dead paths problems. In addition, Ada s generic units cannot be modelled adequately. In [8] symbolic execution of Ada ....

D. Long and L. A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the ACM Symp. on Testing, Analysis, and Verification, pp. 21-35.

....apply to scalars only or to arrays considered as one single variable (exceptions include [3, 11, 21] 2. Does the paper consider both the weak and the strong model of memory consistency Most papers apply to only one of them (e.g. 12] 3. Does the paper allow shared variables (e.g. 10] and [15] don t) 4. Are event based and mutual exclusion synchronizations allowed 5. Are indexed parallel constructs (parallel loops) and parallel sections allowed Except for [3] related papers apply to parallel sections only. This paper answers Yes to all of these questions, and includes the ....

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronizations. In Proc.ACM SIGSOFT Symp. on Testing, Analysis and Verif. (TAV'91), volume 16 of Software Engineering Notes, pages 21--35, 1991.

....solution for most programs will involve an augmented type system that eliminates the possibility of data races at the language level. 2. 3 Deadlock Detection Researchers have developed a variety of analyses for detecting potential deadlocks in Ada programs which use rendezvous synchronization [95, 99, 69, 29, 66, 34, 24, 16, 12]. A rendezvous takes place between a call statement in one thread and an accept statement in another. The analyses match corresponding calls and accepts to determine if every call will eventually participate in a rendezvous. If not, the program is considered to deadlock. We note that deadlock ....

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the ACM Symposium on Analysis, Verification, and Testing, Victoria, B.C., Oct. 1991.

....(e.g. CC77, MJ81, ASU86] automatically extract information about the dynamic behavior of a sequential program by examining its text. Variants of these techniques have also been proposed for the analysis of programs written in concurrent programming languages such as Ada (e.g. Tay83, LC91, MR93, Cor96] For specific classes of concurrent programs, these abstraction techniques can produce a conservative model of the system that preserves basic information about the communication patterns that can take place in the system. Analyzing such a model using standard model checking ....

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, October 1991.

....if each philosopher holds exactly one fork and tries to pick up the second one, which is held by its neighbor. Thus our framework obtains the correct answer to the problem. 4 Related Work A large number of papers deals with detecting tasking anomalies in multi tasking (Ada) programs, e.g. [5, 7 11, 13, 18 20]. SSA form for explicitly parallel programs is treated theoretically in [18] Explicitly parallel programs are restricted to a (cobegin : coend) like structure and are in strict contrast to the tasking in Ada. The semantic chosen for global variables is far too weak to model Ada programs with ....

....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 the source code of the tasks and procedures and not on their runtime equivalent. In [13 15] static detection of infinite wait anomalies is studied. Classic data flow analysis is employed to solve this problem. This allows polynomial time analysis but cannot solve dead paths problems. In addition, Ada s generic units cannot be modelled adequately. In [8] symbolic execution of Ada ....

D. Long and L. A. Clarke, Data flow analysis of concurrent systems that use the rendezvous model of synchronization, Proceedings of the ACM Symp. on Testing, Analysis, and Verification, pp. 21--35.

....[CC77, MJ81, ASU86] automatically extract information about the dynamic behavior of a sequential program by examining its text. Variants of these techniques have also been proposed for the analysis of concurrent programs written in concurrent programming languages such as Ada (e.g. Tay83, LC91, MR93, Cor96] For specific classes of concurrent programs, these abstraction techniques can produce a conservative model of the system that preserves basic information about the communication patterns that can take place in the system. Analyzing such a model using standard model checking ....

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, October 1991.

....(e.g. CC77, MJ81, ASU86] automatically extract information about the dynamic behavior of a sequential program by examining its text. Variants of these techniques have also been proposed for the analysis of programs written in concurrent programming languages such as Ada (e.g. Tay83, LC91, MR93, Cor96] For specific classes of concurrent programs, these abstraction techniques can produce a conservative model of the system that preserves basic information about the communication patterns that can take place in the system. Analyzing such a model using standard model checking ....

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, October 1991.

....program analysis. This work continues the line of research set forth in [God97] A complementary approach to analyzing such systems is to use static analysis, such as abstract interpretation [CC77] Most work has involved analyzing the communication patterns that occur in a system [Tay83, LC91, MR93, Col95, Cri95, Ven97] A model checker could analyze the results of such static analyses in order to prove the absence of certain specific types of errors. In contrast, our approach is based on dynamic observation of a system. This opens up the possibility of detecting a wider range of ....

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, October 1991.

....If CHT(n) NCHT , then we know that n cannot execute. This may indicate either an infinite wait anomaly involving the control ancestors of n, or the situation that n is unreachable in control flow. The second additional use of CHT is in data flow analysis involving communications between tasks [LC91]. For example, consider reaching definitions analysis. If two tasks do not share memory, then definitions can propagate directly between them only through the parameters of a rendezvous. The rendezvous cannot occur if the corresponding signaling and accept in nodes can t happen together. If we ....

Long, D. L. and Clarke, L. A. "Data flow analysis of concurrent systems that use the rendezvous model of synchronization." In Proceedings of the Symposium on Testing, Analysis, and Verification (TAV4), October 1991, 21-35.

....a given graph, usually the number of edges is greater than that of the nodes. Then, the running time is equal to O(2 k jEj) Q.E.D. 7 Other Parallel Paradigms 7. 1 Rendezvous communication Among other researchers, Long and Clarke developed a data flow analysis technique for concurrent programs[9]. After their data flow analysis is performed, we can apply a modified version of our algorithm to find all du path coverage for a concurrent program with rendezvous communication. In particular, we need to modify the following: 1) construction of the PPFG, 2) definition of path acceptability, ....

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. Technical Report COINS 91-31, University of Massachusetts, Dept of Computer Science, July 1991.

....tool, i.e. to translate the program source code into an analysis formalism by using some abstraction technique. Translation from Ada to Petri nets was described in several papers among which [9] The Task Interaction Graph (TIG) model of Ada tasking programs was introduced by Long and Clarke in [7]. A practical application of this model was the Concurrency Analysis Tool Suite for Ada Programs (CATS) described in [10] that uses a compiler front end to generate the representation of Ada tasks according to the TIG model and performs temporal logic model checking on such representation. To ....

Douglas Long and Lori A. Clarke, "Data flow analysis of concurrent systems that use the rendezvous model for synchronization", Proceedings of the Symposium on Software Testing, Analysis and Verification, (October 1991).

....in parallel programs with user specified parallelism. Indeed, traditional data flow analysis for optimization has been shown to fail to ensure transformation correctness when applied to shared memory parallel programs [41] Previous investigations into data flow analysis of parallel programs[26, 39], transformation of a parallel program into SSA form[51] and data dependence tests for guaranteeing the legality of parallelizing transformations[41, 42] all focused on shared memory parallel programs with lexically specified parallel constructs, such as cobegin coend or parallel sections. These ....

....Assignment (SSA) form[51] A data flow framework is presented for computing reaching definitions for this style of parallel program[26] Chow and Harrison [10] presented a data flow framework for analyzing parallel programs with cobegin parallelism without explicit synchronization. Long and Clarke [39] developed a data flow framework for Ada programs with task parallelism and rendezvous synchronization, but they do not handle shared variables. Distributed shared memory (DSM) systems present programmers with a shared memory abstraction atop a disjoint memory machine. DSM can be implemented in ....

Douglas Long and Lori Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. Technical Report COINS 91-31, University of Massachusetts, July 1991.

....Summary of static analysis methods. 374 10.7. Static intertask data flow analysis. 375 Concise overview. 377 10.7.1. Classic iterative analysis: Long and Clarke [LC91] 377 10.7.2. Abstract interpretation: Reif and Smolka [RS90] 379 10.7.3. Data dependency graph construction: Moser [Mos90] 380 10.7.4. Task dependence nets: Cheng [Che92] 381 10.8. Dynamic deadlock detection. ....

....If CHT(n) N , then we know that n cannot execute. This may indicate either an infinite wait anomaly involving the control ancestors of n, or the situation that n is unreachable in control flow. The second additional use of CHT is in data flow analysis involving communications between tasks [LC91] For example, consider reaching definitions analysis. If two tasks do not share memory, then definitions can propagate directly between them only through the parameters of a rendezvous. The rendezvous cannot occur if the corresponding signaling and accept in nodes can t happen together. If we ....

[Article contains additional citation context not shown here]

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the ACM SIGSOFT '91 Fourth Symposium on Testing, Analysis, and Verification (TAV4), pages 21--35, Vancouver, BC, October 1991.

....parallel constructs, and introduce new intermediate forms, called the Parallel Control Flow Graph, and the Parallel Precedence Graph. Chow and Harrison[4] present a data flow framework for analyzing parallel programs with cobegin coend parallelism without explicit synchronization. Long and Clarke[17] develop a data flow framework for Ada programs with task parallelism and rendezvous synchronization, but they do not handle shared variables. Dwyer and Clarke[7] present an approach based on data flow analysis for verifying properties of Ada like concurrent programs. A specific type of regular ....

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. Technical Report COINS 91-31, University of Massachusetts, Department of Computer Science, July 1991.

....apply to scalars only or to arrays considered as one single variable (exceptions include [3, 11, 21] 2. Does the paper consider both the weak and the strong model of memory consistency Most papers apply to only one of them (e.g. 12] 3. Does the paper allow shared variables (e.g. 10] and [15] don t) 4. Are event based and mutual exclusion synchronizations allowed 5. Are indexed parallel constructs (parallel loops) and parallel sections allowed Except for [3] related papers apply to parallel sections only. This paper answers Yes to all of these questions, and includes the following ....

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronizations. In Proc.ACM SIGSOFT Symp. on Testing, Analysis and Verif. (TAV'91), volume 16 of Software Engineering Notes, pages 21--35, 1991.

No context found.

D. Long and L. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the ACM Symposium on Analysis, Verification, and Testing, Victoria, B.C., Oct. 1991.

No context found.

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of ACM Symposium on Testing, Analysis, and verification (TAV4), pages 21--35, Vancouver, October 1991.

No context found.

D. L. Long and L. A. Clarke. Data flow analysis of concurrent systems that use the rendezvous model of synchronization. In Proceedings of the ACM SIGSOFT '91 Fourth Symposium on Testing, Analysis, and Verification (TAV4), pages 21--35, Vancouver, BC, October 1991.

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