Abstract
During the last 15 years a large number of specification techniques based on the so-called assumption/commitment paradigm have been proposed. The formulation of verification rules for the composition of such specifications is known to be a difficult task. Most rules published so far impose strong constraints on the type of properties that can be expressed by the assumptions. Moreover, if completeness results are provided at all they are normally quite weak. We investigate these problems in the context of a model for dataflow networks.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
P. America, J. de Bakker, J. N. Kok, and J. Rutten. Denotational semantics of a parallel object-oriented language. Information and Computation, 83:152–205, 1989.
M. Abadi and L. Lamport. Composing specifications. Technical Report 66, Digital, SRC, Palo Alto, 1990.
M. Abadi and L. Lamport. Conjoining specifications. Technical Report 118, Digital, SRC, Palo Alto, 1993.
M. Broy. Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing, 2:13–31, 1987.
M. Broy. A functional rephrasing of the assumption/commitment specification style. Technical Report SFB 342/10/94 A, Technische Universität München, 1994.
M. Broy. Advanced component interface specification. In Proc. TPPP'94, Lecture Notes in Computer Science 907, pages 369–392, 1995.
P. Collette. Design of Compositional Proof Systems Based on Assumption-Commitment Specifications — Applications to UNITY. PhD thesis, Université Catholique de Louvain, 1994.
C. B. Jones. Specification and design of (parallel) programs. In Proc. Information Processing 83, pages 321–331. North-Holland, 1983.
J. N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE'87, Lecture Notes in Computer Science 259, pages 351–368, 1987.
L. Lamport. E-mail to Pierre Collette. December 15, 22:01:13 EDT, 1995.
J. Misra and K. M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7:417–426, 1981.
P. K. Pandya. Some comments on the assumption-commitment framework for compositional verification of distributed programs. In Proc. REX Workshop on Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science 430, pages 622–640, 1990.
D. Park. The “fairness” problem and nondeterministic computing networks. In Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, pages 133–161. Mathematisch Centrum Amsterdam, 1983.
P. K. Pandya and M. Joseph. P-A logic — a compositional proof system for distributed programs. Distributed Computing, 5:37–54, 1991.
A. Pnueli. In transition from global to modular temporal reasoning about programs. In Proc. Logics and Models of Concurrent Systems, pages 123–144. Springer, 1985.
K. Stø1en, F. Dederichs, and R. Weber. Assumption/commitment rules for networks of asynchronously communicating agents. Technical Report SFB 342/2/93 A, Technische Universität München, 1993. To appear in Formal Aspects of Computing.
E. W. Stark. A proof technique for rely/guarantee properties. In Proc. 5th Conference on the Foundation of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 206, pages 369–391, 1985.
K. Stølen. A method for the development of totally correct shared-state parallel programs. In Proc. CONCUR'91, Lecture Notes in Computer Science 527, pages 510–525, 1991.
J. Zwiers. Compositionality, Concurrency and Partial Correctness: Proof Theories for Networks of Processes and Their Relationship, volume 321 of Lecture Notes in Computer Science. 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stølen, K. (1996). Assumption/commitment rules for dataflow networks — with an emphasis on completeness. In: Nielson, H.R. (eds) Programming Languages and Systems — ESOP '96. ESOP 1996. Lecture Notes in Computer Science, vol 1058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61055-3_48
Download citation
DOI: https://doi.org/10.1007/3-540-61055-3_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61055-7
Online ISBN: 978-3-540-49942-8
eBook Packages: Springer Book Archive