Sciweavers

365 search results - page 38 / 73
» Types for Safe Locking
Sort
View
PPOPP
2006
ACM
14 years 2 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...
OOPSLA
2010
Springer
13 years 7 months ago
Back to the futures: incremental parallelization of existing sequential runtime systems
Many language implementations, particularly for high-level and scripting languages, are based on carefully honed runtime systems that have an internally sequential execution model...
James Swaine, Kevin Tew, Peter A. Dinda, Robert Br...
ECOOPW
1999
Springer
14 years 1 months ago
Systematic Change Impact Determination in Complex Object Database Schemata
Impact analysis is seen as an important technique for controlling the evolution of software systems. Numerous approaches have been proposed which aim to assess the impact of chang...
Simon Lock, Awais Rashid, Peter Sawyer, Gerald Kot...
SIGMOD
1995
ACM
119views Database» more  SIGMOD 1995»
14 years 12 days ago
A Critique of ANSI SQL Isolation Levels
: ANSI SQL-92 [MS, ANSI] defines Isolation Levels in terms of phenomena: Dirty Reads, Non-Repeatable Reads, and Phantoms. This paper shows that these phenomena and the ANSI SQL def...
Hal Berenson, Philip A. Bernstein, Jim Gray, Jim M...
CADE
2006
Springer
14 years 9 months ago
Eliminating Redundancy in Higher-Order Unification: A Lightweight Approach
In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show...
Brigitte Pientka