193 search results - page 35 / 39 » Reasoning about Memory Layouts |
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
PLDI
2012
ACM
12 years 5 days ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
SAINT
2005
IEEE
14 years 3 months ago
2005
IEEE
The Mobile Internet scenario encourages the design and development of context-aware applications that provide results depending on context information, such as the relative positi...
IADIS
2003
13 years 11 months ago
2003
Distributed data mining (DDM) is the semi-automatic pattern extraction of distributed data sources. The next generation of the data mining studies will be distributed data mining ...
WWW
2003
ACM
14 years 10 months ago
2003
ACM
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...