906 search results - page 116 / 182 » Linking Theories of Concurrency |
138
click to vote
STOC
1993
ACM
15 years 1 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
159
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
To access data sources on the Web, a crucial step is wrapping, which translates query responses, rendered in textual HTML, back into their relational form. Traditionally, this pro...
197
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
OSDI
2008
ACM
15 years 10 months ago
2008
ACM
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...