# * Type-Theoretic Models of Concurrency *

## by Walter Rance Cleaveland

1987

Cornell University Ph.D. Thesis

- Tech Report TR87-837 http://hdl.handle.net/1813/6677
- unofficial copies PDF, PS

**Abstract**

Sequential computation has well-understood correctness criteria and proof techniques for verifying programs, but the novelty and complexity of concurrent computation complicates a similar analysis of concurrenct programs. This thesis examines the use of a system for developing formal mathematics, the Nuprl proof development system, as a tool for reasoning about concurrency and ameliorating somewhat the complex chore of analyzing concurrent programs.

**bibTex ref: Cle87**

cite link