Sciweavers

309 search results - page 50 / 62
» Model checking transactional memories
Sort
View
ICALP
1994
Springer
14 years 1 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
ISPASS
2007
IEEE
14 years 4 months ago
Complete System Power Estimation: A Trickle-Down Approach Based on Performance Events
This paper proposes the use of microprocessor performance counters for online measurement of complete system power consumption. While past studies have demonstrated the use of per...
W. Lloyd Bircher, Lizy K. John
SIGSOFT
2006
ACM
14 years 10 months ago
Local analysis of atomicity sphere for B2B collaboration
Atomicity is a desirable property for business processes to conduct transactions in Business-to-Business (B2B) collaboration. Although it is possible to reason about atomicity of ...
Chunyang Ye, S. C. Cheung, W. K. Chan, Chang Xu
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 4 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...
POPL
2006
ACM
14 years 10 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...