Sciweavers

4469 search results - page 353 / 894
» Dynamic Program Slicing
Sort
View
106
Voted
ESOP
1990
Springer
15 years 6 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
126
Voted
DAGSTUHL
2001
15 years 4 months ago
Visualizing Memory Graphs
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
Thomas Zimmermann, Andreas Zeller
ENTCS
2007
100views more  ENTCS 2007»
15 years 2 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
122
Voted
SCAM
2006
IEEE
15 years 8 months ago
SMART C: A Semantic Macro Replacement Translator for C
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
Matthew Jacobs, E. Christopher Lewis
133
Voted
DAGSTUHL
1996
15 years 3 months ago
Pragmatics of Type-Directed Partial Evaluation
Abstract. Type-directed partial evaluation stems from the residualization of arbitrary static values in dynamic contexts, given their type. Its algorithm coincides with the one for...
Olivier Danvy