Abstract is missing.
- Specification and Verification of Concurrent Programs By Forall-AutomataZohar Manna, Amir Pnueli. 1-12
- Axioms for Concurrent ObjectsMaurice Herlihy, Jeannette M. Wing. 13-26
- Completeness and Incompleteness of Trace-Based Network Proof SystemsJennifer Widom, David Gries, Fred B. Schneider. 27-38
- Semantic Parallelization: A Practical Exercise in Abstract InterpretationPierre Jouvelot. 39-48
- The Concurrent Logic Programming Language CP: Definition and Operational SemanticsVijay A. Saraswat. 49-62
- Automatic Decomposition of Scientific Programs for Parallel ExecutionRandy Allen, David Callahan, Ken Kennedy. 63-76
- Macro-by-Example: Deriving Syntactic Transformations from their SpecificationsEugene E. Kohlbecker, Mitchell Wand. 77-84
- Binding Performance at Language Design TimeJiazhen Cai, Robert Paige. 85-97
- Environments as First Class ObjectsDavid Gelernter, Suresh Jagannathan, Thomas London. 98-110
- Constraint Logic ProgrammingJoxan Jaffar, Jean-Louis Lassez. 111-119
- Strictness Analysis and Denotational Abstract InterpretationFlemming Nielson. 120-131
- Compiling Strictness into StreamsCordelia V. Hall, David S. Wise. 132-143
- On Strictness and its AnalysisTsung-Min Kuo, Prateek Mishra. 144-155
- A Logic for Partially Specified Data StructuresM. Drew Moshier, William C. Rounds. 156-167
- An Improvement to Bottom-up Tree Pattern MatchingDavid R. Chase. 168-177
- Lustre: A Declarative Language for Programming Synchronous SystemsPaul Caspi, Daniel Pilaud, Nicolas Halbwachs, John Plaice. 178-188
- Appraising Fairness in Languages for Distributed ProgrammingKrzysztof R. Apt, Nissim Francez, Shmuel Katz. 189-198
- Concurrent Transition System Semantics of Process NetworksEugene W. Stark. 199-210
- Semantics for Concurrency without Powerdomains211-222
- Full Abstraction of a Real-Time Denotational Semantics for an Occam-like LanguageCornelis Huizing, Rob Gerth, Willem P. de Roever. 223-237
- Computable Values Can Be ClassicalVal Tannen, Albert R. Meyer. 238-245
- Skinny and Fleshy Failures of Relative CompletenessDaniel Leivant, Tim Fernando. 246-252
- Empty Types in Polymorphic Lambda CalculusAlbert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman. 253-262
- Scheduling Arithmetic and Load Operations in Parallel with No SpillingDavid Bernstein, Jeffrey M. Jaffe, Michael Rodeh. 263-273
- Computation of Aliases and Support SetsAnne Neirynck, Prakash Panangaden, Alan J. Demers. 274-283
- A Realistic Compiler Generator Based on High-Level SemanticsPeter Lee, Uwe F. Pleban. 284-295
- Extensions for Multi-Module Records in Conventional Programming LanguagesDavid R. Cheriton, Michael E. Wolf. 296-306
- Views: A Way for Pattern Matching to Cohabit with Data AbstractionPhilip Wadler. 307-313
- A Calculus for Assignments in Higher-Order LanguagesMatthias Felleisen, Daniel P. Friedman. 314-325