Mathematical Foundations of Computer Science 1980: Proceedings of the 9th Symposium Held in Rydzyna, Poland, September 1–5, 1980

Formal description of programming concepts....Pages 1-21
Electronic category theory....Pages 22-39
An essay about research on sparse NP complete sets....Pages 40-57
Some theoretical aspects of applicative multiprocessing....Pages 58-74
On some discrete optimization problems in mass storage systems....Pages 75-93
Abstract data types: A retrospective and prospective view....Pages 94-112
Controlling behaviours of systems : Some basic concepts and some applications....Pages 113-122
Conceptual relations between databases transformed under join and projection....Pages 123-136
The weighted Sperner's Set problem....Pages 137-141
Proof of a concurrent program finding Euler paths....Pages 142-153
A theoretical basis for the systematic proof method....Pages 154-167
Consistent semantics for a data flow language....Pages 168-180
Analog processes....Pages 181-193
An extended polymorphic type system for applicative languages....Pages 194-204
A criterion of undecidability of algorithmic theories....Pages 205-218
On finding the optimal access path to resolve a relational data base query....Pages 219-230
Compound algebraic implementations: An approach to stepwise refinement of software systems....Pages 231-245
On and/or schemes....Pages 246-260
A term model for CCS....Pages 261-274
A mathematical approach to multi-pass parsing....Pages 275-290
Abstract implementation of abstract data types....Pages 291-304
Parallel algorithms in graph theory: Planarity testing (preliminary version)....Pages 305-319
On atomic nets and concurrency relations....Pages 320-333
Node-label controlled graph grammars (Extended abstract)....Pages 334-347
A method to compare the descriptive power of different types of Petrinets....Pages 348-361
A simple class of algorithmic specifications for abstract software modules....Pages 362-374
Inducing patterns of behaviour in distributed system parts....Pages 375-386
Van wijngaarden grammars as a special information processing model....Pages 387-401
Approaches to concurrency in B-trees....Pages 402-413
On a subclass of pseudopolynomial problems....Pages 414-425
Decidability of reachability in persistent vector replacement systems....Pages 426-438
Generalized heapsort....Pages 439-451
Decidability results on a query language for data bases with incomplete information....Pages 452-459
New results on completeness and consistency of abstract data types....Pages 460-473
Asymptotic complexity of game-searching procedures....Pages 474-487
Completeness in classical logic of complex algorithms....Pages 488-503
Initially — Restricting algebraic theories....Pages 504-514
Schemes for nonsequential processing systems....Pages 515-527
Dynamic algebras which are not Kripke structures....Pages 528-538
Time and space bounds in producing certain partial orders....Pages 539-551
Axioms of algorithmic logic univocally determine semantics of programs....Pages 552-561
A logical approach to the problem “P=NP?”....Pages 562-575
Verifying concurrent system specifications in COSY....Pages 576-586
Deadlocks and livelocks in transition systems....Pages 587-600
Descriptional complexity of concurrent processes (preliminary version)....Pages 601-611
A uniform approach to applicative and imperative features in programming languages....Pages 612-626
A resource allocation problem....Pages 627-642
An 0(n 2 lognloglogn) expected time algorithm for the all shortest distance problem....Pages 643-655
Decision complexity of variants of propositional dynamic logic....Pages 656-664
Relativized obliviousness....Pages 665-672
Abstract data types as lattices of finitely generated models....Pages 673-685
The LR(k) parser....Pages 686-697
Substitution systems — A family of system models based on concurrency....Pages 698-723