Concurrent programming for the masses (invited address)

Authors:
Mani Chandy
Affiliations:
Department of Computer Sciences, The University of Texas, Austin, Texas
Venue:
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Year:
1985

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The cosmic cube

Communications of the ACM - Special section on computer architecture
The relation between logic programming and logic specification

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Functional programs as executable specifications

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Invariance and non-determinacy

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Language and visualization support for large-scale concurrency

ICSE '88 Proceedings of the 10th international conference on Software engineering
Action systems in incremental and aspect-oriented modeling

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Hi-index	0.00