Mathematical Foundations of Computer Science 1989

1. Front Matter

   PDF

2. From specification languages to specification knowledge bases: The PTO approach

   • Valery N. Agafonov

   Pages 1-17

3. Monadic second-order logic and context-free graph-grammars

   • Bruno Courcelle

   Pages 18-34

4. A thesis for bounded concurrency

   • David Harel

   Pages 35-48

5. Space bounded computations : Review and new separation results

   • J. Hartmanis, Desh Ranjan

   Pages 49-66

6. Concurrent nondeterministic processes: Adequacy of structure and behaviour

   • Ludmila A. Cherkasova, Vadim E. Kotov

   Pages 67-87

7. LEDA a library of efficient data types and algorithms

   • Kurt Mehlhorn, Stefan Näher

   Pages 88-106

8. Correctness of concurrent processes

   • Ernst-Rüdiger Olderog

   Pages 107-132

9. Understanding nets

   • B. A. Trakhtenbrot

   Pages 133-134

10. On the strength of temporal proofs

    • Hajnal Andréka, István Németi, Ildikó Sain

    Pages 135-144

11. Proof-theoretic characterisations of logic programming

    • James H. Andrews

    Pages 145-154

12. Algebraically closed theories

    • Eric Badouel

    Pages 155-164

13. Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses

    • Frank S. de Boer, Joost N. Kok, Catuscia Palamidessi, Jan J. M. M. Rutten

    Pages 165-176

14. Ehrenfeucht Test Set Theorem and Hilbert Basis Theorem: A constructive glimpse

    • Cristian Calude, Dragos Vaida

    Pages 177-184

15. Parallel complexity of lexicographically first problems for tree-structured graphs

    • Bogdan Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha

    Pages 185-195

16. On the power of synchronization in parallel computations

    • Jűrgen Dassow, Juraj Hromkovič, Juhani Karhumaki, Branislav Rovan, Anna Slobodová

    Pages 196-206

17. Optimal parallel algorithms for the recognition and colouring outerplanar graphs

    • Krzysztof Diks, Torben Hagerup, Wojciech Rytter

    Pages 207-217

18. Logical characterizations of nonmonotonic TMSs

    • Charles Elkan

    Pages 218-224

19. Proving correctness of constructor implementations

    • Jordi Farrés-Casals

    Pages 225-235

20. Equivalence notions for concurrent systems and refinement of actions

    • Rob van Glabbeek, Ursula Goltz

    Pages 237-248

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.

• algorithms
• automata
• complexity
• computability
• computability theory
• databases
• formal language
• theoretical computer science
• algorithm analysis and problem complexity

Policies and ethics