A fixpoint theory for non-monotonic parallelism

Theoretical Computer Science

Volumn 308, Issue 1-3, 2003, Pages 367-392

  Chen, Yifeng ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Fixpoint; Parallelism; Reactive programs; Recursion; Semantics

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; SEMANTICS; THEOREM PROVING;

REACTIVE PROGRAMS;

COMPUTER SCIENCE;

EID: 0142093020     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00893-9     Document Type: Article

References (35)

1. R.J.R. Back, K. Sere, Stepwise refinement of action systems, in: Mathematics of Program Construction, Lecture Notes in Computer Science, Vol. 375, Springer, Berlin, 1989, pp. 115-138.
2. Bergstra J.A., Klop J.W. Algebra of communicating processes with abstraction. Theoret. Comput. Sci. 37(1):1985;77-121.
3. Bonsangue M.M., Kok J.N. The weakest precondition calculus. Recursion and duality Formal Aspects Comput. 6(A):1994;788-800.
4. Bourbaki N. Elements of Mathematics: Theory of Sets. 1968;Hermann, Paris.
5. Brookes S. Full abstraction for a shared-variable parallel language. Inform. and Comput. 127(2):1996;145-163.
6. Y. Chen, A fixpoint theory for non-monotonic parallelism, in: 11th Annu. Conf. of the European Association for Computer Science Logic, CSL'02, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, 2002, pp. 120-134.
7. Chen Y. Generic composition. Formal Aspects Comput. 14(2):2002;108-122.
8. Y. Chen, J.W. Sanders, Logic of global synchrony, in: 12th Internat. Conf. on Concurrency Theory, Lecture Notes in Computer Science, Vol. 2154, Springer, Berlin, 2001, pp. 487-501.
9. Cousot P., Cousot R. Constructive versions of Tarski's fixed point theorems. Pacific J. Math. 82(1):1979;43-57.
10. Davies J., Schneider S. A brief history of Timed CSP. Theoret. Comput. Sci. 138(2):1995;243-271.
11. Dijkstra E.W. Guarded commands, nondeterminacy and the formal derivation of programs. Comm. ACM. 18(8):1975;453-457.
12. E.W. Dijkstra, C.S. Scholten, Semantics of recursive procedures, EWD 859, 1983.
13. Dijkstra E.W., von Gasteren A.J.M. A simple fixed-point argument without the restriction to continuity. Acta Inform. 23(1):1986;1-7.
14. H. Doornbos, A relational model of programs without the restriction to egli-milner constructs, in: PROCOMET'94, IFIP Transactions, Vol. A-56, North-Holland, Amsterdam, 1994, pp. 363-382.
15. S.E. Dunne, Recasting Hoare and He's relational theory of programs in the context of general correctness, Tech. Report, School of Computing and Mathematics University of Teesside, 2000.
16. S. Fortune, J. Wyllie, Parallelism in random access machines, in: 10th Annu. ACM Symp. on Theory of Computing, ACM Press, 1978, pp. 114-118.
17. A. Geser, et al., Non-monotone fixpoint iterations to resolve second-order effects, in: 6th Internat. Symp. Compiler Construction, Lecture Notes in Computer Science, Vol. 1060, 1996, pp. 106-120.
18. Hehner E.C.R. Specification, programs, and total correctness. Sci. Comput. Programming. 34:1999;191-205.
19. P. Hitchcock, D. Park, Induction rules and termination proofs, in: ICALP'72, North-Holland, Amsterdam, 1972, pp. 225-251.
20. Hoare C.A.R. An axiomatic basis for computer programming. Comm. ACM. 12:1969;576-583.
21. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall, Englewood Cliffs, NJ.
22. Hoare C.A.R., He J. Unifying Theories of Programming. 1998;Prentice-Hall, Englewood Cliffs, NJ.
23. Lassez J., Nguyen V.L., Sonenberg L. Fixed point theorems and semantics. a folk tale Inform. Process. Lett. 14(3):1982;109-111.
24. K. Martin, The measurement process in domain theory, in: ICALP'00, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 116-126.
25. McColl W.F. Scalability, portability and predictability. the BSP approach to parallel programming Future Generation Comput. Systems. 12:1996;265-272.
26. Morgan C.C., McIver A. Unifying wp and wlp. Inform. Process. Lett. 59:1996;159-163.
27. Nelson G. A generalisation of Dijkstra's calculus. ACM Trans. Programming Languages Systems. 11(4):1989;517-561.
28. Nystrom S.O. There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations. Inform. Process. Lett. 60:1996;289-293.
29. D.M.R. Park, On the semantics of fair parallelism, in: Abstract Software Specification, Lecture Notes in Computer Science, Vol. 86, Springer, Berlin, 1980, pp. 504-526.
30. G.D. Plotkin, Lecture Notes on Domain Theory, The Pisa Notes, 1983.
31. Pnueli A. The temporal semantics of concurrent programs. Theoret. Comput. Sci. 13:1981;45-60.
32. Roscoe A.W. The Theory and Practice of Concurrency. 1998;Prentice-Hall, Englewood Cliffs, NJ.
33. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5:1955;285-309.
34. Valiant L.G. A bridging model for parallel computation. Comm. ACM. 33(8):1990;103-111.
35. Woodcock J., Davis J. Using Z: Specification, Refinement, and Proof. 1991;Prentice-Hall, Englewood Cliffs, NJ.