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 90.
1. lappuse
... respective wordings . [ Boehm 76 ] defines software engineering as the practical application of scientific knowledge to the design and construction of computer programs and the associated documentation required to develop , operate ...
... respective wordings . [ Boehm 76 ] defines software engineering as the practical application of scientific knowledge to the design and construction of computer programs and the associated documentation required to develop , operate ...
10. lappuse
... respective point of application , - derivation of new rules ( if necessary ) , including the respective proofs of their correctness . This particular view of the software development process and the separation of work between man and ...
... respective point of application , - derivation of new rules ( if necessary ) , including the respective proofs of their correctness . This particular view of the software development process and the separation of work between man and ...
16. lappuse
... respective first components should be distinct values between 1 and n ( since no two queens can be on the same file ) . Hence , we can apply a simple data type transformation by which the set m from above is substituted by an indexed ...
... respective first components should be distinct values between 1 and n ( since no two queens can be on the same file ) . Hence , we can apply a simple data type transformation by which the set m from above is substituted by an indexed ...
26. lappuse
... respective discipline . Thus , for example , in house construction nobody would promote the absurd claim for a formalism that would allow an arbitrary future house owner to produce a document that is binding for the craftsmen's work ...
... respective discipline . Thus , for example , in house construction nobody would promote the absurd claim for a formalism that would allow an arbitrary future house owner to produce a document that is binding for the craftsmen's work ...
27. lappuse
... respective basic ideas and to give some hints on the strengths and weaknesses of the various approaches in order to have a somewhat more profound background for our particular treatment of formal specifications within the next chapter ...
... respective basic ideas and to give some hints on the strengths and weaknesses of the various approaches in order to have a somewhat more profound background for our particular treatment of formal specifications within the next chapter ...
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