Stream-based specification of mobile systems

Formal Aspects of Computing

Volumn 13, Issue 1, 2001, Pages 1-31

  Grosu, Radu ^a   Stølen, Ketil ^b  

^a USA   (United States)

^b SINTEF   (Norway)

Author keywords

Denotational model; Input output relation; Many to many communication; Mobile system; Point to point communication; Specification

Indexed keywords

EID: 0041407003     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00003937     Document Type: Article

References (43)

1. Abramski, S.: Retracing Some Paths in Process Algebra. In Proceedings of the International Conference on Concurrency Theory. LNCS 1055, Springer, Berlin, 1996, pp. 21-33.
2. Agha, G., Mason, I. A. Smith, S. F. and Talcott, C. L.: Towards a theory of actor computation. In Proceedings of the International Conference on Concurrency Theory, LNCS 630, Springer, Berlin, 1992, pp. 565-579.
3. Brock, J. D. and Ackermann, W. B.: Scenarios: A model of non-determinate computation. In Proceedings of the Formalisation of Programming Concepts, LNCS 107, Springer, Berlin, 1981, pp. 252-259.
4. Berry, G. and Boudol, G.: The chemical abstract machine. In Proceedings of the ACM Symposium on Principles of Programming Languages, San Francisco, 7th Annual ACM Symp., ACM Press, 1990, pp. 81-94.
5. Broy, M., Dederichs, F., Dendorfer, C., Fuchs, M., Gritzner, T. F. and Weber, R.: The design of distributed systems: an introduction to Focus (revised version). Technical Report SFB 342/2/92 A, Technische Universität München, 1993.
6. Broy, M.: Equations for describing dynamic nets of communicating systems. In Proceedings of the COMPASS Workshop, LNCS 906, Springer, Berlin, 1995, pp. 170-187.
7. Broy, M. and Stølen, K.: Specification and refinement of finite dataflow networks: a relational approach. In Proceedings of the International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. LNCS 863, Springer, Berlin, 1994, pp. 247-267.
8. Broy, M. and Stølen, K.: Specification and Development of Interactive Systems: FOCUS on Streams, Interfaces and Refinement. Springer, Berlin, 2001.
9. Engberg, U. and Nielsen, M.: A calculus of communicating systems with label-passing. Technical Report DAIMI PB-208, University of Aarhus, 1986.
10. Engelking, R.: General Topology. volume 6 of Sigma Series in Pure Mathematics, Heldermann Verlag, Berlin, revised and completed edition, 1989.
11. Fiore, M. P., Moggi, E. and Sangiorgi, D.: A fully-abstract model for the pi-calculus (extended abstract). In Proc. of the 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, 27-30 July 1996, IEEE Computer Society Press.
12. Gries, D. and Levin, G. M.: Assignment and procedure call proof rules. ACM Transactions on Programming Languages and Systems, 2:564-579, 1980.
13. Grosu, R.: A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technical Report TUM-19444, Technische Universität München, 1994.
14. Grosu, R. and Stølen, K.: Selected Papers from 8th Nordic Workshop on Programming Theory, NWPT'96, Oslo, Norway, 4-6 Dec. 1996, Research Report 248, Dept. of Informatics, Univ. of Oslo, 1997, pp. 67-76.
15. Grosu, R. and Stølen, K.: A denotational model for mobile many-to-many dataflow networks. Technical Report TUM-19622. Technische Universität München, 1996.
16. Grosu, R. and Stølen, K.: A model for mobile point-to-point dataflow networks without channel sharing. In Proceedings of the Conference on Algebraic Methodology and Software Technology, LNCS 1101, Springer, Berlin, 1996, pp. 504-519.
17. Grosu, R. and Stølen, K.: Specification of Dynamic Networks. In Proceedings of the Nordic Workshop on Programming Theory, 1997, pp. 67-76.
18. Grosu, R., Stølen, K. and Broy, M.: A denotational model for mobile point-to-point dataflow networks with channel sharing. Technical Report TUM-19717, Technische Universität München, 1997.
19. Hewitt, C., Bishop, P. and Steiger, R.: A universal modular actor formalism for artificial intelligence. In Proceedings of the 3rd International Joint Conference on Artificial Intelligence, Stanford, CA, August 1973, William Kaufmann, Nilsson, N. J. editor, pp. 235-245.
20. Hinkel, U.: Verification of SDL specifications on base of a stream semantics. In Proceedings of the Workshop of the SDL Forum Society on SDL and MSC, 1998, pp. 241-250.
21. Hoare, C. A. R.: Procedures and parameters: an axiomatic approach. In Symposium on Semantics of Algorithmic Languages, E. Engeler (editor), Lecture Notes in Mathematics, vol. 188, Springer Verlag, 1971, pp. 102-116.
22. Hinkel, U. and Spies, K.: Anleitung zur Spezifikation von mobilen, dynamischen FOCUS-Netzen. Technical Report TUM-19639, Technische Universität München, 1996.
23. International Telecommunication Union, Geneva. Recommendation Z.100: Functional Specification and Description Language (SDL), 1993.
24. Jagadeesan, L. J. and Jagadeesan, R.: Causality and true concurrency: A dataflow analysis of the pi-calculus. In Proceedings of the Conference on Algebraic Methodology and Software Technology, LNCS 936, 1995, pp. 277-291.
25. Jones, C. B.: Systematic Software Development Using VDM, (2nd edn). Prentice-Hall, Englewood Cliffs, NJ, 1990.
26. Jonsson, B.: A fully abstract trace model for dataflow networks. In Proceedings ofthe ACM Symposium on Principles of Programming Languages, 1989, pp. 155-165.
27. Kahn, G.: The semantics of a simple language for parallel programming. Jack L. Rosenfeld (Ed.), Information Processing 74, In Proceedings of IFIP Congress 74, Stockholm, Sweden, August 5-10, 1974, North Holland, 1974.
28. Keller, R. M.: Denotational models for parallel programs with indeterminate operators. In Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1978, pp. 337-363.
29. Kahn, G. and MacQueen, B. D.: Coroutines and networks of parallel processes, In Proceedings of the IFIP Congress, 1977, pp. 993-998.
30. Kok, J. N.: A fully abstract semantics for data flow nets. In Proceedings of the Conference on Parallel Architectures and Languages Europe, LNCS 259, Springer, Berlin, 1987, pp. 351-368.
31. Kok, J. N.: An iterative metric fully abstract semantics for non-deterministic dataflow. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science, LNCS 379, Springer, Berlin, 1989, pp. 321-331.
32. London, R. L., Guttag, J. V., Horning, J. J., Lampson, B. W., Mitchell, J. G. and Popek, G. J.: Proof rules for the programming language Euclid. Acta Informatica, 1978, 10:1-26.
33. Meseguer, J.: Conditional rewriting logic as a model of concurrency. Theoretical Computer Science, 96(1), 73-155 6 April 1992.
34. Milner, R.: The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh, 1991.
35. Milner, R., Parrow, J. and Walker, D.: A calculus of mobile processes, parts I and II. Information and Computation, 1992, 100:1-77.
36. Stølen, K. and Fuchs, M.: An exercise in conditional refinement. In Prospects for Hardware Foundations, LNCS 1546, 1998, pp. 390-420.
37. Spivey, J. M.: Understanding Z, a Specification Language and its Formal Semantics, Vol. 3 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK, 1988.
38. Spies, K.: Eine Methode zur Formalen Modellierung von Betriebsystemkonzepten. PhD thesis, Technische Universität München, 1998.
39. Stark, I.: A fully abstract domain model for the π-calculus. In Proceedings of the IEEE Symposium on Logic in Computer Science, 1996, pp. 36-42.
40. Stephens, R.: A survey of stream processing. Acta Informatica, 1997, 34:491-541.
41. Stølen, K.: Using relations on streams to solve the RPC-memory specification problem. In Formal Systems Specification: The RFC-Memory Specification Case Study, LNCS 1169, Springer, Berlin, 1996, pp. 477-520.
42. Stølen, K.: Specification of Dynamic Reconfiguration in the Context of Input/Output Relations. In Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 1999, pp. 259-272.
43. Thomsen, B.: A calculus of higher order communicating systems. In 16th Annual Symposium on Principles of Programming Languages, Austin, Texas, January 1989, ACM Press.