Mathematical Foundations of Computer Science 1998

1. Front Matter

   PDF

2. Hypergraph traversal revisited: Cost measures and dynamic algorithms

   • Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni

   Pages 1-16

3. Defining the Java Virtual Machine as platform for provably correct Java compilation

   • Egon Börger, Wolfram Schulte

   Pages 17-35

4. Towards a theory of recursive structures

   • David Harel

   Pages 36-53

5. Modularization and abstraction: The keys to practical formal verification

   • Yonit Kesten, Amir Pnueli

   Pages 54-71

6. On the role of time and space in neural computation

   • Wolfgang Maass

   Pages 72-83

7. From algorithms to working programs: On the use of program checking in LEDA

   • Kurt Mehlhorn, Stefan Näher

   Pages 84-93

8. Computationally-sound checkers

   • Silvio Micali

   Pages 94-116

9. Reasoning about the past

   • Mogens Nielsen

   Pages 117-128

10. Satisfiability — Algorithms and logic

    • Pavel Pudlák

    Pages 129-141

11. The joys of bisimulation

    • Colin Stirling

    Pages 142-151

12. Towards algorithmic explanation of mind evolution and functioning

    • Jiří Wiedermann

    Pages 152-166

13. Combinatorial hardness proofs for polynomial evaluation

    • Mikel Aldaz, Joos Heintz, Guillermo Matera, José L. Montaña, Luis M. Pardo

    Pages 167-175

14. Minimum propositional proof length is NP-hard to linearly approximate

    • Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi

    Pages 176-184

15. Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

    • Marek Chrobak, Christoph Dürr

    Pages 185-193

16. Locally explicit construction of rődl's asymptotically good packings

    • Nikolai N. Kuzjurin

    Pages 194-202

17. Proof theory of fuzzy logics: Urquhart's C and related logics

    • Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith

    Pages 203-212

18. Nonstochastic languages as projections of 2-tape quasideterministic languages

    • Richard Bonner, Rūsiņš Freivalds, Jānis Lapiņš, Antra Lukjanska

    Pages 213-219

19. Flow logic for Imperative Objects

    • Flemming Nielson, Hanne Riis Nielson

    Pages 220-228

20. Expressive completeness of Temporal Logic of action

    • Alexander Rabinovich

    Pages 229-238

This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998.
The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..

• Algorithms
• Combinatorics
• Formal Languages
• Mathematical Logic
• calculus
• complexity
• logic
• sets

Policies and ethics