681 search results - page 80 / 137 » Superblock formation using static program analysis |
147
Voted
ENTCS
2002
15 years 4 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
132
Voted
ADAEUROPE
2004
Springer
15 years 10 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
159
Voted
CCS
2009
ACM
15 years 9 months ago
2009
ACM
Despite the many efforts made in recent years to mitigate runtime attacks such as stack and heap based buffer overflows, these attacks are still a common security concern in today...
150
click to vote
PLDI
1994
ACM
15 years 9 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
121
click to vote
ACG
2006
Springer
15 years 11 months ago
2006
Springer
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an...