ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 23 Issue 6, November 2001

A framework for call graph construction algorithms
David Grove, Craig Chambers
Pages: 685-746
DOI: 10.1145/506315.506316
A large number of call graph construction algorithms for object-oriented and functional languages have been proposed, each embodying different tradeoffs between analysis cost and call graph precision. In this article we present a unifying framework...

Efficient Java RMI for parallel programming

Pages: 747-775
DOI: 10.1145/506315.506317
Java offers interesting opportunities for parallel computing. In particular, Java Remote Method Invocation (RMI) provides a flexible kind of remote procedure call (RPC) that supports polymorphism. Sun's RMI implementation achieves this kind of...

Lessons learned about one-way, dataflow constraints in the Garnet and Amulet graphical toolkits
Bradley T. Vander Zanden, Richard Halterman, Brad A. Myers, Rich McDaniel, Rob Miller, Pedro Szekely, Dario A. Giuse, David Kosbie
Pages: 776-796
DOI: 10.1145/506315.506318
One-way, dataflow constraints are commonly used in graphical interface toolkits, programming environments, and circuit applications. Previous papers on dataflow constraints have focused on the design and implementation of individual algorithms. In...