2. POPL 1975: Palo Alto, California

• Amelia C. Fong, John B. Kam, Jeffrey D. Ullman:
  Application of Lattice Algebra to Loop Optimization. 1-9
  
• Ken Kennedy:
  Node Listings Applied to Data Flow Analysis. 10-21
  
• Susan L. Graham, Mark N. Wegman:
  A Fast and Usually Linear Algorithm for Global Flow Analysis. 22-34
  
• Jacob T. Schwartz:
  Automatic Data Structure Choice in a Language of Very High Level. 36-40
  
• George T. Ligler:
  A Mathematical Approach to Language Design. 41-53
  
• Susan L. Gerhart:
  Correctness-Preserving Program Transformations. 54-66
  
• Irene Greif, Carl Hewitt:
  Actor Semantics of Planner-73. 67-77
  
• Richard J. Lipton:
  Reduction: A New Method of Proving Properties of Systems of Processes. 78-86
  
• Ellis S. Cohen:
  A Semantic Model for Parallel Systems with Scheduling. 87-94
  
• Peter E. Lauer, Roy H. Campbell:
  A Description of Path Expressions by Petri Nets. 95-105
  
• Neil D. Jones, Steven S. Muchnick:
  Even Simple Programs are Hard to Analyze. 106-118
  
• Mehdi Jazayeri, William F. Ogden, William C. Rounds:
  On the Complexity of the Circularity Test for Attribute Grammars. 119-129
  
• Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
  On the Complexity of LR(k) Testing. 130-136
  
• Peter Naur:
  Programming Languages, Natural Languages, and Mathematics. 137-148
  
• Marvin H. Solomon:
  Modes, Values, and Expressions. 149-159
  
• Stephen A. Cook, Derek C. Oppen:
  An Assertion Language for Data Structures. 160-166
  
• Glenn F. Stewart:
  An Algebraic Model for String Patterns. 167-184
  
• Bruce P. Lester:
  Program Schemas with Concurrency: Execution Time and Hangups. 185-193
  
• D. M. Symes:
  New Control Structures to Aid Gotolessness. 194-203
  
• John B. Goodenough:
  Structured Exception Handling. 204-224
  
• Patrick A. V. Hall, Peter Hitchcock, Stephen Todd:
  An Algebra of Relations for Machine Computation. 225-232
  
• Martin Mikelsons:
  Computer Assisted Application Definition. 233-242