Transactional memory (TM) is a promising paradigm for concurrent programming. This paper is an overview of our recent theoretical work on defining a theory of TM. We first recall s...
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
We present results from a field study investigating the influence of conversations on the multitasking behavior of computer users. We report on several findings, including the timi...
In this paper, we have developed an operational semantic framework for a non-trival subset of Verilog which features event–driven computation, shared variable concurrency. The b...
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...