ACM Letters on Programming Languages and Systems (LOPLAS), Volume 2

Volume 2, Numbers 1-4, March-December 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, Ryan Stansifer:
  Explaining Type Errors In Polimorphic Languages. 17-30
  
• David Binkley:
  Precise Executable Interprocedural Slices. 31-45
  
• Hans-Juergen Boehm, Alan J. Demers, Christ Uhler:
  Implementing Multiple Locks Using Lamport's Mutual Exclusion Algorithm. 46-58
  
• Preston Briggs, Linda Torczon:
  An Efficient Representation for Sparse Sets. 59-69
  
• Peter Bumbulis, Donald D. Cowan:
  RE2C: A More Versatile Scanner Generator. 70-84
  
• Robert D. Cameron:
  Extending Context-Free Grammars with Permutation Phrases. 85-94
  
• Alok N. Choudhary, Geoffrey Fox, Seema Hiranandani, Ken Kennedy, Charles Koelbel, Sanjay Ranka, Chau-Wen Tseng:
  Unified Compilation of Fortran 77D and 90D. 95-114
  
• Mark Day, Barbara Liskov, Umesh Maheshwari, 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, C. R. Ramakrishnan, 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, Harald Søndergaard:
  Precise and Efficient Groundness Analysis for Logic Programs. 181-196
  
• Kim Marriott, Peter J. Stuckey:
  Semantics of Constraint Logic Programs with Optimization. 197-212
  
• Robert Metzger, Sean Stroud:
  Interprocedural Constant Propagation: An Empirical Study. 213-232
  
• Xiaolei Qian, Allen Goldberg:
  Referential Opacity In Nondeterministic Data Refinement. 233-241