Sciweavers

365 search results - page 32 / 73
» Types for Safe Locking
Sort
View
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
14 years 1 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
CSL
2009
Springer
14 years 8 days ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...
ICFP
2002
ACM
14 years 8 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 9 months ago
Towards Parameterized Regular Type Inference Using Set Constraints
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...
Francisco Bueno, Jorge A. Navas, Manuel V. Hermene...
JLP
2008
134views more  JLP 2008»
13 years 8 months ago
Backwards type analysis of asynchronous method calls
Asynchronous method calls have been proposed to better integrate object orientation with distribution. In the Creol language, asynchronous method calls are combined with so-called...
Einar Broch Johnsen, Ingrid Chieh Yu