Baltic computer science : selected papers
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 a...
Guardat en:
| Autor principal: | |
|---|---|
| Altres autors: | |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
502 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Baltic computer science, selected papers, J. Bārzdi¬nš, D. Bjørner, (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (X-619 p.), Lecture notes in computer science, 3-540-54131-4 • Baltic Computer Science, Texte imprimé, 9783662168769 |
Taula de continguts:
- 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.