Sciweavers

5056 search results - page 476 / 1012
» Network Coding Theory
Sort
View
POPL
2009
ACM
16 years 5 months ago
Relaxed memory models: an operational approach
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...
Gérard Boudol, Gustavo Petri
134
Voted
OSDI
2008
ACM
16 years 5 months ago
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
15 years 11 months ago
Increasing the Gap between Descriptional Complexity and Algorithmic Probability
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
Adam R. Day
FM
2009
Springer
157views Formal Methods» more  FM 2009»
15 years 11 months ago
Symbolic Predictive Analysis for Concurrent Programs
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
Chao Wang, Sudipta Kundu, Malay K. Ganai, Aarti Gu...
AGILEDC
2007
IEEE
15 years 11 months ago
Agile Development Iterations and UI Design
Many agile projects require user interaction (UI) design, but the integration of UI design into agile development is not well understood. This is because both agile development an...
Jennifer Ferreira, James Noble, Robert Biddle