1291 search results - page 160 / 259 » Arithmetic program paths |
222
Voted
POPL
2003
ACM
16 years 28 days ago
2003
ACM
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...
118
click to vote
ICFP
2007
ACM
16 years 18 days ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
In 1995, my team and I decided to create an outreach project that would use our research on functional programming to change the K-12 computer science curriculum. We had two diffe...
91
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we propose a new linear programming based timing driven placement framework for high performance designs. Our LP framework is mainly net-based, but it takes advanta...
100
Voted
ASPDAC
2009
ACM
15 years 7 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...