Baltic Computer Science
Selected Papers
Published on 28. June 1991
Book
Paperback/Softback
X, 626 pages
978-3-540-54131-8 (ISBN)
Description
This volume presents a substantial part of the results obtained in the last few years in the field of computer science in the Baltic Republics of Estonia, Latvia and Lithuania. It includes results previously published only in Russian as well as completely new results. The following main topics are addressed: deductive synthesis of programs, automatic test case generation, and specification and generation of distributed systems. These are all fields where Baltic scientists have made substantial contributions. The volume contains both theoretical results and general descriptions and logical outlines of some practical systems.
More details
Series
Edition
1991 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 626 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 34 mm
Weight
949 gr
ISBN-13
978-3-540-54131-8 (9783540541318)
DOI
10.1007/BFb0019352
Schweitzer Classification
Content
The programming system PRIZ.- Type-theoretical semantics of some declarative languages.- Using resolution for deciding solvable classes and building finite models.- Toward knowledge-based specifications of languages.- Inductive inference of recursive functions: Qualitative theory.- Inductive inference of recursive functions: Complexity bounds.- Inductive synthesis of dot expressions.- Some models of inductive syntactical synthesis from sample computations.- Inductive synthesis of term rewriting systems.- Automatic construction of test sets: Theoretical approach.- Automatic construction of test sets: Practical approach.- Aggregate approach for specification, validation, simulation and implementation of computer network protocols.- A compositional proof system for distributed programs.- Investigation of finitary calculus for a discrete linear time logic by means of infinitary calculus.- Rigal - a programming language for compiler writing.- Complexity of probabilistic versus deterministic automata.