Acta Informatica, Volume 33

Volume 33, Number 1, 1996

Gadi Taubenfeld, Shlomo Moran: Possibility and Impossibility Results in a Shared Memory Environment. 1-20
Dominic Duggan, Gordon V. Cormack, John Ophel: Kinded Type Inference for Parametric Overloading. 21-68
Davide Sangiorgi: A Theory of Bisimulation for the pi-Calculus. 69-97

Aki Matsumoto, Dong-Soo Han, Takao Tsuda: Alias Analysis of Pointers in Pascal and Fortran 90: Dependence Analysis Between Pointer References. 99-130
John K. Lee, Alan Fekete: Multi-Granularity Locking for Nested Transactions: A Proof Using a Possibilities Mapping. 131-152
Antonio Cau, Pierre Collette: Parallel Composition of Assumption-Commitment Specifications: A Unifying Approach for Shared Variable and Distributed Message Passing Concurrency. 153-176
Sibsankar Haldar, K. Vidyasankar: Simple Extensions of 1-writer Atomic Variable Constructions to Multiwriter Ones. 177-202

Alexander Tuzhilin, Zvi M. Kedem: Modeling Data-Intensive Reactive Systems with Relational Transition Systems. 203-231
Wim H. Hesselink: Bounded Delay for a Free Address. 233-254
Akhil Kumar, Kavindra Malik: Optimizing the Costs of Hierarchical Quorum Consensus. 255-275
Gunnar Stålmarck: Short Resolution Proofs for a Sequence of Tricky Formulas. 277-280
Géraud Sénizergues: On the Rational Subsets of the Free Group. 281-296

Jörg Desel, Wolfgang Reisig: The Synthesis Problem of Petri Nets. 297-315
Luca Aceto, David Murphy: Timing and Causality in Process Algebra. 317-350
Patrick E. O'Neil, Edward Cheng, Dieter Gawlick, Elizabeth J. O'Neil: The Log-Structured Merge-Tree (LSM-Tree). 351-385
Josep Díaz, Maria J. Serna, Jacobo Torán: Parallel Approximation Schemes for Problems on Planar Graphs. 387-408

Petr Jancar, Frantisek Mráz, Martin Plátek: Forgetting Automata and Context-Free Languages. 409-420
Neal A. Harman, J. V. Tucker: Algebraic Models of Microprocessors: Architecture and Organisation. 421-456
Alexander Meduna: Syntactic Complexity of Context-Free Grammars Over Word Monoids. 457-462
Egon Wanke: Undecidability of Restricted Uniform Recurrence Equations. 463-475
Razvan Diaconescu: Category-Based Modularisation for Equational Logic Programming. 477-510

Mikkel Thorup: Disambiguating Grammars by Exclusion of Sub-Parse Trees. 511-522
Andrea Maggiolo-Schettini, Józef Winkowski: A Kernel Language for Programmed Rewriting of (Hyper)graphs. 523-546
Otto Nurmi, Eljas Soisalon-Soininen: Chromatic Binary Search Trees. A Structure for Concurrent Rebalancing. 547-557
Vladimir G. Deineko, Rüdiger Rudolf, Gerhard J. Woeginger: On the Recognition of Permuted Supnick and Incomplete Monge Matrices. 559-569
Andrzej Ehrenfeucht, Gheorghe Paun, Grzegorz Rozenberg: The Linear Landscape of External Contextual Languages. 571-593
M. R. K. Krishna Rao: Relating Confluence, Innermost-Confluence and Outermost-Confluence Properties of Term Rewriting Systems. 595-606

Sanjeev Saxena: Parallel Integer Sorting and Simulation Amongst CRCW Models. 607-619
Foued Ameur, Paul Fischer, Klaus-Uwe Höffgen, Friedhelm Meyer auf der Heide: Trial and Error. A New Approach to Space-Bounded Learning. 621-630
Eberhard Bertsch: An Observation on Suffix Redundancy in LL(1) Error Repair. 631-639
Pierpaolo Degano, José Meseguer, Ugo Montanari: Axiomatizing the Algebra of Net Computations and Processes. 641-667
Falko Bause: On the Analysis of Petri Nets with Static Priorities. 669-685
Robert H. Sloan, Ugo A. Buy: Reduction Rules for Time Petri Nets. 687-706

Robin Milner: Calculi for Interaction. 707-737
Thomas W. Reps: On the Sequential Nature of Interprocedural Program-Analysis Problems. 739-757
Andrzej Biela, Jakub Borowczyk: RETRPROV, A System that Looks for Axioms. 759-780
Stephan Heilbrunner: A Direct Complement Construction for LR(1) Grammars. 781-797