Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1979

8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings

  • Conference proceedings
  • © 1979

Overview

Editors:
  1. Jiří Bečvář
    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 74)

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 59.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 (57 papers)

  1. Front Matter

    Download chapter PDF

  2. A sound and complete proof system for partial program correctness

    • J. W. de Bakker
    Pages 1-12

  3. The problem of reachability and verification of programs

    • J. M. Barzdin
    Pages 13-25

  4. Assertion programming

    • Andrzej J. Blikle
    Pages 26-42

  5. Complexity classes of formal languages

    • Ronald V. Book
    Pages 43-56

  6. Fast probabilistic algorithms

    • Rūsiņš Freivalds
    Pages 57-69

  7. Relative succinctness of representations of languages and separation of complexity classes

    • Juris Hartmanis, T. P. Baker
    Pages 70-88

  8. On two types of loops

    • Ivan M. Havel
    Pages 89-107

  9. Full abstraction for a simple parallel programming language

    • M. C. B. Hennessy, G. D. Plotkin
    Pages 108-120

  10. On some developments in cryptography and their applications to computer science

    • Hermann A. Maurer
    Pages 121-130

  11. Searching, sorting and information theory

    • Kurt Mehlhorn
    Pages 131-145

  12. Lcf: A way of doing proofs with a machine

    • Robin Milner
    Pages 146-159

  13. Axioms or algorithms

    • Vaughan R. Pratt
    Pages 160-169

  14. Power from power series

    • Arto Salomaa
    Pages 170-181

  15. Computational complexity of string and graph ident ification

    • A. O. Slisenko
    Pages 182-190

  16. A survey of grammar and l forms-1978

    • Derick Wood
    Pages 191-200

  17. A theoretical study on the time analysis of programs

    • Akeo Adachi, Takumi Kasai, Etsuro Moriya
    Pages 201-207

  18. Completeness problems in verification of programs and program schemes

    • H. Andréka, I. Németi, I. Sain
    Pages 208-218

  19. Relationships between AFDL's and cylinders

    • Jean-Michel Autebert
    Pages 219-227

  20. Computable data types

    • G. Comyn, G. Werner
    Pages 228-236
Back to top

Keywords

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1979

  • Book Subtitle: 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings

  • Editors: Jiří Bečvář

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-09526-8

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1979

  • Softcover ISBN: 978-3-540-09526-2Published: 01 July 1979

  • eBook ISBN: 978-3-540-35088-0Published: 08 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 585

  • Topics: Theory of Computation, Mathematics, general, Mathematics of Computing

Publish with us

Policies and ethics

Back to top

Search

Navigation