ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 19

Volume 19, Number 1, January 1997

Susan Horwitz: Precise Flow-Insensitive May-Alias Analysis is NP-Hard. 1-6 BibTeX
Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato: Complementation in Abstract Interpretation. 7-47 BibTeX
Paul Steckler, Mitchell Wand: Lightweight Closure Conversion. 48-86 BibTeX
Andrew K. Wright, Robert Cartwright: A Practical Soft Type System for Scheme. 87-152 BibTeX
Gerald Baumgartner, Vincent F. Russo: Implementing Signatures for C++. 153-187 BibTeX
Brad Calder, Dirk Grunwald, Michael P. Jones, Donald C. Lindsay, James H. Martin, Michael Mozer, Benjamin G. Zorn: Evidence-Based Static Branch Prediction Using Machine Learning. 188-222 BibTeX

Nicholas Pippenger: Pure Versus Impure Lisp. 223-238 BibTeX
Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee: Incremental Computation of Dominator Trees. 239-252 BibTeX
Dennis Dams, Rob Gerth, Orna Grumberg: Abstract Interpretation of Reactive Systems. 253-291 BibTeX
Daniel M. Yellin, Robert E. Strom: Protocol Specifications and Component Adaptors. 292-333 BibTeX
Patrick M. Sansom, Simon L. Peyton Jones: Formally Based Profiling for Higher-Order Functional Languages. 334-385 BibTeX
Jin Yang, Aloysius K. Mok, Farn Wang: Symboloc Model Checking for Event-Driven Real-Time Systems. 386-412 BibTeX

Charles L. A. Clarke, Gordon V. Cormack: On the Use of Regular Expressions for Searching Text. 413-426 BibTeX
Dexter Kozen: Kleene Algebra with Tests. 427-443 BibTeX
Zhenjiang Hu, Hideya Iwasaki, Masato Takeichi: Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms. 444-461 BibTeX
Keshav Pingali, Gianfranco Bilardi: Optimal Control Dependence Computation and the Roman Chariots Problem. 462-491 BibTeX
Norman Ramsey, Mary F. Fernandez: Specifying Representations of Machine Instructions. 492-524 BibTeX
Richard Gerber, Seongsoo Hong: Slicing Real-Time Programs for Enhanced Schedulability. 525-555 BibTeX

Paul Havlak: Nesting of Reducible and Irreducible Loops. 557-567 BibTeX
Saumya K. Debray, Todd A. Proebsting: Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization. 568-585 BibTeX
Peter T. Breuer, Carlos Delgado Kloos, Andrés Marín López, Natividad Martínez Madrid, Luis Sánchez Fernández: A Refinement Calculus for the Synthesis of Verified Hardware Descriptions in VHDL. 585-616 BibTeX
E. Allen Emerson, A. Prasad Sistla: Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach. 617-638 BibTeX

Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering: Toward a Complete Transformational Toolkit for Compilers. 639-684 BibTeX
Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi: Proving Concurrent Constraint Programs Correct. 685-725 BibTeX
Edmund M. Clarke, Orna Grumberg, Somesh Jha: Verifying Parameterized Networks. 726-750 BibTeX
Thomas P. Jensen: Disjunctive Program Analysis for Algebraic Data Types. 751-803 BibTeX
Peter Van Roy, Seif Haridi, Per Brand, Gert Smolka, Michael Mehl, Ralf Scheidhauer: Mobile Objects in Distributed Oz. 804-851 BibTeX

Soo-Mook Moon, Kemal Ebcioglu: Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining. 853-898 BibTeX
N. Raja, R. K. Shyamasundar: Combinatory Formaulations of Concurrent Languages. 899-915 BibTeX
Amr Sabry, Philip Wadler: A Reflection on Call-by-Value. 916-941 BibTeX
Martin C. Rinard, Pedro C. Diniz: Commutativity Analysis: A New Analysis Technique for Parallelizing Compilers. 942-991 BibTeX
Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa: A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis. 992-1030 BibTeX
Johan Janssen, Henk Corporaal: Making Graphs Reducible with Controlled Node Splitting. 1031-1052 BibTeX
Deborah Whitfield, Mary Lou Soffa: An Approach for Exploring Code-Improving Transformations. 1053-1084 BibTeX
Ting Yu, Owen Kaser: A Note on "On the Conversion of Indirect to Direct Recursion". 1085-1087 BibTeX