705 search results - page 24 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
134
click to vote
PLDI
1995
ACM
15 years 7 months ago
1995
ACM
Correctly predicting the direction that branches will take is increasingly important in today’s wide-issue computer architectures. The name program-based branch prediction is gi...
122
click to vote
SRDS
2007
IEEE
15 years 10 months ago
2007
IEEE
The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, ha...
149
click to vote
CC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
120
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
We present a module calculus for studying a simple model of link-time compilation. The calculus is stratified into a term calculus, a core module calculus, and a linking calculus. ...
120
click to vote
ER
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The development of index structures that allow e cient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been d...