Interpretation (AI) • AI: semantics based method for static program analysis • Basic idea of AI: Perform the program's computations using value descriptions or abstract value in place of the concrete values • Basic idea in WCET: Derive timing information from an approximation of the “collecting semantics” (for all inputs) • AI supports correctness proofs • Tool support (PAG)

The Challenger crash was a highly visible event whose underlying cause was not publicly revealed until much later. Methodologically, the event has appealing features. It was an exogenous occurrence. There was no leakage that induced run-up or run-down in the pre-event period. Our basic analysis provides a test of market efficiency. How quickly and accurately did the stock market process the imp...

Problem statement: As technology scales down, the integration density of transistors increases and most of the power is dissipated as leakage. Leakage power reduction is achieved in Static Random Access Memory (SRAM) cells by increasing the source voltage (source biasing) of the SRAM array. Another promising issue in nanoscaled devices is the process parameter variations. Due to these variation...

Violating a program’s semantics for fun and profit is a time honored hacker tradition. Compilers defend against such fiends by inserting run-time checks to enforce semantic safety properties. Safe language compilers insert type checks for down-casts, information flow compilers [11] add run-time checks to prevent information leakage, and tools like SAFECode [8], WIT [1], and DFI [6] insert run-t...

Current parallelizing compilers cannot extract a significant fraction of the available parallelism in a loop if it has a complex and/or statically insuficiently defined access pattern. In this paper, a run-time technique based on insp/exec scheme (inspector phase and executor phase) is proposed for finding parallelism on loops. Our inspector can determine the wavefronts of a loop with any compl...

Run time code generation is an alternative and complement to compile time program analysis and optimization Static analyses are inherently imprecise because most interesting aspects of run time behavior are uncomputable By defer ring aspects of compilation to run time more precise infor mation about program behavior can be exploited leading to greater opportunities for code improvement The cost...