Much has been learned in the last decade about concurrent programming.. This patmr
identifies the major concepts of concurrent programming and describes some of the more …

Algorithms and data structures developed to solve graph problems on parallel computers
are surveyed. The problems discussed relate to searching graphs and finding connected …

Rust's type system ensures memory safety: well-typed Rust programs are guaranteed to not
exhibit problems such as dangling pointers, data races, and unexpected side effects through …

The concept of one event happening before another in a distributed system is examined,
and is shown to define a partial ordering of the events. A distributed algorithm is given for …

Reliable computer systems must handle malfunctioning components that give conflicting
information to different parts of the system. This situation can be expressed abstractly in …

A unified approach to program verification is suggested, which applies to both sequential
and parallel programs. The main proof method suggested is that of temporal reasoning in …

A concurrent object is a data object shared by concurrent processes. Linearizability is a
correctness condition for concurrent objects that exploits the semantics of abstract data …

Recent archaeological discoveries on the island of Paxos reveal that the parliament
functioned despite the peripatetic propensity of its part-time legislators. The legislators …

In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have
developed an extension of Hoare logic that permits reasoning about low-level imperative …

Many large sequential computers execute operations in a different order than is specified by
the program. A correct execution is achieved if the results produced are the same as would …