Mathematical Foundations of Computer Science 1979 : 8th Symposium, Olomouc Czechoslovakia, September 3-7, 1979. Proceedings. 1st ed. 1979

種類:

電子ブック

責任表示:

edited by J. Becvar

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1979

著者名:

• Becvar, J.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 74

ISBN:

9783540350880 [3540350888]    

注記:

A sound and complete proof system for partial program correctness -- The problem of reachability and verification of programs -- Assertion programming -- Complexity classes of formal languages -- Fast probabilistic algorithms -- Relative succinctness of representations of languages and separation of complexity classes -- On two types of loops -- Full abstraction for a simple parallel programming language -- On some developments in cryptography and their applications to computer science -- Searching, sorting and information theory -- Lcf: A way of doing proofs with a machine -- Axioms or algorithms -- Power from power series -- Computational complexity of string and graph ident ification -- A survey of grammar and l forms-1978 -- A theoretical study on the time analysis of programs -- Completeness problems in verification of programs and program schemes -- Relationships between AFDL's and cylinders -- Computable data types -- Program equivalence and provability -- Interactive L systems with almost interactionl

ローカル注記:

学内専用E-BOOKS (local access only)