4385 search results - page 59 / 877 » Abstraction for Concurrent Objects |
ICTAC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
80
Voted
COMPSAC
2007
IEEE
15 years 5 months ago
2007
IEEE
Various program analysis techniques are efficient at discovering failures and properties. However, it is often difficult to evaluate results, such as program traces. ls for abst...
90
Voted
LCPC
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we present an implementation of May Happen in Parallel analysis for Java that attempts to address some of the practical implementation concerns of the origi...
PPL
2007
14 years 10 months ago
2007
Abstract. List-based implementations of sets are a fundamental building block of many concurrent algorithms. A skiplist based on the lock-free list-based set algorithm of Michael w...
99
Voted
LICS
2009
IEEE
15 years 5 months ago
2009
IEEE
mantics Is Fully Abstract∗ Sumit Nain and Moshe Y. Vardi Rice University, Department of Computer Science Houston, TX 77005-1892, USA The discussion in the computer-science liter...