Volume 8, 1977
- David A. Watt:
The Parsing Problem for Affix Grammars.
1-20
- David C. Luckham, Norihisa Suzuki:
Proof of Termination within a Weak Logic of Programs.
21-36
- Mila E. Majster-Cederbaum:
Extended Directed Graphs, a Formalism for Structured Data and Data Structures.
37-59
- Isi Mitrani, J. H. Hine:
Complete Parameterized Families of Job Scheduling Strategies.
61-73
- Hermann A. Maurer, Arto Salomaa, Derick Wood:
EOL Forms.
75-96
- Robert D. Tennent:
Language Design Methods Based on Semantic Principles.
97-112
- Bruce Russell:
On an Equivalence between Continuation and Stack Semantics.
113-123
- Nissim Francez, Boris Klebansky, Amir Pnueli:
Backtracking in Recursive Computations.
125-144
- George W. Ernst:
Rules of Inference for Procedure Calls.
145-152
- Bo Munch-Andersen, Torben U. Zahle:
Scheduling According to Job Priority with Prevention of Deadlock and Permanent Blocking.
153-175
- Joel I. Seiferas:
Iterative Arrays with Direct Central Control.
177-192
- Peter Deussen, Kurt Mehlhorn:
Van Wijngaarden Grammars and Space Complexity Classs EXSPACE.
193-199
- Tilak Agerwala:
Some Extended Semaphore Primitives.
201-220
- James E. Donahue:
Locations Considered Unnecessary.
221-242
- Fred Kröger:
LAR: A Logic of Algorithmic Reasoning.
243-266
- Yoshihide Igarashi:
General Properties of Derivational Complexity.
267-283
- Peter R. J. Asveld, Joost Engelfriet:
Iterated Deterministic Substitution.
285-302
- J. Eve, Reino Kurki-Suonio:
On Computing the Transitive Closure of a Relation.
303-314
- Robert D. Tennent:
On a New Approach to Representation Independent Data Classes.
315-324
- Norbert Ramsperger:
Concurrent Access to Data.
325-334
- Reidar Conradi:
Some Comments on "Concurrent Readers and Writers".
335-340
- Hisao Kameda, C. C. Gotlieb:
A Feedback-Coupled Resource Allocation Policy for Multiprogrammed Computer Systems.
341-357
- Michel Parent, Dominique Potier:
A Note on the Influence of Program Loading on the Page Fault Rate.
359-370
- Burkhard Monien:
The LBA-Problem and the Deterministic Tape Complexity of Two-Way One-Counter Languages over a One-Letter Alphabet.
371-382
- Burkhard Monien:
Corrigenda: Transformational Methods and Their Application to Complexity Problems.
383-384
Copyright © Mon Nov 2 21:23:07 2009
by Michael Ley (ley@uni-trier.de)
