Algorithimic Languages and Calculi

Inbunden, Engelska, 1997

Del i serien IFIP Advances in Information and Communication Technology

2 239 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

The general theme of this working conference is notations, methods, and tool support for the calculation of programs from specifications. Its purpose is to present the results of ongoing research, descriptions of existing and prosposed systems and applications to the production of practical software. This work, a collection of papers from the conference, aims to address the following topics: the study of the calculation of programs from specifications, the design of notations for such calculation, the formulation of algorithm theories using such notations and the investigation of software support for program derivation. This book should be of interest to computer science students, software researchers and programmers requiring correct codes.

Produktinformation

Utgivningsdatum:1997-07-31
Mått:155 x 235 x 25 mm
Vikt:813 g
Format:Inbunden
Språk:Engelska
Serie:IFIP Advances in Information and Communication Technology
Antal sidor:443
Upplaga:1997
Förlag:Chapman and Hall
ISBN:9780412820502

Utforska kategorier

Programvaruutveckling inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

Preface. Programme committee. Dynamic programming: a different perspective - S. Curtis. Calculating with pointer structures - B. Moller. Deriving a systolic regular language recognizer - M. Vaccarri and R. Backhouse. Discussion. A calculation fusion system HYLO - Y. Onoue, Z. Hu, H. Iwasaki and M. Takeichi. Refinement of data parallel programs in PEI - E. Violard, S. Genaud and G-R. Perrin. Solving large systems of differential equations in parallel using covers and skeletons - M. Sudholt, C. Piepenbrock, K. Obermayer and P. Pepper. Discussion. Refinement of parameterized algebraic specifications - Y.V. Srinivas. Towards a compositional interpretation of object diagrams - J.C. Bicarregui, K.C. Lano and T.S.E. Maibaum. A powerful transformation rule, its applications and variants - K. Achatz and H. Partsch. Program derivation via list introduction - A. Pettorossi and M. Proietti. Towards a calculus for abstract syntax trees - D.S. Wile. Discussion. Principledstrength reduction - Y.A. Liu. The formal reconstruction and speedup of the linear time fragment of Willard's relational calculus subset - D. Goyal and R. Paige. Predicative semantics of loops - T.S. Norvell. Discussion. Index of contributors. Keyword index.