Acta Informatica, Volume 27

Volume 27, Number 1, 1989

Henk Alblas: Iteration of Transformation Passes over Attributed Program Trees. 1-40
Carl Langenhop, William E. Wright: A Model of the Dynamic Behavior of B-Trees. 41-59
Peter Ruzicka, Igor Prívara: An Almost Linear Robinson Unification Algorithm. 61-71
Kung-Kiu Lau: A Note on Synthesis and Classification of Sorting Algorithms. 73-80
Jakob Gonczarowski, Manfred K. Warmuth: Scattered Versus Context-Sensitive Rewriting. 81-95

Chua-Huang Huang, Christian Lengauer: An Incremental Mechanical Development of Systolic Solutions to the Algebraic Path Problem. 97-124
Dirk Taubner, Walter Vogler: Step Failures Semantics and a Complete Proof System. 125-156
Vernon Rego: Some Efficient Computational Algorithms Related to Phase Models. 157-177
Karel Culik II, Juhani Karhumäki: HDTOL Matching of Computations of Multitape Automata. 179-191

Friedrich L. Bauer: In Memoriam: Andrei Petrovich Ershov. 193-194
Betty Salzberg: Merging Sorted Runs Using Large Main Memory. 195-215
Gunther Schmidt, Rudolf Berghammer, Hans Zierer: Describing Semantic Domains with Sprouts. 217-245
Demetres D. Kouvatsos, Nasreddine Tabet-Aouel: A Maximum Entropy Priority Approximation for a Stable G/G/ 1 Queue. 247-286

Joseph M. Morris: Temporal Predicat Transformers and Fair Termination. 287-313
Andrzej Ehrenfeucht, Grzegorz Rozenberg: Partial (Set) 2-Structures. Part I: Basic Notions and the Representation Problem. 315-342
Andrzej Ehrenfeucht, Grzegorz Rozenberg: Partial (Set) 2-Structures. Part II: State Spaces of Concurrent Systems. 343-368
Lawrence T. Kou: On Efficient Implementation of an Approximation Algorithm for the Steiner Tree Problem. 369-380

John-Jules Ch. Meyer, Ernst-Rüdiger Olderog: Hiding in Stream Semantics of Uniform Concurrency. 381-397
Clemens Lautemann: The Complexity of Graph Languages Generated by Hyperedge Replacement. 399-421
Mark H. Overmars, Michiel H. M. Smid, Mark de Berg, Marc J. van Kreveld: Maintaining Range Trees in Secondary Memory. Part I: Partitions. 423-452
Michiel H. M. Smid, Mark H. Overmars: Maintaining Range Trees in Secondary Memory. Part II: Lower Bounds. 453-480

Carroll Morgan, Paul H. B. Gardiner: Data Refinement by Calculation. 481-503
Harald Søndergaard, Peter Sestoft: Referential Transparency, Definiteness and Unfoldability. 505-517
Erol Gelenbe, Marisela Hernández: Optimum Checkpoints with Age Dependent Failures. 519-531
Dirk Taubner: Representing CCS Programs by Finite Predicate/Transition Nets. 533-565
Joost Engelfriet, Willem de Jong: Attribute Storage Optimization by Stacks. 567-581

Ralph-Johan Back, Joakim von Wright: Duality in Specification Languages: A Lattice-Theoretical Approach. 583-625
Lin Yu, Daniel J. Rosenkrantz: Minimizing Time-Space Cost for Database Version Control. 627-663
A. Michael Berman, Marvin C. Paull, Barbara G. Ryder: Proving Relative Lower Bounds for Incremental Algorithms. 665-683

Wladyslaw M. Turski: On Specification of Multiprocessor Computing. 685-696
Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier: The Instability of Self-Stabilization. 697-724
Rance Cleaveland: Tableau-Based Model Checking in the Propositional Mu-Calculus. 725-747
Andreas Weber: On the Valuedness of Finite Transducers. 749-780
Alexander Meduna: Context Free Derivations on Word Monoids. 781-786