Mathematical Methods of Specification and Synthesis of Software Systems 1985: Wendisch-Rietz, GDR

Wolfgang Bibel, Klaus P. Jantke (Eds.): 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 215 Springer 1986, ISBN 3-540-16444-8 BibTeX

@proceedings{DBLP:conf/aii/1985,
  editor    = {Wolfgang Bibel and
               Klaus P. Jantke},
  title     = {Mathematical Methods of Specification and Synthesis of Software
               Systems '85, Proceedings of the International Spring School,
               Wendisch-Rietz, GDR, April 22-26, 1985},
  booktitle = {Mathematical Methods of Specification and Synthesis of Software
               Systems},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {215},
  year      = {1986},
  isbn      = {3-540-16444-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Lectures

Jan A. Bergstra, Jan Willem Klop: Verification of an alternating bit protocol by means of process algebra. 9-23 BibTeX
Wolfgang Bibel: Predicative programming revisited. 25-40 BibTeX
Takeshi Shinohara: Some problems on inductive inference from positive data. 41-58 BibTeX
Enn Tyugu: Language and example of knowledge-based programming. 59-72 BibTeX
Robert P. Daley: Inductive inference hierarchies: probabilistic vs pluralistic strategies. 73-82 BibTeX
Tamás Gergely, Konstantin Vershinin: Natural mathematical texts vs. programs. 83-100 BibTeX
Klaus P. Jantke: An algebraic framework for inductive program synthesis. 101-122 BibTeX
Helena Rasiowa, Andrzej Skowron: Approximation logic. 123-139 BibTeX

Contributed Papers

Ognian Botusharov: Learning on the basis of a polynomial pattern synthesis algorithm. 141-148 BibTeX
Jolanta Cybulka, Jerzy Bartoszek: The proof-checking component for the PLEATS programming system enabling specification of theories. 149-155 BibTeX
Werner Dilger, Wolfgang Womann: The METANET. A knowledge representation tool based on abstract data types. 156-161 BibTeX
Marek Ejsmont: One more property of array languages. 162-168 BibTeX
Sergei S. Goncharov, Dmitri Ivanovich Sviridenko: Theoretical aspects of Sigma-programming. 169-179 BibTeX
Z. Habasinski: Decidability in Pratt's process logics. 180-184 BibTeX
Steffen Lange: A program synthesis algorithm exemplified. 185-193 BibTeX
Jacques Loeckx: The algorithmic specification method of abstract data types: an overview. 194-200 BibTeX
Péter Komjáth, Zsolt Mihály Szabó: Orientation problems on sequences by recursive functions. 201-206 BibTeX
Christian Posthoff, Joachim Reiß: The solution of discrete problems by means of ternary representation. 207-214 BibTeX
Dieter Pötschke: Formalizing analogical reasoning. 215-218 BibTeX
Gisela Schäfer: Some results in the theory of effective program synthesis: learning by defective information. 219-225 BibTeX
Bernhard Thalheim: Deductive normal forms of relations. 226-230 BibTeX
Rolf Wiehagen: How fast is program synthesis from examples. 231-239 BibTeX
Thomas Zeugmann: On recursive optimizers. 240-245 BibTeX