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 81.
xi. lappuse
... Functions from their Domain Restriction 225 Elimination of Descriptive Constructs in Applicative Programs ... Function Composition 263 264 264 267 273 6.3 6.3.1 6.3.2 6.4.1 6.4.2 Memo - ization Tabulation 6.2 Inverting the ...
... Functions from their Domain Restriction 225 Elimination of Descriptive Constructs in Applicative Programs ... Function Composition 263 264 264 267 273 6.3 6.3.1 6.3.2 6.4.1 6.4.2 Memo - ization Tabulation 6.2 Inverting the ...
xiii. lappuse
... Function occurs 418 9.3.3 Deriving an Operational Version of 8 423 9.3.4 Final Version of the Function occurs 425 9.3.5 9.3.6 Remarks on Further Development Concluding Remarks 426 426 9.4 A Text Editor 427 9.4.1 Formal Specification 429 ...
... Function occurs 418 9.3.3 Deriving an Operational Version of 8 423 9.3.4 Final Version of the Function occurs 425 9.3.5 9.3.6 Remarks on Further Development Concluding Remarks 426 426 9.4 A Text Editor 427 9.4.1 Formal Specification 429 ...
3. lappuse
... function under stated conditions for a stated period of time . robustness : The extent to which software can ... functions with a minimum consumption of computing resources . portability : The ease with which software can be transferred ...
... function under stated conditions for a stated period of time . robustness : The extent to which software can ... functions with a minimum consumption of computing resources . portability : The ease with which software can be transferred ...
14. lappuse
... function that computes for an integer 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 ...
... function that computes for an integer 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 ...
15. lappuse
... function , that determines for a set m of positions ( represented by pairs of natural numbers between 1 and n ) ... function queens . The goal we want to achieve is an efficient solution for this function . In order to reach this goal we ...
... function , that determines for a set m of positions ( represented by pairs of natural numbers between 1 and n ) ... function queens . The goal we want to achieve is an efficient solution for this function . In order to reach this goal we ...
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