Full Abstraction for a Shared-Variable Parallel Language

Information and Computation

Volumn 127, Issue 2, 1996, Pages 145-163

  Brookes, Stephen ^a  

^a Schenley Park ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013260585     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0056     Document Type: Article

References (22)

1. Abadi, M., and Plotkin, G. D. (1993), A logical view of composition, Theoret. Comput. Sci. 114(1), 3-30.
2. Abrahamson, K. (1979), Modal logic of concurrent nondeterministic programs, in "Semantics of Concurrent Computation" (G. Kahn, Ed.), Lecture Notes in Computer Science, Vol. 70, pp. 21-33, Springer-Verlag, Berlin/New York.
3. Andrews, G. R., and Schneider, F. B. (1983), Concepts and notations for concurrent programming, ACM Comput. Surveys 15(1), 3-43.
4. Apt, K. R., and Plotkin, G. D. (1986), Countable nondeterminism and random assignment, J. Assoc. Comput. Mach. 33 (4), 724-767.
5. Brookes, S. (1993), Full abstraction for a shared variable parallel language, in "Proc. 8th Annual IEEE Symposium on Logic in Computer Science," IEEE Comput. Soc. Press, Los Alamitos, CA.
6. de Bakker, J. W. (1971), Axiom systems for simple assignment statements, in "Symposium on Semantics of Algorithmic Languages" (E. Engeler, Ed.), Lecture Notes in Mathematics, Vol. 188, pp. 1-22, Springer-Verlag, Berlin/New York.
7. de Boer, F., Kok, J., Palamidessi, C., and Rutten, J. (1991), The failure of failures in a paradigm for asynchronous communication, in "Concur '91" (J. Baeten and J. Groote, Eds.), Lecture Notes in Computer Science, Vol. 527, pp. 111-126, Springer-Verlag, Berlin/New York.
8. Francez, N. (1986), "Fairness," Springer-Verlag, Berlin/New York.
9. Hennessy, M., and Plotkin, G. D. (1979), Full abstraction for a simple parallel programming language, in "Mathematical Foundations of Computer Science," Lecture Notes in Computer Science, Vol. 74, pp. 108-120, Springer-Verlag, Berlin/New York.
10. Horita, E., de Bakker, J., and Rutten, J. (1990), Fully Abstract Denotational Models for Nonuniform Concurrent Languages," Technical Report CS-R9027, Centre for Mathematics and Computer Science, Amsterdam.
11. Jonsson, B. (1989), A fully abstract trace semantics for dataflow networks, in "Sixteenth Annual ACM Symposium on Principles of Programming Languages," pp. 155-165, ACM Press, New York.
12. Jonsson, B., and Back, R. J. R. (1993), Fully abstract semantic orderings for shared-variable concurrent programs, draft paper.
13. Keller, R. M., and Panangaden, P. (1986), Semantics of digital networks containing indeterminate operators, Distrib. Comput. 1(4), 235-245.
14. Lamport, L. (1977), Proving the correctness of multiprocess programs, IEEE Trans. Software Eng. 3(2), 125-143.
15. Lamport, L. (1983), What good is temporal logic? in "Information Processing 83: Proceedings of the IFIP 9th World Congress" (R. E. A. Mason, Ed.), pp. 657-668, North-Holland, Amsterdam.
16. Lehmann, D., Pnueli, A., and Stavi, J. (1981), Impartiality, justice, and fairness: the ethics of concurrent termination, in "Proceedings of the Eighth International Conference on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 115, pp. 264-277, Springer-Verlag, Berlin/New York.
17. Milner, R. (1977), Fully abstract models of typed lambda-calculi, Theoret. Comput. Sci. 4, 1-22.
18. Owicki, S. S., and Gries, D. (1976), An axiomatic proof technique for parallel programs, Acta Inform. 6, 319-340.
19. Park, D. (1979), On the semantics of fair parallelism, in "Abstract Software Specifications" (D. Bjøner, Ed.), Lecture Notes in Computer Science, Vol. 86, pp. 504-526, Springer-Verlag, Berlin/New York.
20. Plotkin, G. D. (1977), LCF considered as a programming language, Theoret. Comput. Sci. 5(3), 223-255.
21. Russell, J. R. (1989). Full abstraction for nondeterministic dataflow networks, in "Proceedings of the 30th Annual Symposium on Foundations of Computer Science," pp. 170-177, IEEE Press, New York.
22. Stoughton, A. (1988), "Fully Abstract Models of Programming Languages," Research Notes in Theoretical Computer Science, Pitman, London.