Table of contents for issues of ACM Letters on Programming Languages and Systems

Last update: Thu Nov 3 12:38:57 MDT 2022                Valid HTML 3.2!

Volume 1, Number 1, March, 1992
Volume 1, Number 2, June, 1992
Volume 1, Number 3, September, 1992
Volume 1, Number 4, December, 1992
Volume 2, Number 4, March, 1993


ACM Letters on Programming Languages and Systems
Volume 1, Number 1, March, 1992

             Preston Briggs and   
            Keith D. Cooper and   
                  Linda Torczon   Coloring register pairs  . . . . . . . . 3--13
              Michael Burke and   
                 Jong-Deok Choi   Precise and efficient integration of
                                  interprocedural alias information into
                                  data-flow analysis . . . . . . . . . . . 14--21
            Keith D. Cooper and   
               Mary W. Hall and   
                  Linda Torczon   Unexpected side effects of inline
                                  substitution: a case study . . . . . . . 22--32
             Vincent Dornic and   
            Pierre Jouvelot and   
               David K. Gifford   Polymorphic time systems for estimating
                                  program complexity . . . . . . . . . . . 33--45
               Ralph E. Johnson   Reducing the latency of a real-time
                                  garbage collector  . . . . . . . . . . . 46--58
             Bruce McKenney and   
          Boleslaw K. Szymanski   Generating parallel code for SIMD
                                  machines . . . . . . . . . . . . . . . . 59--73
        Robert H. B. Netzer and   
               Barton P. Miller   What are race conditions?: Some issues
                                  and formalizations . . . . . . . . . . . 74--88
                 Ambuj K. Singh   On reasoning with the global time
                                  assumption . . . . . . . . . . . . . . . 89--103

ACM Letters on Programming Languages and Systems
Volume 1, Number 2, June, 1992

              Jonathan M. Asuru   Optimization of array subscript range
                                  checks . . . . . . . . . . . . . . . . . 109--118
            Suzanne W. Dietrich   Shortest path by approximation in logic
                                  programs . . . . . . . . . . . . . . . . 119--137
                 David Goldberg   The design of floating-point data types  138--151
             Carl McConnell and   
               Ralph E. Johnson   Using static single assignment form in a
                                  code optimizer . . . . . . . . . . . . . 152--160
              David Tarditi and   
                  Peter Lee and   
                 Anurag Acharya   No assembly required: compiling standard
                                  ML to C  . . . . . . . . . . . . . . . . 161--177
                  Michael Weiss   The transitive closure of control
                                  dependence: the iterated join  . . . . . 178--190

ACM Letters on Programming Languages and Systems
Volume 1, Number 3, September, 1992

              Olivier Danvy and   
                  John Hatcliff   CPS-transformation after strictness
                                  analysis . . . . . . . . . . . . . . . . 195--212
      Christopher W. Fraser and   
            David R. Hanson and   
             Todd A. Proebsting   Engineering a simple, efficient
                                  code-generator generator . . . . . . . . 213--226
               Mary W. Hall and   
                    Ken Kennedy   Efficient call graph analysis  . . . . . 227--242
              Joseph Hummel and   
          Laurie J. Hendren and   
              Alexandru Nicolau   Abstract description of pointer data
                                  structures: an approach for improving
                                  the analysis and optimization of
                                  imperative programs  . . . . . . . . . . 243--260
                   William Pugh   Definitions of dependence distance . . . 261--265
            Balkrishna Ramkumar   Distributed last call optimization for
                                  portable parallel logic programming  . . 266--283
             Kenneth Walker and   
              Ralph E. Griswold   The maintenance of intermediate values
                                  in goal-directed evaluation  . . . . . . 284--298

ACM Letters on Programming Languages and Systems
Volume 1, Number 4, December, 1992

             Peter Fritzson and   
            Nahid Shahmehri and   
              Mariam Kamkar and   
                 Tibor Gyimothy   Generalized algorithmic debugging and
                                  testing  . . . . . . . . . . . . . . . . 303--322
                  William Landi   Undecidability of static analysis  . . . 323--337
           Kelvin D. Nilsen and   
             William J. Schmidt   Cost-effective object space management
                                  for hardware-assisted real-time garbage
                                  collection . . . . . . . . . . . . . . . 338--354
             Amitabh Srivastava   Unreachable procedures in
                                  object-oriented programming  . . . . . . 355--364


ACM Letters on Programming Languages and Systems
Volume 2, Number 4, March, 1993

                    Thomas Ball   What's in a region?: or computing
                                  control dependence regions in
                                  near-linear time for reducible control
                                  flow . . . . . . . . . . . . . . . . . . 1--16
                Mike Beaven and   
                 Ryan Stansifer   Explaining type errors in polymorphic
                                  languages  . . . . . . . . . . . . . . . 17--30
                  David Binkley   Precise executable interprocedural
                                  slices . . . . . . . . . . . . . . . . . 31--45
              Hans-J. Boehm and   
             Alan J. Demers and   
                    Chris Uhler   Implementing multiple locks using
                                  Lamport's mutual exclusion algorithm . . 46--58
             Preston Briggs and   
                  Linda Torczon   An efficient representation for sparse
                                  sets . . . . . . . . . . . . . . . . . . 59--69
             Peter Bumbulis and   
                Donald D. Cowan   RE2C: a more versatile scanner generator 70--84
              Robert D. Cameron   Extending context-free grammars with
                                  permutation phrases  . . . . . . . . . . 85--94
             Alok Choudhary and   
               Geoffrey Fox and   
          Seema Hiranandani and   
                Ken Kennedy and   
            Charles Koelbel and   
               Sanjay Ranka and   
                 Chau-Wen Tseng   Unified compilation of Fortran 77D and
                                  90D  . . . . . . . . . . . . . . . . . . 95--114
                   Mark Day and   
             Barbara Liskov and   
           Umesh Maheshwari and   
                Andrew C. Myers   References to remote mobile objects in
                                  Thor . . . . . . . . . . . . . . . . . . 115--126
           Richard A. Eyre-Todd   The detection of dangling references in
                                  C++ programs . . . . . . . . . . . . . . 127--134
                    Rajiv Gupta   Optimizing array bound checks using flow
                                  analysis . . . . . . . . . . . . . . . . 135--150
                 Owen Kaser and   
         C. R. Ramakrishnan and   
                 Shaunak Pawagi   On the conversion of indirect to direct
                                  recursion  . . . . . . . . . . . . . . . 151--164
                 James R. Larus   Compiling for shared-memory and
                                  message-passing computers  . . . . . . . 165--180
               Kim Marriott and   
      Harald Sòndergaard   Precise and efficient groundness
                                  analysis for logic programs  . . . . . . 181--196
               Kim Marriott and   
               Peter J. Stuckey   Semantics of constraint logic programs
                                  with optimization  . . . . . . . . . . . 197--212
             Robert Metzger and   
                    Sean Stroud   Interprocedural constant propagation: an
                                  empirical study  . . . . . . . . . . . . 213--232
               Xiaolei Qian and   
                 Allen Goldberg   Referential opacity in nondeterministic
                                  data refinement  . . . . . . . . . . . . 233--241