9. MFCS 1980: Rydzyna, Poland

Invited Lectures

• Dines Bjørner:
  Formal Description of Programming Concepts: A Software Engineering Viewpoint. 1-21
  
• Rod M. Burstall:
  Electronic Category Theory. 22-39
  
• Hartmann J. Genrich, Kurt Lautenbach, P. S. Thiagarajan:
  Substitution Systems - A Family of System Models Based on Concurrency. 698-723
  
• Juris Hartmanis, Stephen R. Mahaney:
  An Eassay about Research on Sparse NP Complete Sets. 40-57
  
• Robert M. Keller:
  Some Theoretical Aspects of Applicative Multiprocessing. 58-74
  
• C. K. Wong:
  On Some Discrete Optimization Problems in Mass Storage Systems. 75-93
  
• William A. Wulf:
  Abstract Data Types: A Retrospective and Prospective View. 94-112
  

Communications

• André Arnold, Maurice Nivat:
  Controlling Behaviours of Systems: Some Basic Concepts and some Applications. 113-122
  
• Giorgio Ausiello, Carlo Batini, Marina Moscarini:
  Conceptual Relations between Databases Transformed under Join and Projection. 123-136
  
• X. Berenguer, J. Díaz:
  The Weighted Sperner's Set Problem. 137-141
  
• Eike Best:
  Proof of a Concurrent Program Finding Euler Paths. 142-153
  
• Wolfgang Bibel:
  A Theoretical Basis for the Systematic Proof Method. 154-167
  
• J. Dean Brock:
  Consistent Semantics for a Data Flow Language. 168-180
  
• Luca Cardelli:
  Analog Processes. 181-193
  
• Mario Coppo:
  An Extended Polymorphic Type System for Applicative Languages. 194-204
  
• Wiktor Danko:
  A Criterion of Undecidability of Algorithmic Theories. 205-218
  
• Pierpaolo Degano, A. Lomanto, Franco Sirovich:
  On Finding the Optimal Access Path to Resolve a Relational Data Base Query. 219-230
  
• Hartmut Ehrig, Hans-Jörg Kreowski, Bernd Mahr, Peter Padawitz:
  Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems. 231-245
  
• David Harel:
  on And/Or Schemes. 246-260
  
• Matthew Hennessy, Gordon D. Plotkin:
  A Term Model for CCS. 261-274
  
• Berthold Hoffmann, Ilse-R. Schiedecke:
  A Mathematical Approach to Multi-Pass Parsing. 275-290
  
• Ulrich L. Hupbach:
  Abstract Implementation of Abstract Data Types. 291-304
  
• Joseph JáJá, Janos Simon:
  Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). 305-319
  
• Ryszard Janicki:
  On Atomic Nets and Concurrency Relations. 320-333
  
• Dirk Janssens, Grzegorz Rozenberg:
  Node-Label Controllel Graph Grammars. 334-347
  
• Kurt Jensen:
  A Method to Compare the Descriptive Power of Different Types of Petri Nets. 348-361
  
• Herbert Klaeren:
  A Simple Class of Algorithmic Specifications for Abstract Software Modules. 362-374
  
• Norbert Kraft, Horst Wedde:
  Inducing Patterns of Behaviour in Distributed System Parts. 375-386
  
• Ingbert Kupka:
  Van Wijngaarden Grammars as a Special Information Processing Model. 387-401
  
• Yat-Sang Kwong, Derick Wood:
  Approaches to Concurrency in B-Trees. 402-413
  
• Burkhard Monien:
  On a Subclass of Pseudopolynomial Problems. 414-425
  
• Horst Müller:
  Decidability of Reachability in Persistent Vector Replacement Systems. 426-438
  
• Seiichi Okoma:
  Generalized Heapsort. 439-451
  
• Hiroakira Ono, Akira Nakamura:
  Decidability Results on a Query Language for Data Bases with Incomplete Informations. 452-459
  
• Peter Padawitz:
  New Results on Completeness and Consistency of Abstract Data Types. 460-473
  
• Judea Pearl:
  Asymptotic Complexity of Game-Searching Procedures. 474-487
  
• Helena Rasiowa:
  Completeness in Classical Logic of Complex Algorithms. 488-503
  
• Horst Reichel:
  Initially-Restricting Algebraic Theories. 504-514
  
• Wolfgang Reisig:
  Schemes for Nonsequential Processing Systems. 515-527
  
• Jan Reiterman, Vera Trnková:
  Dynamic Algebras which are not Kripke Structures. 528-538
  
• Peter Ruzicka:
  Time and Space Bounds in Producing Certain Partial Orders. 539-551
  
• Andrzej Salwicki:
  Axioms of Algorithmic Logic Univocally Determine Semantics of Programs. 552-561
  
• Vladimir Yu. Sazonov:
  A Logical Approach to the Problem "P=NP?". 562-575
  
• M. W. Shields, Peter E. Lauer:
  Verifying Concurrent System Specification in COSY. 576-586
  
• Joseph Sifakis:
  Deadlocks and Livelocks in Transition Systems. 587-600
  
• Giora Slutzki:
  Descriptional Complexity of Concurrent Processes (preliminary version). 601-611
  
• Stefan Sokolowski:
  A Uniform Approach to Applicative and Imperative Features in Programming Languages. 612-626
  
• Zbigniew Suraj:
  A Resource Applocation Problem. 627-642
  
• Tadao Takaoka, Alistair Moffat:
  An O(n² log log log n) Expected Time Algorithm for the all Shortest Distance Problem. 643-655
  
• Mars K. Valiev:
  Decision Complexity of Variants of Propositional Dynamic Logic. 656-664
  
• Paul M. B. Vitányi:
  Relativized Obliviousness. 665-672
  
• Martin Wirsing, Manfred Broy:
  Abstract Data Types as Lattices of Finitely Generated Models. 673-685
  
• Jacek Witaszek:
  The LR(k) Parser. 686-697