Sciweavers

41 search results - page 1 / 9
» From Interpreting to Compiling Binding Times
Sort
View
ESOP
1990
Springer
13 years 8 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy
PEPM
1994
ACM
13 years 8 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
LOPSTR
1992
Springer
13 years 8 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf
AOSD
2008
ACM
13 years 6 months ago
Edicts: implementing features with flexible binding times
In a software product line, the binding time of a feature is the time at which one decides to include or exclude a feature from a product. Typical binding site implementations are...
Venkat Chakravarthy, John Regehr, Eric Eide
SP
2005
IEEE
188views Security Privacy» more  SP 2005»
13 years 10 months ago
BIND: A Fine-Grained Attestation Service for Secure Distributed Systems
In this paper, we propose BIND (Binding Instructions aNd Data),1 a fine-grained attestation service for securing distributed systems. Code attestation has recently received consi...
Elaine Shi, Adrian Perrig, Leendert van Doorn