Cantitate/Preț
Produs
Total produse
Vezi coșul
Mathematics of Program Construction de Johan Jeuring

Mathematics of Program Construction

Editat de Johan Jeuring
en Limba Engleză Paperback – 27 mai 1998
This book consitutes the refereed proceedings of the 4th International Conference on Mathematics of Program Construction, MPC'98, held in Marstrand, near Goteborg, Sweden, in June 1998. The 17 revised full papers presented were selected from 57 submissions; also included are three invited contributions. The volume is devoted to the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; varoius approaches to formal methods for systems design and analysis are covered.
Citește tot Restrânge

Preț: 32748 lei

Preț vechi: 40936 lei
-20%

Puncte Express: 491

Carte tipărită la comandă

Livrare economică 17-31 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540645917
ISBN-10: 3540645918
Pagini: 404
Ilustrații: X, 388 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.61 kg
Ediția:1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

On the aesthetics of diagrams.- Generalising monads.- A proof rule for control loops.- Relation-algebraic derivation of spanning tree algorithms.- An application of program derivation techniques to 18th-century mathematics.- Nested datatypes.- An approach to object-orientation in action systems.- Layered graph traversals and Hamiltonian path problems — An algebraic approach.- A unifying framework for correct program construction.- Computation calculus bridging a formalization gap.- An elementary derivation of the alternating bit protocol.- A set-theoretic model for real-time specification and reasoning.- Polytypic downwards accumulations.- Formal derivation of a loadable asynchronous counter.- A semantic approach to secure information flow.- Slack elasticity in concurrent computing.- Beyond fun: Order and membership in polytypic imperative programming.- Convergence of program transformers in the metric space of trees.- Realizability of monotone coinductive definitions and its application to program synthesis.- Calculating a round-robin scheduler.