User menu

Parallel composition of assumption-commitment specifications

Bibliographic reference Cau, A ; Collette, P.. Parallel composition of assumption-commitment specifications. In: Acta informatica, Vol. 33, no. 2, p. 153-176 (1996)
Permanent URL
  1. Abadi Martín, Lamport Leslie, An old-fashioned recipe for real time, Real-Time: Theory in Practice (1992) ISBN:9783540555643 p.1-27, 10.1007/bfb0031985
  2. Abadi Martín, Lamport Leslie, Composing specifications, 10.1145/151646.151649
  3. Abadi, M., Lamport, L.: Conjoining specifications, Digital Equipment Corporation Systems Research Center, Research Report 118, 1993.
  4. Abadi Martín, Plotkin Gordon D., A logical view of composition, 10.1016/0304-3975(93)90151-i
  5. Aczel, P.: On an inference rule for parallel composition. Unpublished, University of Manchester 1983
  6. Barringer Howard, Kuiper Ruurd, Pnueli Amir, Now you may compose temporal logic specifications, 10.1145/800057.808665
  7. Barringer, H., Kuiper, R., Pnueli, A.: A compositional temporal approach to a CSP-like language. In: Neuhold, E.J., Chroust, G. (eds.) Formal Models of Programming. Elsevier 1985
  8. Brookes S. D., Hoare C. A. R., Roscoe A. W., A Theory of Communicating Sequential Processes, 10.1145/828.833
  9. Broy Manfred, Functional specification of time-sensitive communicating systems, 10.1145/151299.151302
  10. Cau, A., Kuiper, R., de Roever, W.-P.: Formalizing Dijkstra’s development strategy within Stark’s formalism. In: Jones, C.B., Shaw, R.C. Denvir, T. (eds.) Proc. 5th BCS-FACS Refinement Workshop, pp 4–42. Springer-Verlag 1992
  11. Collette Pierre, Application of the composition principle to unity-like specifications, Lecture Notes in Computer Science (1993) ISBN:9783540566106 p.230-242, 10.1007/3-540-56610-4_67
  12. Collette Pierre, An explanatory presentation of composition rules for assumption-commitment specifications, 10.1016/0020-0190(94)90041-8
  13. Collette, P.: Design of compositional proof systems based on assumption-commitment specifications —Application to UNITY. Ph.D. Thesis, Université Catholique de Louvain, 1994.
  14. Grønning Peter, Nielsen Thomas Qvist, Løvengreen Hans Henrik, Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables, Lecture Notes in Computer Science (1990) ISBN:9783540534877 p.332-348, 10.1007/3-540-53487-3_55
  15. Hennessy, M: The semantics of programming languages. Wiley 1990
  16. Jones, C.B.: Development methods for computer programs including a notion of interference. Ph.D. Thesis, Oxford University, 1981.
  17. Jones C. B., Tentative steps toward a development method for interfering programs, 10.1145/69575.69577
  18. Misra J., Chandy K.M., Proofs of Networks of Processes, 10.1109/tse.1981.230844
  19. Pandya, P.K.: Compositional verification of distributed programs. Ph.D. Thesis, University of Bombay 1988.
  20. Pandya Paritosh K., Some comments on the assumption-commitment framework for compositional verification of distributed programs, Lecture Notes in Computer Science (1990) ISBN:9783540525592 p.622-640, 10.1007/3-540-52559-9_81
  21. Pandya Partosh K., Joseph Mathai, P — A logic — a compositional proof system for distributed programs, 10.1007/bf02311231
  22. Pnueli Amir, In Transition From Global to Modular Temporal Reasoning about Programs, Logics and Models of Concurrent Systems (1985) ISBN:9783642824555 p.123-144, 10.1007/978-3-642-82453-1_5
  23. de Roever, W.-P.: The quest for compositionality —a survey of assertion based proof systems for concurrent programs, Part I. In Proc. of IFIP Working Conference: The Role of Abstract Models in Computer Science, North-Holland, 1985.
  24. de Roever, W.-P., Hooman, J., de Boer, F., Lakhneche, Y., Xu, Q., Pandya, P.: State-based proof theory of concurrency: from noncompositional to compositional methods. Book manuscript, 350 pages, Christian-Albrechts-Universität zu Kiel, Germany, 1994
  25. Stark Eugene W., A proof technique for rely/guarantee properties, Lecture Notes in Computer Science (1985) ISBN:9783540160427 p.369-391, 10.1007/3-540-16042-6_21
  26. Stirling Colin, A generalization of Owicki-Gries's Hoare logic for a concurrent while language, 10.1016/0304-3975(88)90033-3
  27. Stølen Ketil, A method for the development of totally correct shared-state parallel programs, Lecture Notes in Computer Science (1991) ISBN:9783540544302 p.510-525, 10.1007/3-540-54430-5_110
  28. Stølen, K., Dederichs, F., Weber, R.: Assumption/commitment rules for networks of asynchronously communicating agents. Technical Report SFB 342/2/93, Technical University of Munich 1993
  29. Woodcock, J.C.P., Dickinson, B.: Using VDM with rely and guarantee-conditions, in Bloomfield, R., Marshall, L., Jones, R. (eds.). Proc. VDM ’88, The Way Ahead. (Lect. Notes Comput. Sci., vol 328, pp 434–458.) Springer-Verlag 1988
  30. Xu, Q., He, J.: A theory of state-based parallel programming: Part I. In Morris, J. (ed.) Proc. 4th BCS-FACS Refinement Workshop, pp 326–359. Springer-Verlag 1991
  31. Zwiers Job, Bruin Arie, Roever Willem Paul, A proof system for partial correctness of dynamic networks of processes, Logics of Programs (1984) ISBN:9783540128960 p.513-527, 10.1007/3-540-12896-4_384
  32. Zwiers, J., de Roever, W.-P., van Emde Boas,P.: Compositionality and concurrent networks: soundness and completeness of a proof system. Technical Report 57, University of Nijmegen 1984.
  33. Zwiers, J.: Compositionality, concurrency and partial correctness. (Lect. Notes Comput. Sci., vol 321) Springer-Verlag 1989