Acta Informatica, Volume 30

Volume 30, Number 1, 1993

Bent Thomsen: Plain CHOCS: A Second Generation Calculus for Higher Order Processes. 1-59
Iain A. Stewart: Logical and Schematic Characterization of Complexity Classes. 61-87
Antoine Petit: Recognizable Trace Languages, Distributed Automata and the Distribution Problem. 89-101

Kim Marriott: Frameworks for Abstract Interpretation. 103-129
Anna Hac: Performance and Reliability Improvement by Using Asynchronous Algorithms in Disk Buffer Cache Memory. 131-146
Marisa Navarro, Fernando Orejas, Jean-Luc Remy: Contextual Rewriting as a Sound and Complete Proof Method for Conditional LOG-Specifications. 147-180
Xavier Nicollin, Joseph Sifakis, Sergio Yovine: From ATP to Timed Graphs and Hybrid Systems. 181-202

Paul S. Amerins, Ricardo A. Baeza-Yates, Derick Wood: On Efficient Entreeings. 203-213
Yuzheng Ding, Mark Allen Weiss: The Relaxed min-max Heap. 215-231
Patricio V. Poblete: The Analysis of Heuristics for Search Trees. 233-248
James H. Anderson: A Fine-Grained Solution to the Mutual Exclusion Problem. 249-265
Shigeki Iwata, Takumi Kasai, Etsuro Moriya: Relations among Simultaneous Complexity Classes of Nondeterministic and Alternating Turing Machines. 267-278
Karel Culik II, Simant Dube: L-Systems and Mutually Resurcive Function Systems. 279-302

Thomas Lehmann, Jacques Loeckx: OBSCURE: A Specification Language for Abstract Data Types. 303-350
Gheorghe Paun: On the Synchronization in Parallel Communicating Grammar Systems. 351-367
Daniel M. Yellin: Speeding up Dynamic Transitive Closure for Bounded Degree Graphs. 369-384
Julien Cassaigne: Unavoidable Binary Patterns. 385-395
Jan Kratochvíl, Mirko Krivánek: Satisfiability of Co-Nested Formulas. 397-403

David Spuler: The Optimal Binary Search Tree for Andersson's Search Algorithm. 405-407
Edward G. Coffman Jr., Leopold Flatto, Alexander Y. Kreinin: Scheduling Saves in Fault-Tolerant Computations. 409-423
Walid G. Aref, Hanan Samet: Decomposing a Window into Maximal Quadtree Blocks. 425-439
Alexandru Mateescu, Arto Salomaa: On Simplest Possible Solutions for Post Correspondence Problems. 441-457
Luc Devroye: On the Expected Height of Fringe-Balanced Trees. 459-466
K. Narayan Kumar, Paritosh K. Pandya: Infinitary Parallelism without Unbounded Nondeterminism in CSP. 467-487
Jan Van den Bussche: On Minimizing the Forall-Not Degree of a Connective-Free Formula. 489-502

Ambuj K. Singh: Program Refinement in Fair Transition Systems. 503-535
Eddy Bevers, Johan Lewi: Proving Termination of (Conditional) Rewrite Systems. A Semantic Approach. 537-568
Zhenyu Qian: An Algebraic Semantics of Higher-Order Types with Subtypes. 569-607

C. A. R. Hoare, Jifeng He, Augusto Sampaio: Normal Form Approach to Compiler Design. 701-739
Héctor J. Hernández: Extended Nested Relations. 741-771
John Buckle: A Characterisation of Meet and Join Respecting Pre-Orders and Congruences on Finite Lattices. 773-785