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 51.
vii. lappuse
... transition to an imperative program , is also discussed . Chapter 7 elaborates on the transition from applicative to imperative programs . As this is a meanwhile well understood area , only a few , representative techniques are given ...
... transition to an imperative program , is also discussed . Chapter 7 elaborates on the transition from applicative to imperative programs . As this is a meanwhile well understood area , only a few , representative techniques are given ...
xii. lappuse
... Transition to Procedural Constructs for Particular Data Types 395 8.6 An Example : Cycles in a Graph 8.7 Exercises 398 401 9. Complete Examples 404 9.1 Warshall's Algorithm 405 9.1.1 Formal Problem Specification 405 ..... 9.1.2 ...
... Transition to Procedural Constructs for Particular Data Types 395 8.6 An Example : Cycles in a Graph 8.7 Exercises 398 401 9. Complete Examples 404 9.1 Warshall's Algorithm 405 9.1.1 Formal Problem Specification 405 ..... 9.1.2 ...
9. lappuse
... transitions should be allowed . This is the basic idea of transformational programming as illustrated in Fig . 1.11 . The approach of transformational programming has quite a number of obvious benefits : since every transition is known ...
... transitions should be allowed . This is the basic idea of transformational programming as illustrated in Fig . 1.11 . The approach of transformational programming has quite a number of obvious benefits : since every transition is known ...
10. lappuse
... transitions However , it should not be concealed that these benefits do not come free but require the investment of time , effort and discipline . Consequently , applying this methodology only pays in connection with applications where ...
... transitions However , it should not be concealed that these benefits do not come free but require the investment of time , effort and discipline . Consequently , applying this methodology only pays in connection with applications where ...
12. lappuse
... transitions between the specification and all intermediate versions of the program are done exclusively by applying transformation rules , the correctness of which is proved with respect to the semantics of the language used . In this ...
... transitions between the specification and all intermediate versions of the program are done exclusively by applying transformation rules , the correctness of which is proved with respect to the semantics of the language used . In this ...
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