Sciweavers

184 search results - page 19 / 37
» Integer Polyhedra for Program Analysis
Sort
View
PLDI
2003
ACM
14 years 3 months ago
Predicting whole-program locality through reuse distance analysis
Profiling can accurately analyze program behavior for select data inputs. We show that profiling can also predict program locality for inputs other than profiled ones. Here loc...
Chen Ding, Yutao Zhong
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 10 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
CADE
2005
Springer
14 years 10 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CHES
2007
Springer
118views Cryptology» more  CHES 2007»
14 years 2 months ago
AES Encryption Implementation and Analysis on Commodity Graphics Processing Units
Graphics Processing Units (GPUs) present large potential performance gains within stream processing applications over the standard CPU. These performance gains are best realised wh...
Owen Harrison, John Waldron
VLSID
1994
IEEE
124views VLSI» more  VLSID 1994»
14 years 2 months ago
ILP-Based Scheduling with Time and Resource Constraints in High Level Synthesis
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
Samit Chaudhuri, Robert A. Walker