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
• Agostino Cortesi, Gilberto Filé, Roberto Giacobazzi, Catuscia Palamidessi, Francesco Ranzato: Complementation in Abstract Interpretation. 7-47
• Paul Steckler, Mitchell Wand: Lightweight Closure Conversion. 48-86
• Andrew K. Wright, Robert Cartwright: A Practical Soft Type System for Scheme. 87-152
• Gerald Baumgartner, Vincent F. Russo: Implementing Signatures for C++. 153-187
• 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

Volume 19, Number 2, March 1997

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

Volume 19, Number 3, May 1997

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

Volume 19, Number 4, July 1997

• Paul Havlak: Nesting of Reducible and Irreducible Loops. 557-567
• Saumya K. Debray, Todd A. Proebsting: Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization. 568-585
• 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
• E. Allen Emerson, A. Prasad Sistla: Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach. 617-638

Volume 19, Number 5, September 1997

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

Volume 19, Number 6, November 1997

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