Sciweavers

5 search results - page 1 / 1
» Staged allocation: a compositional technique for specifying ...
Sort
View
POPL
2006
ACM
14 years 9 months ago
Staged allocation: a compositional technique for specifying and implementing procedure calling conventions
We present staged allocation, a technique for specifying calling conventions by composing tiny allocators called stages. A specification written using staged allocation has a prec...
Reuben Olinsky, Christian Lindig, Norman Ramsey
CC
2004
Springer
163views System Software» more  CC 2004»
14 years 2 months ago
Declarative Composition of Stack Frames
When a compiler translates a procedure, it must lay out the procedure’s stack frame in a way that respects the calling convention. Many compilers respect the convention either by...
Christian Lindig, Norman Ramsey
NFM
2011
252views Formal Methods» more  NFM 2011»
13 years 4 months ago
Call Invariants
Program verifiers based on first-order theorem provers model the program heap as a collection of mutable maps. In such verifiers, preserving unmodified facts about the heap acr...
Shuvendu K. Lahiri, Shaz Qadeer
ICS
2007
Tsinghua U.
14 years 3 months ago
GridRod: a dynamic runtime scheduler for grid workflows
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
Shahaan Ayyub, David Abramson
PLDI
2003
ACM
14 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers