Mathematical Methods of Specification and Synthesis of Software Systems 85, Proceedings of the International Spring School, Wendisch-Rietz, GDR, April 22-26, 1985 - researchr publication

researchr

You are not signed in
Sign in
Sign up

Wolfgang Bibel, Klaus P. Jantke, editors, Mathematical Methods of Specification and Synthesis of Software Systems 85, Proceedings of the International Spring School, Wendisch-Rietz, GDR, April 22-26, 1985. Volume 215 of Lecture Notes in Computer Science, Springer, 1986.

Conference: aii1986

Abstract is missing.

Verification of an alternating bit protocol by means of process algebraJan A. Bergstra, Jan Willem Klop. 9-23

Predicative programming revisitedWolfgang Bibel. 25-40

Some problems on inductive inference from positive dataTakeshi Shinohara. 41-58

Language and example of knowledge-based programmingEnn Tyugu. 59-72

Inductive inference hierarchies: probabilistic vs pluralistic strategiesRobert P. Daley. 73-82

Natural mathematical texts vs. programsTamás Gergely, Konstantin Vershinin. 83-100

An algebraic framework for inductive program synthesisKlaus P. Jantke. 101-122

Approximation logicHelena Rasiowa, Andrzej Skowron. 123-139

Learning on the basis of a polynomial pattern synthesis algorithmOgnian Botusharov. 141-148

The proof-checking component for the PLEATS programming system enabling specification of theoriesJolanta Cybulka, Jerzy Bartoszek. 149-155

The METANET. A knowledge representation tool based on abstract data typesWerner Dilger, Wolfgang Womann. 156-161

One more property of array languagesMarek Ejsmont. 162-168

Theoretical aspects of Sigma-programmingSergei S. Goncharov, Dmitri Ivanovich Sviridenko. 169-179

Decidability in Pratt s process logicsZ. Habasinski. 180-184

A program synthesis algorithm exemplifiedSteffen Lange. 185-193

The algorithmic specification method of abstract data types: an overviewJacques Loeckx. 194-200

Orientation problems on sequences by recursive functionsPéter Komjáth, Zsolt Mihály Szabó. 201-206

The solution of discrete problems by means of ternary representationChristian Posthoff, Joachim Reiß. 207-214

Formalizing analogical reasoningDieter Pötschke. 215-218

Some results in the theory of effective program synthesis: learning by defective informationGisela Schäfer. 219-225

Deductive normal forms of relationsBernhard Thalheim. 226-230

How fast is program synthesis from examplesRolf Wiehagen. 231-239

On recursive optimizersThomas Zeugmann. 240-245

runs on WebDSL