Acta Informatica, Volume 24

Volume 24, Number 1, 1987

Patrick Cousot, Radhia Cousot: Sometime = Always + Recursion = Always on the Equivalence of the Intermittent and Invariant Assertions Methods for Proving Inevitability Properties of Programs. 1-31 BibTeX
Ryszard Janicki: A Formal Semantics for Concurrent Systems with a Priority Relation. 33-55 BibTeX
Masato Takeichi: Partial Parametrization Eliminates Multiple Traversals of Data Structures. 57-77 BibTeX
Oded Goldreich, Liuba Shrira: Electing a Leader in a Ring with Link Failures. 79-91 BibTeX
Clement H. C. Leung: Analysis of Space Allocation in a Generally Fragmented Linear Store. 93-104 BibTeX
K. Vidyasankar: Generalized Theory of Serializability. 105-119 BibTeX

Manfred Kunde: Lower Bounds for Sorting on Mesh-Connected Architectures. 121-130 BibTeX
George Loizou, Peter Thanisch: Losslessness and Project-Join Constructibility in Relational Databases. 131-144 BibTeX
Thomas P. Murtagh: Redundant Proofs of Non-Interference in Levin-Gries CSP Program Proofs. 145-156 BibTeX
Stephan Heilbrunner, Steffen Hölldobler: The Undecidability of the Unification and Matching Problem for Canonical Theories. 157-171 BibTeX
Wojciech Szpankowski: An Analysis of a Contention Resolution Algorithm: Another Approach. 173-190 BibTeX
Lawrence A. Harris: SLR(1) and LALR(1) Parsing for Unrestricted Grammars. 191-209 BibTeX
Rocco De Nicola: Extensional Equivalences for Transition Systems. 211-237 BibTeX

Ali Mili, Jules Desharnais, Fatma Mili: Relational Heuristics for the Design of Deterministic Programs. 239-276 BibTeX
Luc Devroye: Branching Processes in the Analysis of the Heights of Trees. 277-298 BibTeX
Henk Alblas: One-Pass Transformations of Attributed Program Trees. 299-352 BibTeX
S. Kiran Kumar, C. Pandu Rangan: A Linear Space Algorithm for the LCS Problem. 353-362 BibTeX

Bernd Becker: An Easily Testable Optimal-Time VLSI-Multiplier. 363-380 BibTeX
Albert Hoogewijs: Partial-Predicate Logic in Computer Science. 381-393 BibTeX
Deepak Kapur, Paliath Narendran, Hantao Zhang: On Sufficient-Completeness and Related Properties of Term Rewriting Systems. 395-415 BibTeX
Joseph G. Peters, Larry Rudolph: Parallel Approximation Schemes for Subset Sum and Knapsack Problems. 417-432 BibTeX
Ursula Schmidt: Long Unavoidable Patterns. 433-445 BibTeX
Paul E. S. Dunne: A Result on k -Valent Graphs and Its Application to a Graph Embedding Problem. 447-459 BibTeX
M. Kempf, Rudolf Bayer, Ulrich Güntzer: Time Optimal Left to Right Construction of Position Trees. 461-474 BibTeX
Edward A. Bender, Cheryl E. Praeger, Nicholas C. Wormald: Optimal Worst Case Trees. 475-489 BibTeX

J. W. de Bakker, John-Jules Ch. Meyer: Order and Metric in the Stream Semantics of Elemental Concurrency. 491-511 BibTeX
Jacek Blazewicz, Wieslaw Kubiak, H. Röck, Jayme Luiz Szwarcfiter: Minimizing Mean Flow-Time with Parallel Processors and Resource Constraints. 513-524 BibTeX
Andrzej Duda, Tadeusz Czachórski: Performance Evaluation of Fork and Join Synchronization Primitives. 525-553 BibTeX
Shyamal K. Chowdhury, Pradip K. Srimani: Worst Case Performance of Weighted Buddy Systems. 555-564 BibTeX
Bernard Chazelle: Some Techniques for Geometric Searching with Implicit Set Representations. 565-582 BibTeX
Walter Cunto, Jose Luis Gascon: Improving Time and Space Efficiency in Generalized Binary Search Trees. 583-594 BibTeX

Chua-Huang Huang, Christian Lengauer: The Derivation of Systolic Implementations of Programs. 595-632 BibTeX
Uwe Kastens: Lifetime Analysis for Attributes. 633-651 BibTeX
Marek J. Lao: Combinator-Based Compilation of Recursive Functions with Different Parameter Passing Modes. 653-678 BibTeX
Susan Horwitz, Alan J. Demers, Tim Teitelbaum: An Efficient General Iterative Algorithm for Dataflow Analysis. 679-694 BibTeX
Samuel N. Kamin: The Expressive Theory of Stacks. 695-709 BibTeX