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 22 Issue 2, March 2000

Incremental analysis of constraint logic programs
Manuel Hermenegildo, German Puebla, Kim Marriott, Peter J. Stuckey
Pages: 187-223
DOI: 10.1145/349214.349216
Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a...

Generation of LR parsers by partial evaluation
Michael Sperber, Peter Thiemann
Pages: 224-264
DOI: 10.1145/349214.349219
The combination of modern programming languages and partial evaluation yields new approaches to old problems. In particular, the combination of functional programming and partial evaluation can turn a general parser into a parser generator. We...

From flop to megaflops: Java for technical computing
José E. Moreira, Samuel P. Midkiff, Manish Gupta
Pages: 265-295
DOI: 10.1145/349214.349222
Although there has been some experimentation with Java as a language for numerically intensive computing, there is a perception by many that the language is unsuited for such work because of performance deficiencies. In this article we show how...

Independence in CLP languages
María García de la Banda, Manuel Hermenegildo, Kim Marriott
Pages: 296-339
DOI: 10.1145/349214.349224
Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in...

Type-based analysis of uncaught exceptions
Xavier Leroy, François Pessaux
Pages: 340-377
DOI: 10.1145/349214.349230
This article presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a nonstandard type system, using rows to approximate both the flow of escaping exceptions (a la...

Compiler techniques for code compaction
Saumya K. Debray, William Evans, Robert Muth, Bjorn De Sutter
Pages: 378-415
DOI: 10.1145/349214.349233
In recent years there has been an increasing trend toward the incorpor ation of computers into a variety of devices where the amount of memory available is limited. This makes it desirable to try to reduce the size of applications where...

Context-sensitive synchronization-sensitive analysis is undecidable
G. Ramalingam
Pages: 416-430
DOI: 10.1145/349214.349241
Static program analysis is concerned with the computation of approximations of the runtime behavior of programs. Precise information about a program's runtime behavior is, in general, uncomputable for various different reasons, and each reason...