| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465534703316 |
|
|
Titolo |
Baltic Computer Science [[electronic resource] ] : Selected Papers / / edited by Janis Barzdins, Dines Bjørner |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1991.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 626 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 502 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Computer programming |
Software engineering |
Algorithms |
Computer logic |
Theory of Computation |
Programming Techniques |
Software Engineering |
Computation by Abstract Devices |
Algorithm Analysis and Problem Complexity |
Logics and Meanings of Programs |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
|
|
| |