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
xii. lappuse
... Arguments of Functions 8.5.2 " Attribution " 8.5.3 Compositions 381 386 ... 387 391 394 8.5.4 Transition to Procedural Constructs for Particular Data Types 395 8.6 An Example : Cycles in a Graph 8.7 Exercises 398 401 9. Complete ...
... Arguments of Functions 8.5.2 " Attribution " 8.5.3 Compositions 381 386 ... 387 391 394 8.5.4 Transition to Procedural Constructs for Particular Data Types 395 8.6 An Example : Cycles in a Graph 8.7 Exercises 398 401 9. Complete ...
14. lappuse
... argument n , which must be greater or equal to 0 , a pair consisting of a real number ( the mantissa ) and an integer number ( the exponent ) . It is defined by two auxiliary functions fac and logrep . The function fac computes the ...
... argument n , which must be greater or equal to 0 , a pair consisting of a real number ( the mantissa ) and an integer number ( the exponent ) . It is defined by two auxiliary functions fac and logrep . The function fac computes the ...
16. lappuse
... argument of qu , yields the original problem . The symbol " + " is used to denote the concatenation of two sequences ; below , we will also use it for the addition of an element to a sequence . Our next efforts aim at finding a ...
... argument of qu , yields the original problem . The symbol " + " is used to denote the concatenation of two sequences ; below , we will also use it for the addition of an element to a sequence . Our next efforts aim at finding a ...
50. lappuse
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
57. lappuse
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
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