Refinement calculus for tuple spaces

Science of Computer Programming

Volumn 34, Issue 2, 1999, Pages 79-140

  Semini, Laura ^a   Montangero, Carlo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; LARGE SCALE SYSTEMS;

REFINEMENT CALCULUS; TUPLE SPACE LANGUAGES;

PROGRAMMING THEORY;

EID: 0033149703     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6423(98)00021-5     Document Type: Article

References (54)

1. M. Abadi, L. Lamport, Composing specifications, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg, (Eds.), Proc. Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science. Vol. 430, Springer, Berlin, 1989, pp. 1-41.
2. B. Alpern, F.B. Shneider, Defining liveness, Inform. Process Lett. 21 (4) (1985) 181-185.
3. V. Ambriola, P. Ciancarini, C. Montangero, Software process enactment in Oikos, in: R. Taylor (Ed.), Proc. ACM SIGSOFT 90, 4th Symp. on Software Development Environments, Irvine, CA, 1990, pp. 183-192.
4. V. Ambriola, G.A. Cignoni, L. Semini, Eta - Everything but assignment, in: M. Alpuente, R. Barbuti, I. Ramos (Eds.), Proc. Joint Conf. on Declarative Programming GULP-PRODE'94, Peniscula, September 1994.
5. V. Ambriola, G.A. Cignoni, L. Semini, A proposal to merge object orientation, logic programming, and multiple tuple spaces, Comput. Languages 22 (2/3) (1996) 79-93.
6. V. Ambriola, L. Semini, Control Specification in Tuple Space Based Languages, Technical Report 19-93, Dipartimento di Informatica, Università di Pisa, 1993.
7. J.M. Andreoli, R. Pareschi, Linear objects: Logical processes with built-in inheritance, in: D.H.D. Warren, P. Szeredi (Eds.), Proc. 7th Internat. Conf. on Logic Programming, MIT Press, Cambridge, MA, 1990, pp. 495-510.
8. K.R. Apt, E.-R. Olderog, Verification of Sequential and Concurrent Programs, Springer, Berlin, 1991.
9. F. Arbab, I. Herman, P. Spilling, An overview of manifold and its implementation, Concurrency: Practice Experience 5 (1) (1993) 23-70.
10. R.J.R. Back, R. Kurki-Suonio, Distributed cooperation with action systems, ACM Trans. Programm. Languages Systems 10 (4) (1988) 513-554.
11. R.J.R. Back, J. Von Wright, Refinement calculus, Part I: Sequential nondeterministic programs, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), Proc. Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science. Vol. 430, Springer, Berlin, 1989, pp. 42-66.
12. J.-P. Banâtre, D. Le Métayer, The GAMMA model and its discipline of programming, Science of Computer Programming 15 (1990) 55-77.
13. J.P. Banatre, D. Le Métaier, Programming by multiset transformation, Commun. ACM 16 (1) (1993) 55-77.
14. K. De Bosschere, J.-M. Jacquet, Multi-prolog: Definition, operational semantics and implementation, in: D.S. Warren (Ed.), Proc. 10th Internat. Conf. on Logic Programming, 1993, pp. 299-313.
15. 2 Log: Towards remote coordination, in: P. Ciancarini, C. Hankin (Eds.), Proc. Coordination Languages and Models, 1st Int. Conf., COORDINATION 96, Lecture Notes in Computer Science, Vol. 1061, Cesena, Springer, Berlin, April 1996, pp. 142-159.
16. A. Brogi, P. Ciancarini, The concurrent language shared prolog, ACM Trans. Programm. Languages Systems 13 (1) (1991) 99-123.
17. M. Broy, Functional specification of time sensitive communicating systems, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds. ), Proc. Stepwise Refinement of Distributed Systems, Lecture Notes in Computer Science, Vol. 430, Springer, Berlin, 1989, pp. 153-179.
18. M. Broy, (Inter-) action refinement: The easy way, in: M. Broy (Ed.), Program Design Calculi, NATO ASI Series, Springer, Berlin, 1993, pp. 121-158.
19. A. Bucci, P. Ciancarini, C. Montangero, A distributed logic language based on multiple tuple spaces, Proc. Logic Programming Conf., Tokio, 1991, pp. 199-208.
20. N. Carriero, D. Gelernter, Linda and friends, IEEE Comput. 19 (8) (1986) 26-34.
21. N. Carriero, D. Gelernter, Coordination languages and their significance, Commun. ACM 5 (2) (1989) 97-107.
22. N. Carriero, D. Gelernter, Linda in context, Commun. ACM 32 (4) (1989) 444-459.
23. K.M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, Reading, MA, 1988.
24. X.J. Chen, Formalism and Verification Towards Software Process Modelling, Ph.D. Thesis, Scuola Normale Superiore di Pisa, 1992.
25. X.J. Chen, C. Montangero, Compositional refinements of multiple blackboard systems, Acta Inform. 32 (5) (1995) 415-458.
26. P. Ciancarini, Polis: A programming model for multiple tuple spaces, in: Proc. 6th IEEE Internat. Workshop on Software Specification and Design, 1991.
27. P. Ciancarini, C. Hankin (Eds.), Proc. COORDINATION 96, Lecture Notes in Computer Science, Vol. 1061, Cesena, Springer, Berlin, April 1996.
28. H.C. Cunningam, G.-C. Roman, A UNITY-style programming logic for shared dataspace programs, IEEE Trans. Parallel Distributed Systems 1 (3) (1990) 365-376.
29. E.W. Dijkstra, C.S. Scholten, Predicate Calculus and Program Semantics, Springer, Berlin, 1990.
30. A. Finkelstein, J. Kramer, B. Nuseibeh (Eds.), Software Process Modelling and Technology, Research Study Press distributed by Wiley, London, 1994.
31. D. Garlan, D. LeMetayer (Eds.), Proc. 2nd Internat. Conf. on Coordination Models and Languages, Lecture Notes in Computer Science, Vol. 1282. Berlin, Germany, Springer, Berlin, 1997.
32. M. Gaspari, L. Semini, Fairness in logic languages based on shared dataspace, in: K. De Bosschere, J.-M. Jacquet, P. Tarau (Eds. ), Proc. ICLP'93 Post-Conf. Workshop on Blackboard-Based Logic Programming, Budapest, 1993.
33. J.-Y. Girard, Linear logic, Theore. Comput. Sci. 50 (1987) 1-102.
34. H.J.M. Goeman, J.N. Kok, K. Sere, R. Udkin, Coordination in the impunity framework, Science of Computer Programming 31 (2-3) (1998) 313-334.
35. C.A.R. Hoare, Programs are predicates, in: C.A.R. Hoare, J.C. Shepherdson (Eds.), Mathematical Logic and Programming Languages, Prentice-Hall, Englewood Cliffs, NJ, 1985, pp. 141-155.
36. C.A.R. Hoare, Algebra and models, in: M. Broy (Ed.), Program Design Calculi, NATO ASI Series, Springer, Berlin, 1993, pp. 161-195.
37. J.-M. Jacquet, K. De Bosschere, On composing concurrent logic processes, in: L. Sterling (Ed.), Proc. 12th Internal. Conf. on Logic Programming, ICLP'95, Tokio, MIT Press, Cambridge, MA, 1995, pp. 531-545.
38. C.B. Jones, Specification and design of (parallel) programs, in: R.E.A. Mason (Ed.), Information Processing 83, North-Holland, Amsterdam, 1983, pp. 321-332.
39. F. Kröger, Temporal Logic of Programs, Springer, Berlin, 1987.
40. J.W. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1987.
41. Z. Manna, A. Pnueli, Verification of concurrent programs: A temporal proof system, in: J.W. de Bakker, J. van Leeuwen (Eds.), Foundations of Computer Science IV, Distributed Systems: Part 2, Mathematical Centre Tracts, Vol. 159, Amsterdam, 1983, pp. 163-255.
42. Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer, New York, 1992.
43. C. Montangero, V. Ambriola, Oikos: Constructing process-centered SDEs, in: A. Finkelstein, J. Kramer, B. Nuseibeh (Eds.), Software Process Modelling and Technology, Research Study Press distributed by Wiley, London, 1994, pp. 131-151.
44. C. Montangero, L. Semini, Applying refinement calculi to software process modelling, in: W. Schaefer (Ed. ), Proc. 4th Internat. Conf. on the Software Process ICSP4, Brighton, UK, IEEE Computer Society Press, Los Alamitos, December 1996, pp. 63-74.
45. C. Montangero, L. Semini, Refining by architectural styles or architecting by refinements, in: L. Vidal, A. Finkelstein, G. Spanoudakis, A.L. Wolf (Eds.), 2nd Internat. Software Architecture Workshop, Proc. SIGSOFT '96 Workshops, Part 1, San Francisco, CA, October 1996, ACM Press, New York, pp. 76-79.
46. L. Monteiro, A. Porto, Entailment based actions for coordination, Theoret. Comput. Sci. 192 (2) (1998) 259-286.
47. C.C. Morgan, Programming from Specifications, Prentice-Hall, Englewood Cliffs, NJ, 1990.
48. C.C. Morgan, The refinement calculus, in: M. Broy (Ed.), Program Design Calculi, NATO ASI Series, Springer, Berlin, 1993, pp. 3-52.
49. A. Pnueli, Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends, in: Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224, Springer, Berlin, 1986, pp. 510-584.
50. A. Porto, V. Vasconcelos, Truth and action osmosis (the TAO computational model), in: J.M. Andreoli, C. Hankin, D. LeMetayer (Eds.), Coordination Programming: Mechanisms, Models and Semantics, Imperial College Press, 1996, pp. 65-97.
51. G.-C. Roman, H.C. Cunningam, Mixed programming metaphors in a shared dataspace model of concurrency, IEEE Trans. Software Eng. 16 (2) (1990) 1361-1376.
52. G.-C. Roman, R.F. Gamble, W.E. Ball, Formal derivation of rule-based programs, IEEE Trans. Software Eng. 19 (3) (1993) 277-296.
53. L. Semini, Refinement in Tuple Space Languages. Ph.D. Thesis, Dipartimento di Informatica, Università di Pisa, 1996, TD 10-96.
54. L. Sterling, E.Y. Shapiro, The Art of Prolog, 2nd Ed., MIT Press, Cambridge, MA, 1994.