Mathematics of Program Construction
Editat de Bernhard Mölleren Limba Engleză Paperback – 10 iul 1995
Besides five invited lectures by distinguished researchers there are presented 19 full revised papers selected from a total of 58 submissions. The general theme is the use of crisp, clear mathematics in the discovery and design of algorithms and in the development of corresponding software and hardware; among the topics addressed are program transformation, program analysis, program verification, as well as convincing case studies.
Preț: 330.79 lei
Preț vechi: 413.49 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
58.54€ • 68.64$ • 51.41£
58.54€ • 68.64$ • 51.41£
Carte tipărită la comandă
Livrare economică 06-20 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540601173
ISBN-10: 3540601171
Pagini: 488
Ilustrații: IX, 479 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540601171
Pagini: 488
Ilustrații: IX, 479 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Towards automatic parallelization of logic programs.- Functional Algorithm Design.- Mathematics of software engineering.- Program construction in intuitionistic Type Theory.- Computer-aided computing.- Derivation of parallel algorithms from functional specifications to CSP processes.- Architecture independent massive parallelization of divide-and-conquer algorithms.- Exploring summation and product operators in the refinement calculus.- An action system specification of the caltech asynchronous microprocessor.- Formal derivation of CSP programs from temporal specifications.- A compositional proof system for asynchronously communicating processes.- A graphical calculus.- A simple, efficient, and flexible implementation of flexible arrays.- Induction and recursion on datatypes.- Program construction by parts.- An initial-algebra approach to directed acyclic graphs.- Algebraic proof assistants in HOL.- Angelic termination in Dijkstra's calculus.- Extracting programs with exceptions in an impredicative type system.- Synthesizing proofs from programs in the Calculus of Inductive Constructions.- A general scheme for breadth-first graph traversal.- Specware: Formal support for composing software.- A refinement relation supporting the transition from unbounded to bounded communication buffers.- ImpUNITY: UNITY with procedures and local variables.