Sciweavers

225 search results - page 7 / 45
» From sequential programs to concurrent threads
Sort
View
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 2 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...
TACAS
2010
Springer
156views Algorithms» more  TACAS 2010»
13 years 5 months ago
Preemption Sealing for Efficient Concurrency Testing
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
Thomas Ball, Sebastian Burckhardt, Katherine E. Co...
POPL
2009
ACM
14 years 2 months ago
Speculative N-Way barriers
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
Lukasz Ziarek, Suresh Jagannathan, Matthew Fluet, ...
CHI
2009
ACM
14 years 8 months ago
Toward a unified theory of the multitasking continuum: from concurrent performance to task switching, interruption, and resumpti
Multitasking in user behavior can be represented along a continuum in terms of the time spent on one task before switching to another. In this paper, we present a theory of behavi...
Dario D. Salvucci, Niels Taatgen, Jelmer P. Borst
POPL
2005
ACM
14 years 8 months ago
From sequential programs to multi-tier applications by program transformation
Modern applications are designed in multiple tiers to separate concerns. Since each tier may run at a separate location, middleware is required to mediate access between tiers. Ho...
Matthias Neubauer, Peter Thiemann