Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Mathematical Foundations of Computer Science 1996

21st International Symposium, MFCS' 96, Crakow, Poland, September 2 - 6, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Wojciech Penczek
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Andrzej Szałas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1113)

Included in the following conference series:

Conference proceedings info: MFCS 1996.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (45 papers)

  1. Front Matter

    Download chapter PDF

  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. Partial order reduction: Model-checking using representatives

    • Doron Peled
    Pages 93-112

  8. Nonmonotonic rule systems: Forward chaining, constraints, and complexity

    • Jeffrey B. Remmel
    Pages 113-113

  9. Mind the gap! Abstract versus concrete models of specifications

    • Donald Sannella, Andrzej Tarlecki
    Pages 114-134

  10. A sequent calculus for subtyping polymorphic types

    • Jerzy Tiuryn
    Pages 135-155

  11. Kolmogorov complexity: Recent research in Moscow

    • Vladimir A. Uspensky
    Pages 156-166

  12. A modal logic for data analysis

    • Philippe Balbiani
    Pages 167-179

  13. 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

  14. Logic of predicates with explicit substitutions

    • Marek A. Bednarczyk
    Pages 192-205

  15. On the query complexity of sets

    • Richard Beigel, William Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan
    Pages 206-217

  16. A Lambda Calculus of incomplete objects

    • Viviana Bono, Michele Bugliesi, Luigi Liquori
    Pages 218-229

  17. Bisimilarity problems requiring exponential time (Extended abstract)

    • Michele Boreale, Luca Trevisan
    Pages 230-241

  18. Linear dynamic Kahn networks are deterministic

    • Arie de Bruin, S. H. Nienhuys-Cheng
    Pages 242-254

  19. Shortest path problems with time constraints

    • X. Cai, T. Kloks, C. K. Wong
    Pages 255-266

  20. Parallel Alternating-Direction Access Machine

    • Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Mirosław Kowaluk, Wojciech Plandowski
    Pages 267-278
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1996

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation