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 70.
vi. lappuse
... semantics . Formal semantics is an indispensable prerequisite for transformational programming as a formally based activity . However , most of the technical information contained in this book is easily transferable to almost everyone's ...
... semantics . Formal semantics is an indispensable prerequisite for transformational programming as a formally based activity . However , most of the technical information contained in this book is easily transferable to almost everyone's ...
x. lappuse
... Semantic Foundations . 149 4.2 Notational Conventions 154 4.2.1 Program Schemes 154 4.2.2 Transformation Rules 156 4.2.3 Program Developments 158 4.3 The Unfold / Fold System 159 4.4 Further Basic Transformation Rules 163 4.4.1 ...
... Semantic Foundations . 149 4.2 Notational Conventions 154 4.2.1 Program Schemes 154 4.2.2 Transformation Rules 156 4.2.3 Program Developments 158 4.3 The Unfold / Fold System 159 4.4 Further Basic Transformation Rules 163 4.4.1 ...
9. lappuse
... semantics - preserving 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 ...
... semantics - preserving 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 ...
10. lappuse
... semantics - preserving 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 ...
... semantics - preserving 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 ...
11. lappuse
... semantic properties or mathematical theorems ) ; different views of the correctness of a transformation rule ( from intuitively correct up to mathematically correct on the basis of a formal semantic definition ) ; contents and structure ...
... semantic properties or mathematical theorems ) ; different views of the correctness of a transformation rule ( from intuitively correct up to mathematically correct on the basis of a formal semantic definition ) ; contents and structure ...
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