Mathematical Foundations of Computer Science 1996

21st International Symposium, MFCS'96 Cracow, Poland, September 2–6, 1996 Proceedings

Editors:

ISBN: 978-3-540-61550-7 (Print) 978-3-540-70597-0 (Online)

Table of contents (45 chapters)

previous Page of 3
  1. No Access

    Book Chapter

    Pages 1-1

    Word level model checking

  2. No Access

    Book Chapter

    Pages 2-17

    Code problems on traces

  3. No Access

    Book Chapter

    Pages 18-36

    Models of DNA computation

  4. No Access

    Book Chapter

    Pages 37-61

    Theory and practice of action semantics

  5. No Access

    Book Chapter

    Pages 62-92

    Linear time temporal logics over Mazurkiewicz traces

  6. No Access

    Book Chapter

    Pages 93-112

    Partial order reduction: Model-checking using representatives

  7. No Access

    Book Chapter

    Pages 113-113

    Nonmonotonic rule systems: Forward chaining, constraints, and complexity

  8. No Access

    Book Chapter

    Pages 114-134

    Mind the gap! Abstract versus concrete models of specifications

  9. No Access

    Book Chapter

    Pages 135-155

    A sequent calculus for subtyping polymorphic types

  10. No Access

    Book Chapter

    Pages 156-166

    Kolmogorov complexity: Recent research in Moscow

  11. No Access

    Book Chapter

    Pages 167-179

    A modal logic for data analysis

  12. No Access

    Book Chapter

    Pages 180-191

    From specifications to programs: A fork-algebraic approach to bridge the gap

  13. No Access

    Book Chapter

    Pages 192-205

    Logic of predicates with explicit substitutions

  14. No Access

    Book Chapter

    Pages 206-217

    On the query complexity of sets

  15. No Access

    Book Chapter

    Pages 218-229

    A Lambda Calculus of incomplete objects

  16. No Access

    Book Chapter

    Pages 230-241

    Bisimilarity problems requiring exponential time (Extended abstract)

  17. No Access

    Book Chapter

    Pages 242-254

    Linear dynamic Kahn networks are deterministic

  18. No Access

    Book Chapter

    Pages 255-266

    Shortest path problems with time constraints

  19. No Access

    Book Chapter

    Pages 267-278

    Parallel Alternating-Direction Access Machine

  20. No Access

    Book Chapter

    Pages 279-290

    Specification and verification of timed lazy systems

previous Page of 3