Mathematical Methods of Specification and Synthesis of Software Systems '85: Proceedings of the International Spring School Wendisch-Rietz, GDR, April by Wolfgang BibelMathematical Methods of Specification and Synthesis of Software Systems '85: Proceedings of the International Spring School Wendisch-Rietz, GDR, April by Wolfgang Bibel

Mathematical Methods of Specification and Synthesis of Software Systems '85: Proceedings of the…

EditorWolfgang Bibel

Paperback | June 1, 1986

Pricing and Purchase Info

$114.32 online 
$128.95 list price save 11%
Earn 572 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Mathematical Methods of Specification and Synthesis of Software Systems '85: Proceedings of the…Format:PaperbackDimensions:245 pages, 10.98 × 8.5 × 0.01 inPublished:June 1, 1986Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540164448

ISBN - 13:9783540164449

Look for similar items by category:

Reviews

Table of Contents

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.