Sciweavers

1499 search results - page 169 / 300
» Chopping Concurrent Programs
Sort
View
CAV
2009
Springer
105views Hardware» more  CAV 2009»
14 years 11 months ago
Transactional Memory: Glimmer of a Theory
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...
Rachid Guerraoui, Michal Kapalka
CADE
2008
Springer
14 years 10 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
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...
Hasan Amjad, Richard Bornat
UM
2007
Springer
14 years 4 months ago
Conversations Amidst Computing: A Study of Interruptions and Recovery of Task Activity
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...
Shamsi T. Iqbal, Eric Horvitz
IPPS
2003
IEEE
14 years 3 months ago
Towards a Theory of Bisimulation for a Fragment of Verilog
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...
Li Yongjian, Jifeng He
WOTUG
2008
13 years 12 months ago
Representation and Implementation of CSP and VCR Traces
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...
Neil C. C. Brown, Marc L. Smith