Sciweavers

12 search results - page 2 / 3
» Slicing Programs with Arbitrary Control-flow
Sort
View
PLDI
1994
ACM
13 years 9 months ago
The Program Structure Tree: Computing Control Regions in Linear Time
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
Richard Johnson, David Pearson, Keshav Pingali
IEEEINTERACT
2003
IEEE
13 years 11 months ago
Compiler Support for Dynamic Speculative Pre-Execution
Speculative pre-execution is a promising prefetching technique which uses an auxiliary assisting thread in addition to the main program flow. A prefetching thread (p-thread), whic...
Won Woo Ro, Jean-Luc Gaudiot
ASPLOS
2008
ACM
13 years 7 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
FM
2009
Springer
124views Formal Methods» more  FM 2009»
14 years 10 days ago
Reasoning about Memory Layouts
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
Holger Gast
CMPB
2004
132views more  CMPB 2004»
13 years 5 months ago
Design and implementation of software for assembly and browsing of 3D brain atlases
: Visualization software for three dimensional digital brain atlases present many challenges in design and implementation. These challenges include the design of an effective human...
Carl Gustafson, Oleh J. Tretiak, Louise Bertrand, ...