Sciweavers

PLDI
2000
ACM
15 years 10 months ago
Field analysis: getting useful and low-cost interprocedural information
We present a new limited form of interprocedural analysis called field analysis that can be used by a compiler to reduce the costs of modern language features such as objectorien...
Sanjay Ghemawat, Keith H. Randall, Daniel J. Scale...
PLDI
2000
ACM
15 years 10 months ago
Type-based race detection for Java
This paper presents a static race detection analysis for multithreaded Java programs. Our analysis is based on a formal type system that is capable of capturing many common synchr...
Cormac Flanagan, Stephen N. Freund
PLDI
2000
ACM
15 years 10 months ago
Dynamo: a transparent dynamic optimization system
We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stre...
Vasanth Bala, Evelyn Duesterwald, Sanjeev Banerjia
PLDI
2000
ACM
15 years 10 months ago
ABCD: eliminating array bounds checks on demand
Rastislav Bodík, Rajiv Gupta, Vivek Sarkar
ICFP
2000
ACM
15 years 10 months ago
Static enforcement of security with types
A number of security systems for programming languages have recently appeared, including systems for enforcing some form of ac
Christian Skalka, Scott F. Smith
ICFP
2000
ACM
15 years 10 months ago
Understanding memory allocation of scheme programs
Manuel Serrano, Hans-Juergen Boehm
ICFP
2000
ACM
15 years 10 months ago
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ÁÒ Ø × Ô Ô Ö Û ÔÖÓÔÓ× Ò Û Ñ Ø Ó ÓÖ Ö Ú Ò ÔÖ Ø ¹ Ð Ð Ò Ö¹Ø Ñ Ð ÓÖ Ø Ñ ÖÓÑ Ø ×Ô ¬ Ø ÓÒ Ó Ñ Ü ÑÙÑ¹Û Ø×ÙÑ ÔÖÓ Ð Ñ Ö...
Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhi...