Sciweavers

1264 search results - page 224 / 253
» Abstract machines for programming language implementation
Sort
View
FLOPS
2004
Springer
13 years 11 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
PADL
2009
Springer
14 years 8 months ago
Ad Hoc Data and the Token Ambiguity Problem
Abstract. PADS is a declarative language used to describe the syntax and semantic properties of ad hoc data sources such as financial transactions, server logs and scientific data ...
Qian Xi, Kathleen Fisher, David Walker, Kenny Qili...
APLAS
2009
ACM
14 years 2 months ago
Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters
Abstract. Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the a...
Rupesh Nasre, Kaushik Rajan, Ramaswamy Govindaraja...
FLOPS
2006
Springer
13 years 11 months ago
Contracts as Pairs of Projections
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
Robert Bruce Findler, Matthias Blume
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...