SIAMCOMP
2000
13 years 4 months ago
2000
This paper describes a scheme to implement a shared address space of size m on an n-node mesh, with m polynomial in n, where each mesh node hosts a processor and a memory module. A...
POPL
1990
ACM
13 years 8 months ago
1990
ACM
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
EURODAC
1994
IEEE
13 years 8 months ago
1994
IEEE
A set of concurrent processes communicating through shared variables is an often used model for hardware systems. This paper presents three modeling techniques for representing su...
FM
1999
Springer
13 years 8 months ago
1999
Springer
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...
CAV
2007
Springer
13 years 10 months ago
2007
Springer
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...