Mathematical methods of specification and synthesis of software systems '85 : proceedings of the international spring school, Wendisch-Rietz, GDR, April 22-26, 1985
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
215 |
| 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: | • Mathematical methods of specification and synthesis of software systems '85, proceedings of the international spring school, Wendisch-Rietz, GDR, April 22-26, 1985, edited by W. Bibel and K.P. Jantke, Berlin, Springer, 1986, 1 Vol. (245 p.), Lecture notes in computer science, 0-387-16444-8 • Mathematical Methods of Specification and Synthesis of Software Systems '85, Texte imprimé, 9783662214817 |
Taula de continguts:
- Verification of an alternating bit protocol by means of process algebra protocol
- Predicative programming revisited
- Some problems on inductive inference from positive data
- Language and example of knowledge-based programming
- Inductive inference hierarchies: Probabilistic VS pluralistic strategies
- Natural mathematical texts VS. programs
- An algebraic framework for inductive program synthesis
- Approximation logic
- Learning on the basis of a polynomial pattern synthesis algorithm
- The proof-checking component for the pleats programming system enabling specification of theories
- The METANET. A knowledge representation tool based on abstract data types
- One more property of array languages
- Theoretical aspects of ?-programming
- Decidability in pratt's process logics
- A program synthesis algorithm exemplified
- The algorithmic specification method of abstract data types: An overview
- Orientation problems on sequences by recursive functions
- The solution of discrete problems by means of ternary representations
- Formalizing analogical reasoning
- Some results in the theory of effective program synthesis: Learning by defective information
- Deductive normal forms of relations
- How fast is program synthesis from examples
- On recursive optimizers.