A rely-guarantee discipline for open distributed systems design

Information Processing Letters

Volumn 74, Issue 1-2, 2000, Pages 55-63

  Duarte, Carlos H C ^a   Maibaum, Tom ^b  

^a Ed BNDES   (Brazil)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Formal methods; Rely guarantee discipline; Software design; Software engineering; Specification; Temporal logic; Verification

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; FORMAL LOGIC; OPEN SYSTEMS; SOFTWARE ENGINEERING;

RELY-GUARANTEE DISCIPLINE; TEMPORAL LOGIC;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0033728194     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(00)00038-7     Document Type: Article

References (20)

1. M. Abadi, L. Lamport, Conjoining specifications, ACM Trans. Program. Languages Systems 17 (3) (1995) 507-534.
2. H. Barringer, The use of temporal logic in the compositional specification of concurrent systems, in: A. Galton (Ed.), Temporal Logics and their Applications, Academic Press, New York, 1987, pp. 53-90.
3. A. Cau, P. Collete, Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency, Acta Inform. 33 (1996) 153-176.
4. K.M. Chandy, J. Misra, Proofs of networks of processes, IEEE Trans. Software Engrg. 7 (4) (1981) 417-426.
5. P. Collete, Composition of assumption-commitment specifications in a UNITY style, Sci. Comput. Program. 23 (1994) 107-125.
6. C.H.C. Duarte, Proof-theoretic foundations for the design of extensible software systems, Ph.D. Thesis, Department of Computing, Imperial College, London, UK, 1998.
7. C.H.C. Duarte, Proof-theoretic foundations for the design of actor systems, Math. Structures Comput. Sci. 9 (2) (1999) 227-252.
8. J. Fiadeiro, T. Maibaum, Temporal theories as modularisation units for concurrent systems specification, Formal Aspects Comput. 4 (3) (1992) 239-272.
9. J. Fiadeiro, T. Maibaum, Design structures for object-based systems, in: S. Goldsack, S. Kent (Eds.), Formal Aspects of Object-Oriented Systems, Prentice-Hall, Englewood Cliffs, NJ, 1994.
10. J. Fiadeiro, T. Maibaum, Categorical semantics of parallel program design, Sci. Comput. Program. 28 (2-3) (1997) 111-138.
11. D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the temporal analysis of fairness, in: Proc. 7th ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1980, pp. 163-173.
12. C.B. Jones, Specification and design of (parallel) programs, in: R.E.A. Mason (Ed.), Information Processing 83: IFIP 9th World Congress, Elsevier, Amsterdam, 1983, pp. 321-332.
13. B. Jonsson, Y.-K. Tsay, Assumption/guarantee specifications in linear time temporal logic, in: P.D. Mosses, M. Nielsen, M.I. Schwartzbach (Eds.), Theory and Practice of Software Development (TAPSOFT'95), Lecture Notes in Comput. Sci., Vol. 915, Springer, Berlin, 1995, pp. 262-276.
14. L. Lamport, The temporal logic of actions, ACM Trans. Program. Languages Systems 16 (3) (1994) 872-923.
15. A. Lopes, J. Fiadeiro, Preservation and reflection in specification, in: M. Johnson (Ed.), Proc. 6th International Conference on Algebraic Methodology and Software Technology (AMAST'97), Lecture Notes in Comput. Sci., Vol. 1349, Springer, Berlin, 1997, pp. 380-394.
16. Z. Manna, A. Pnueli, The anchored version of the temporal framework, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Comput. Sci., Vol. 354, Springer, Berlin, 1989, pp. 200-284.
17. B. Moszkowski, Using temporal fixpoints to compositionally reason about liveness, in: H. Jifeng, J. Cooke, P. Wallis (Eds.), Proc. 7th BCS-FACS Refinement Workshop, 1996.
18. P.K. Pandya, M. Joseph, P-A logic: A compositional proof system for distributed systems, Distrib. Comput. 5 (1991) 37-54.
19. A. Pnueli, In transition from global to modular temporal reasoning about programs, in: K.R. Apt (Ed.), Logics and Models of Concurrent Systems, NATO ASI Series, Vol. 13, Springer, Berlin, 1985, pp. 123-144.
20. K. Stolen, A method for the development of totally correct shared-state parallel programs, in: J.C. Baeten, J.F. Groote (Eds.), Proc. 2th International Conference on Concurrency Theory (CONCUR'91), Lecture Notes in Comput. Sci., Vol. 527, Springer, Berlin, 1991, pp. 510-525.