Formal specification and design of mobile systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 211-

  Roman, G C ^a   Julien, C ^a   Huang, Qingfeng ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966553253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016623     Document Type: Conference Paper

References (23)

1. R. Back and K. Sere. Stepwise refinement of parallel algorithms. Sci. Comput. Prog., 13(2):133-180, 1990.
2. K. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, Reading, MA, 1988.
3. H. Cunningham and G.-C. Roman. A UNITY-style programming logic for a shared dataspace language. IEEE Trans. on Parall. Dist. Sys., 1(3):365-376, 1990.
4. E. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J., 1976.
5. E. Dijkstra and W. Fiejen. A Method of Programming. Addison-Wesley, Reading, MA, 1988.
6. J. Ebergen and R. Hoogerwoord. A derivation of a serial-parallel multiplier. Sci. Comput. Prog., 15:201-215, 1990.
7. D. Gries. The Science of Programming. Springer-Verlag, New York, 1981.
8. D. Gries and J. Prims. A new notion of encapsulation. ACM SIGPLAN Notices, 20(7):131-139, 1985.
9. R. Hoogerwoord. A calculational derivation of the CASOP algorithm. Inf. Process. Letters, 36:297-299, 1990.
10. E. Knapp. An exercise in the formal derivation of parallel programs: Maximum flows in graphs. ACM Trans. on Prog. Lang. and Sys., 12(2):203-223, 1990.
11. C. Lenguaer. A methodology for programming with concurrency: The formalism. Sci. Comput. Prog., 2(1):19-52, 1982.
12. P. J. McCann and G.-C. Roman. Compositional programming abstractions for mobile computing. IEEE Trans. on Soft. Eng., 24(2):97-110, 1998.
13. P. J. McCann and G.-C. Roman. Modeling Mobile IP in Mobile UNITY. ACM Trans. on Software Engineering and Methodology, 8(2):115-146, 1999.
14. C. Morgan. The specification statement. ACM Trans. on Prog. Lang. and Sys., 10(3):403-419, 1988.
15. J. Morris. Laws of data refinement. Acta Informatica, 26:287-308, 1989.
16. st Int. Conf. on Software Engineering, pages 368-377, May 1999.
17. G. P. Picco, G. C. Roman, and P. J. McCann. Reasoning about Code Mobility in Mobile UNITY. WUCS-97-43, Washington University in St. Louis, Department of Computer Science, 1997. (an extended version to appear in ACM TOSEM).
18. G.-C. Roman and H. Cunningham. Mixed programming metaphors in a shared dataspace model of concurrency. IEEE Trans. on Soft. Eng., 16(12):1361-1373, 1990.
19. G.-C. Roman and H. Cunningham. Reasoning about synchronic groups. In J. Banatre and D. Metayer, editors, Research Directions in High-Level Parallel Programming Languages, pages 21-38, 1992.
20. G.-C. Roman, R. Gamble, and W. Ball. Formal derivation of rule-based programs. IEEE Trans. on Soft. Eng., 19(3):227-296, 1993.
21. nd Intl. Conf. on Soft. Eng., ACM Press, 2000.
22. G.-C. Roman and C. Wilcox. Architecture-directed refinement. IEEE Trans. on Soft. Eng., 20(4):239-258, 1994.
23. M. Staskauskas. A formal specification and design of a distributed electronic funds-transfer network. IEEE Trans. Comput., 37(12):1515-1528, 1988.