4716 search results - page 176 / 944 » Iterative-free program analysis |
204
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
125
Voted
GECCO
2007
Springer
15 years 8 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...
ICSE
2010
IEEE-ACM
15 years 7 months ago
2010
IEEE-ACM
Program differencing tools such as GNU diff identify individual differences but do not determine how those differences are related to each other. For example, an extract super...
123
Voted
ICSE
2010
IEEE-ACM
15 years 6 months ago
2010
IEEE-ACM
Concurrency is inherent in today’s software. Unexpected interactions between concurrently executing threads often cause subtle bugs in concurrent programs. Such bugs are hard to...
99
Voted
APSEC
2004
IEEE
15 years 6 months ago
2004
IEEE
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...