Acta Informatica, Volume 12

Volume 12, 1979

• Axel van Lamsweerde, Michel Sintzoff: Formal Derivation of Strongly Correct Concurrent Programs. 1-31 BibTeX
• Helmut Alt: Lower Bounds on Space Complexity for Contextfree Recognition. 33-61 BibTeX
• Yasuichi Horibe, Tibor O. H. Nemetz: On the Max-Entropy Rule for a Binary Search Tree. 63-72 BibTeX
• Jørgen Steensgaard-Madsen: Pascal-Clarifications and Recommended Extensions. 73-94 BibTeX
• Warren Burton: Generalized Recursive Data Structures. 95-108 BibTeX
• Peter E. Lauer, Piero R. Torrigiani, M. W. Shields: COSY - A System Specification Language Based on Paths and Processes. 109-158 BibTeX
• Donald L. Iglehart, Gerald S. Shedler: Regenerative Simulation of Response Times in Networks of Queues with Multiple Job Types. 159-175 BibTeX
• Ronald V. Book: On Languages Accepted by Space-Bounded Oracle Machines. 177-185 BibTeX
• C. J. M. Turnbull, E. S. Lee: Generalized Deterministic Left To Right Parsing. 187-207 BibTeX
• Reinhard Wilhelm: Computation and Use of Data Flow Information in Optimizing Compilers. 209-225 BibTeX
• Beate Commentz-Walter: Size-Depth Tradeoff in Monotone Boolean Formulae. 227-243 BibTeX
• J. W. Cohen: The Multiple Phase Service Network with Generalized Processor Sharing. 245-284 BibTeX
• Erol Gelenbe: Probabilistic Models of Computer Systems. 285-303 BibTeX
• Teruo Hikita: On a Class of Recursive Procedures and Equivalent Iterative Ones. 305-320 BibTeX
• N. Mikou, S. Tucci: Analyse et optimisation d'une procédure de reprise dans un système de gestion de données centralisées. 321-338 BibTeX
• Eljas Soisalon-Soininen, Esko Ukkonen: A Method for Transforming Grammars into LL(k) Form. 339-369 BibTeX
• Kurt Mehlhorn: Some Remarks on Boolean Sums. 371-375 BibTeX
• Hirokazu Nishimura: Sequential Method in Propositional Dynamic Logic. 377-400 BibTeX