1. Axiomatic data type specifications: A first order theory of linear lists

   • Daniel J. Moore
   • Bruce Russell

   OriginalPaper Pages: 193 - 207

2. Flow languages equal recursively enumerable languages

   • Toshiro Araki
   • Nobuki Tokura

   OriginalPaper Pages: 209 - 217

3. Recursive assertions and parallel programs

   • Krzysztof R. Apt

   OriginalPaper Pages: 219 - 232

4. Proving total correctness of nondeterministic programs in infinitary logic

   • R. J. R. Back

   OriginalPaper Pages: 233 - 249

5. A discrete-time round-robin queue with bernoulli input and general arithmetic service time distributions

   • H. Daduna
   • R. Schassberger

   OriginalPaper Pages: 251 - 263

6. LR(0) grammars generated by LR(0) parsers

   • R. Kemp

   OriginalPaper Pages: 265 - 280

7. A proof technique for communicating sequential processes

   • Gary Marc Levin
   • David Gries

   OriginalPaper Pages: 281 - 302

8. The equivalence of Horn and network complexity for Boolean functions

   • Stal O. Anderaa
   • Egon Börger

   OriginalPaper Pages: 303 - 307

9. Persistence of vector replacement systems is decidable

   • Ernst Mayr

   OriginalPaper Pages: 309 - 318