Specification and Transformation of Programs: A Formal Approach to Software DevelopmentSpringer Science & Business Media, 2012. gada 6. dec. - 493 lappuses "Specification and transformation of programs" is short for a methodology of software development where, from a formal specification of a problem to be solved, programs correctly solving that problem are constructed by stepwise application of formal, semantics-preserving transformation rules. The approach considers programming as a formal activity. Consequently, it requires some mathematical maturity and, above all, the will to try something new. A somewhat experienced programmer or a third- or fourth-year student in computer science should be able to master most of this material - at least, this is the level I have aimed at. This book is primarily intended as a general introductory textbook on transformational methodology. As with any methodology, reading and understanding is necessary but not sufficient. Therefore, most of the chapters contain a set of exercises for practising as homework. Solutions to these exercises exist and can, in principle, be obtained at nominal cost from the author upon request on appropriate letterhead. In addition, the book also can be seen as a comprehensive account of the particular transformational methodology developed within the Munich CIP project. |
No grāmatas satura
1.5. rezultāts no 76.
xi. lappuse
... Grammars 6.6.2 The Algorithm by Cocke , Kasami and Younger 6.6.3 Cycles in a Graph 6.6.4 Hamming's Problem Exercises 306 310 310 312 316 319 322 7. Transformation of Procedural Programs 326 7.1 From Tail Recursion Contents XI.
... Grammars 6.6.2 The Algorithm by Cocke , Kasami and Younger 6.6.3 Cycles in a Graph 6.6.4 Hamming's Problem Exercises 306 310 310 312 316 319 322 7. Transformation of Procedural Programs 326 7.1 From Tail Recursion Contents XI.
xii. lappuse
... Algorithm 405 9.1.1 Formal Problem Specification 405 ..... 9.1.2 Derivation of an Operational Specification 405 9.1 ... Algorithm for the Simple Problem 411 9.2.3 Development of an Algorithm for the Generalized Problem .. 414 9.3 9.3.1 ...
... Algorithm 405 9.1.1 Formal Problem Specification 405 ..... 9.1.2 Derivation of an Operational Specification 405 9.1 ... Algorithm for the Simple Problem 411 9.2.3 Development of an Algorithm for the Generalized Problem .. 414 9.3 9.3.1 ...
7. lappuse
... ALGORITHMS - OPTIMIZING - COMPILING USE AUTOMATED SYSTEM TO APPLY THE TRANSFORMATIONS USE DEVELOPER ( AND / OR ... algorithm , by nature , has to be precisely defined and fully detailed to each single instruction . This situation ...
... ALGORITHMS - OPTIMIZING - COMPILING USE AUTOMATED SYSTEM TO APPLY THE TRANSFORMATIONS USE DEVELOPER ( AND / OR ... algorithm , by nature , has to be precisely defined and fully detailed to each single instruction . This situation ...
11. lappuse
... algorithms ) and deduction - oriented verification of programs ' correctness . Technically , the various approaches are different with respect to - --- kinds of languages used for formulating problems and algorithms ( new languages ...
... algorithms ) and deduction - oriented verification of programs ' correctness . Technically , the various approaches are different with respect to - --- kinds of languages used for formulating problems and algorithms ( new languages ...
13. lappuse
... algorithm . Basic building blocks for formulating algorithms are here the mathematical notion of a function , of conditional , and of recursion . However , even disregarding efficiency aspects or the fact that applicative languages are ...
... algorithm . Basic building blocks for formulating algorithms are here the mathematical notion of a function , of conditional , and of recursion . However , even disregarding efficiency aspects or the fact that applicative languages are ...
Saturs
1 | |
19 | |
Formal Problem Specification | 56 |
Basic Transformation Techniques | 149 |
From Descriptive Specifications to Operational Ones | 189 |
Modification of Applicative Programs | 263 |
Rearrangement of Statements | 339 |
4 | 345 |
Transformation of Data Structures | 352 |
3 | 359 |
4 | 381 |
6 | 398 |
Complete Examples | 404 |
References | 456 |
Index | 475 |
Citi izdevumi - Skatīt visu
Specification and Transformation of Programs: A Formal Approach to Software ... Helmut A. Partsch Ierobežota priekšskatīšana - 1990 |
Specification and Transformation of Programs: A Formal Approach to Software ... Helmut A. Partsch Ierobežota priekšskatīšana - 1990 |
Bieži izmantoti vārdi un frāzes
abstract algebraic types algorithm amount(firstt applicability conditions arbitrary arguments assertion axioms based on BOOL Bauer binary tree bintree buffer clist command constructs data structures data types defined definedness definition denotes derive directed graphs dummy E₁ elem element elsf embedding emptyq endoftype example expression false finite firstu folding formal specification funct f function function composition further given hib(a imperative program implementation input instantiation introduced isdef(b language lob(a mmap mode mset natmap natsequ natural numbers node nodemap nodesequ nodeset object kinds Obviously oldbal operations particular Partsch Petri net predicate preds(x priority queues problem program transformations properties respective restt Sect semantic sequ sequence simplification sort step strategy string subst Syntactic constraints t₁ t₂ tail recursion technique termstring transformation rules transition true tuple unfold unfold/fold universal quantification variant yields