Sciweavers

2797 search results - page 489 / 560
» Code query by example
Sort
View
HOTOS
2003
IEEE
15 years 8 months ago
Palimpsest: Soft-Capacity Storage for Planetary-Scale Services
Distributed writable storage systems typically provide NFS-like semantics and unbounded persistence for files. We claim that for planetary-scale distributed services such facilit...
Timothy Roscoe, Steven Hand
TLDI
2003
ACM
121views Formal Methods» more  TLDI 2003»
15 years 8 months ago
Types for atomicity
Ensuring the correctness of multithreaded programs is difficult, due to the potential for unexpected and nondeterministic interactions between threads. Previous work has addresse...
Cormac Flanagan, Shaz Qadeer
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 7 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu
CTCS
1989
Springer
15 years 7 months ago
Quantitative Domains, Groupoids and Linear Logic
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
Paul Taylor 0002
APLAS
2006
ACM
15 years 6 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt