Search Sciweavers | Sciweavers

Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...

Anthony Discolo, Tim Harris, Simon Marlow, Simon L...

claim paper

Read More »

142

click to vote

FOSSACS
2006
Springer

133views Software Engineering» more FOSSACS 2006»

A Logic of Reachable Patterns in Linked Data-Structures

15 years 7 months ago

Download www.cs.tau.ac.il

We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...

Greta Yorsh, Alexander Moshe Rabinovich, Mooly Sag...

claim paper

Read More »

136

click to vote

IPPS
2000
IEEE

95views Distributed And Parallel Com...» more IPPS 2000»

Power-Aware Replication of Data Structures in Distributed Embedded Real-Time Systems

15 years 7 months ago