Sciweavers

8109 search results - page 1144 / 1622
» A Model of Component-Based Programming
Sort
View
POPL
2009
ACM
16 years 1 months ago
Language constructs for transactional memory
Transactional memory (TM) provides a safer, more modular, and more scalable alternative to traditional lock-based synchronization. Implementing high performance TM systems has rec...
Tim Harris
178
Voted
SAC
2009
ACM
16 years 1 months ago
Integrating standardized transaction protocols in service-oriented wireless sensor networks
Despite much research in the area of wireless sensor networks in recent years, the programming of sensor nodes is still time-consuming and tedious. A new paradigm which seems to b...
Christoph Reinke, Nils Hoeller, Jana Neumann, Sven...
172
Voted
FOSSACS
2009
Springer
16 years 1 months ago
Beyond Shapes: Lists with Ordered Data
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
Kshitij Bansal, Rémi Brochenin, Étie...
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
16 years 1 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
172
Voted
IISWC
2009
IEEE
16 years 1 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss
« Prev « First page 1144 / 1622 Last » Next »