Abstract is missing.
- Application of Lattice Algebra to Loop OptimizationAmelia C. Fong, John B. Kam, Jeffrey D. Ullman. 1-9
- Node Listings Applied to Data Flow AnalysisKen Kennedy. 10-21
- A Fast and Usually Linear Algorithm for Global Flow AnalysisSusan L. Graham, Mark N. Wegman. 22-34
- Automatic Data Structure Choice in a Language of Very High LevelJacob T. Schwartz. 36-40
- Correctness-Preserving Program TransformationsSusan L. Gerhart. 54-66
- Actor Semantics of Planner-73Irene Greif, Carl Hewitt. 67-77
- Reduction: A New Method of Proving Properties of Systems of ProcessesRichard J. Lipton. 78-86
- A Semantic Model for Parallel Systems with SchedulingEllis S. Cohen. 87-94
- A Description of Path Expressions by Petri NetsPeter E. Lauer, Roy H. Campbell. 95-105
- Even Simple Programs are Hard to AnalyzeNeil D. Jones, Steven S. Muchnick. 106-118
- On the Complexity of the Circularity Test for Attribute GrammarsMehdi Jazayeri, William F. Ogden, William C. Rounds. 119-129
- On the Complexity of LR(k) TestingHarry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman. 130-136
- Programming Languages, Natural Languages, and MathematicsPeter Naur. 137-148
- An Assertion Language for Data StructuresStephen A. Cook, Derek C. Oppen. 160-166
- Program Schemas with Concurrency: Execution Time and HangupsBruce P. Lester. 185-193
- Structured Exception HandlingJohn B. Goodenough. 204-224
- An Algebra of Relations for Machine ComputationPatrick A. V. Hall, Peter Hitchcock, Stephen Todd. 225-232