G.-C. Roman and H. C. Cunningham. The synchronic group: A concurrent programming concept and its proof logic. In Proceedings of the 10th International Conference on Distributed Computing Systems. IEEE, May 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... of the shared dataspace approach and the Swarm model for algorithm development and programming methodology [21] To facilitate formal verification of Swarm programs, we have developed an assertional programming logic and are devising proof techniques appropriate for the dynamic structure of Swarm [7, 22]. In a related e#ort, we are investigating the use of the shared dataspace model as a basis for a new approach to the visualization of the dynamics of program execution [18, 19] In this paper, we specify a proof system for Swarm similar in style to that of UNITY and illustrate its use by proving ....

....show that it meets the correctness criteria. By dynamic, we mean that the contents of the transaction space vary during the computation. An alternative solution with a static transaction space is studied in [7] and [8] A program for an image which is growing on one side is studied in [7] and [22]. The program RegionLabel (shown in Figure 4) initially associates a transaction instance with each pixel in the image. When an executing transaction detects that the pixel s label may need to be propagated to a neighbor, it inserts transactions to carry the label to that neighbor. When the ....

[Article contains additional citation context not shown here]

G.-C. Roman and H. C. Cunningham. The synchronic group: A concurrent programming concept and its proof logic. In Proceedings of the 10th International Conference on Distributed Computing Systems. IEEE, May 1990.

....synchronous and asynchronous processing modes, both statically and dynamically; and to accommodate highly dynamic program and data structures. Our study of the shared dataspace paradigm has a very broad scope, encompassing the development of formal (operational and axiomatic) semantic models [12, 13, 30], novel programming metaphors specific to the shared dataspace paradigm [29] and new approaches to visualizing concurrent computations [28] This paper reports the progress toward the development of the Swarm model and a few of its programming implications. The paper has three parts. Section 2 ....

....model for Swarm. 2 THE SWARM NOTATION This section introduces the Swarm model and notation informally. A formal operational model is relegated to the Appendix. UNITY like assertional programming logics have also been developed for Swarm; these programming logics are described in [12] 13] and [30]. The presentation in this section begins with a formal specification of a region labeling problem. Next, using a well known programming notation, Dijkstra s Guarded Commands (GC) 14] the section presents a simple program to solve this problem. The GC program is then transformed, step by step, ....

[Article contains additional citation context not shown here]

G.-C. Roman and H. C. Cunningham. The synchronic group: A concurrent programming concept and its proof logic. In Proceedings of the 10th International Conference on Distributed Computing Systems, pages 142--149. IEEE, May 1990.

....deleted automatically whenever it is executed unless it reinserts itself explicitly. It is important to note that transactions can alter not only the data and control state of the program but also its synchrony. Swarm is the first model to include this capability and also to provide a proof logic [6, 14] that allows one to reason formally about dynamic synchrony. Each Swarm transaction may be represented by a finite set of independent actions which are executed synchronously and are inserted into and deleted from the control state as a group. This aspect of the synchrony relation is static. The ....

....that these attractive features of DS would be of limited value in the absence of methods that allow for formal verification of programs using synchrony. Fortunately, the work on Swarm led to the development of a UNITY like proof logic that covers dynamic synchronic groups and built in consensus [6, 14]. Modeling and programming unconventional architectures. Throughout this paper we treated DS as a programming language feature and argued it could be helpful in the development of concurrent programs. We believe, however, that in the development of software targeted to heterogeneous, ....

Roman, G.-C., and Cunningham, H. C., The Synchronic Group: A Concurrent Programming Concept and its Proof Logic, Proceedings of the 10th International Conference on Distributed Computing Systems (1990), pp. 142-149.

....creation of data entities and statements and includes facilities for specifying complex mixes of synchronous and asynchronous computations. Re coding the algorithms stated in Swarm to conform to the language available on the target system is of no concern in this paper. The Swarm proof logic [6, 12] (a direct extension of the UNITY proof logic) forms the basis for specifying both the functional requirements and the architectural constraints and for deriving and verifying the algorithms used in the simulation. Program derivation follows the general scheme outlined by Chandy and Misra. The ....

....entry. Synchrony relation entries can also be deleted using the dagger. Furthermore, it is possible to query (but not modify) the transitive closure of the synchrony relation using in place of . 3. 1 Formal Foundations For a summary of the Swarm proof logic, the reader should refer to [6, 12]. This section reviews the basic notational conventions for stating assertions about programs. These notational conventions in are summarized in Figure 1 (any property written without explicit quantification is universally quantified over all possible values of the free variables occurring in it) ....

Roman, G.-C., and Cunningham, H. C., "The Synchronic Group: A Concurrent Programming Concept and its Proof Logic," Proceedings of the 10th International Conference on Distributed Computing Systems, pp. 142-149, 1990.

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