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