Table of contents (45 papers)

  1. Front Matter
  2. Word level model checking
    Edmund M. Clarke Jr.
    Pages 1-1
  3. Code problems on traces
    Volker Diekert, Anca Muscholl
    Pages 2-17
  4. Models of DNA computation
    Alan Gibbons, Martyn Amos, David Hodgson
    Pages 18-36
  5. Theory and practice of action semantics
    Peter D. Mosses
    Pages 37-61
  6. Linear time temporal logics over Mazurkiewicz traces
    Madhavan Mukund, P. S. Thiagarajan
    Pages 62-92
  7. Mind the gap! Abstract versus concrete models of specifications
    Donald Sannella, Andrzej Tarlecki
    Pages 114-134
  8. Kolmogorov complexity: Recent research in Moscow
    Vladimir A. Uspensky
    Pages 156-166
  9. A modal logic for data analysis
    Philippe Balbiani
    Pages 167-179
  10. From specifications to programs: A fork-algebraic approach to bridge the gap
    Gabriel A. Baum, Marcelo F. Frias, Armando M. Haeberer, Pablo E. Martínez López
    Pages 180-191
  11. Logic of predicates with explicit substitutions
    Marek A. Bednarczyk
    Pages 192-205
  12. On the query complexity of sets
    Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan
    Pages 206-217
  13. A Lambda Calculus of incomplete objects
    Viviana Bono, Michele Bugliesi, Luigi Liquori
    Pages 218-229
  14. Bisimilarity problems requiring exponential time (Extended abstract)
    Michele Boreale, Luca Trevisan
    Pages 230-241
  15. Linear dynamic Kahn networks are deterministic
    Arie de Bruin, S. H. Nienhuys-Cheng
    Pages 242-254
  16. Shortest path problems with time constraints
    X. Cai, T. Kloks, C. K. Wong
    Pages 255-266
  17. Parallel Alternating-Direction Access Machine
    Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Mirosław Kowaluk, Wojciech Plandowski
    Pages 267-278

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS '96, held in Crakow, Poland in September 1996.
The volume presents 35 revised full papers selected from a total of 95 submissions together with 8 invited papers and 2 abstracts of invited talks. The papers included cover issues from the whole area of theoretical computer science, with a certain emphasis on mathematical and logical foundations. The 10 invited presentations are of particular value.

Keywords

Algorithmen Komlexität Mathematische Logik Programmiertheorie algorithms calculus complexity formal languages lambda calculus logic mathematical logic object oriented design programming theory sets theoretical computer science

Bibliographic information

  • Copyright Information Springer-Verlag 1996
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-61550-7
  • Online ISBN 978-3-540-70597-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349