Sciweavers

494 search results - page 56 / 99
» Static Analysis for Guarded Code
Sort
View
POPL
2011
ACM
12 years 11 months ago
Precise reasoning for programs using containers
Containers are general-purpose data structures that provide functionality for inserting, reading, removing, and iterating over elements. Since many applications written in modern ...
Isil Dillig, Thomas Dillig, Alex Aiken
POPL
2003
ACM
14 years 9 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
CASES
2006
ACM
14 years 2 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
ICCAD
2001
IEEE
128views Hardware» more  ICCAD 2001»
14 years 5 months ago
An Assembly-Level Execution-Time Model for Pipelined Architectures
The aim of this work is to provide an elegant and accurate static execution timing model for 32-bit microprocessor instruction sets, covering also inter–instruction effects. Suc...
Giovanni Beltrame, Carlo Brandolese, William Forna...
GPCE
2004
Springer
14 years 2 months ago
Splice: Aspects That Analyze Programs
This paper describes Splice, a system for writing aspects that perform static program analyses to direct program modifications. The power of an inter-procedural data-flow analys...
Sean McDirmid, Wilson C. Hsieh