Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach

In this paper, we extended abstract data types methods to the question of the specification and the implementation of data structures accessed concurrently by several processes. Our approach provides the underlying theory for modularity and development by a stepwise refinement strategy of such systems.

[1]  Manfred Broy,et al.  Specification and Top Down Design of Distributed Systems , 1985, TAPSOFT, Vol.1.

[2]  William E. Weihl.  Data-dependent concurrency control and recovery , 1985, OPSR.

[3]  Samuel N. Kamin.  Final data type specifications: a new data type specification method , 1980, POPL '80.

[4]  Christine Choppy,et al.  A Lisp Compiler for FP Language and Its Proof via Algebraic Semantics , 1985, TAPSOFT, Vol.1.

[5]  BackusJohn.  Can programming be liberated from the von Neumann style , 1978 .

[6]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[7]  Stephen N. Zilles,et al.  Specification techniques for data abstractions , 1975 .

[8]  John H. Williams,et al.  On the Development of the Algebra of Functional Programs , 1982, TOPL.

[9]  Frits W. Vaandrager.  Verification of two communication protocols by means of process algebra , 1986 .

[10]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[11]  Jan A. Bergstra,et al.  Top-Down Design and the Algebra of Communicating Processes , 1985, Sci. Comput. Program..

[12]  William B. Ackerman,et al.  Data Flow Languages , 1899, Computer.

[13]  Christine Choppy,et al.  Abstract Implementations and Correctness Proofs , 1986, STACS.

[14]  Gianna Reggio,et al.  On the Parameterized Algebraic Specification of Concurrent Systems , 1985, TAPSOFT, Vol.1.

[15]  William E. Weihl,et al.  Implementation of resilient, atomic data types , 1985, TOPL.

[16]  Leslie Lamport,et al.  Specifying Concurrent Program Modules , 1983, TOPL.

[17]  Jack B. Dennis,et al.  First version of a data flow procedure language , 1974, Symposium on Programming.

[18]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.