1452 search results - page 69 / 291 » Algorithmic Analysis of Array-Accessing Programs |
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
IWMM
2009
Springer
14 years 4 months ago
2009
Springer
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
ICSM
1994
IEEE
14 years 2 months ago
1994
IEEE
Although data pow analysis was first developed for use in compilers, its usefulness is now recognized in many software tools. Because of its compiler origins, the computation of d...
SAS
2001
Springer
14 years 2 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...