Mathematical Methods of Specification and Synthesis of Software Systems '85: Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22-26, 1985 (Lecture Notes in Computer Science)

Edited By W. Bibel And K.p. Jantke. Includes Bibliographies. Verification of an alternating bit protocol by means of process algebra protocol....Pages 9-23 Predicative programming revisited....Pages 25-40 Some problems on inductive inference from positive data....Pages 41-58 Language and example of knowledge-based programming....Pages 59-72 Inductive inference hierarchies: Probabilistic VS pluralistic strategies....Pages 73-82 Natural mathematical texts VS. programs....Pages 83-100 An algebraic framework for inductive program synthesis....Pages 101-122 Approximation logic....Pages 123-139 Learning on the basis of a polynomial pattern synthesis algorithm....Pages 141-148 The proof-checking component for the pleats programming system enabling specification of theories....Pages 149-155 The METANET. A knowledge representation tool based on abstract data types....Pages 156-161 One more property of array languages....Pages 162-168 Theoretical aspects of Σ-programming....Pages 169-179 Decidability in pratt's process logics....Pages 180-184 A program synthesis algorithm exemplified....Pages 185-193 The algorithmic specification method of abstract data types: An overview....Pages 194-200 Orientation problems on sequences by recursive functions....Pages 201-206 The solution of discrete problems by means of ternary representations....Pages 207-214 Formalizing analogical reasoning....Pages 215-218 Some results in the theory of effective program synthesis: Learning by defective information....Pages 219-225 Deductive normal forms of relations....Pages 226-230 How fast is program synthesis from examples....Pages 231-239 On recursive optimizers....Pages 240-245