Sciweavers

681 search results - page 35 / 137
» Superblock formation using static program analysis
Sort
View
SODA
2004
ACM
82views Algorithms» more  SODA 2004»
13 years 10 months ago
Dynamizing static algorithms, with applications to dynamic trees and history independence
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorg...
ICSM
1998
IEEE
14 years 1 months ago
Analysis of Programs with Exception-Handling Constructs
Analysis techniques, such as control-flow, data-flow, and control-dependence, are used for a variety of maintenance tasks, including regression testing, dynamic execution profilin...
Saurabh Sinha, Mary Jean Harrold
ICFP
2002
ACM
14 years 9 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
WCET
2008
13 years 10 months ago
Towards Predicated WCET Analysis
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
Amine Marref, Guillem Bernat
ICSE
2003
IEEE-ACM
14 years 9 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel