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 63.
11. lappuse
... 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 of the ...
... 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 of the ...
14. lappuse
... . 4.5.4 . It should be further mentioned at this point that applicative languages are particularly well - suited for transformational programming due to their strong algebraic properties ( see for example [ Backus 78 ] 14 1. Introduction.
... . 4.5.4 . It should be further mentioned at this point that applicative languages are particularly well - suited for transformational programming due to their strong algebraic properties ( see for example [ Backus 78 ] 14 1. Introduction.
15. lappuse
A Formal Approach to Software Development Helmut A. Partsch. algebraic properties ( see for example [ Backus 78 ] , [ Bird 84 , 87 ] , [ Hoare et al . 87 ] , [ Meertens 86 ] , [ Roscoe , Hoare 86 ] ) . They are therefore the appropriate ...
A Formal Approach to Software Development Helmut A. Partsch. algebraic properties ( see for example [ Backus 78 ] , [ Bird 84 , 87 ] , [ Hoare et al . 87 ] , [ Meertens 86 ] , [ Roscoe , Hoare 86 ] ) . They are therefore the appropriate ...
23. lappuse
... properties necessary to cope with the problems in building the requirements definition on the one hand , and properties of good requirements definitions on the other . - Problems in building a requirements definition include ...
... properties necessary to cope with the problems in building the requirements definition on the one hand , and properties of good requirements definitions on the other . - Problems in building a requirements definition include ...
30. lappuse
... properties , regular expressions are restricted to the description of strings only . They are formed from some character set by the operations alternation , composition and closure . The data structure for weighted information could be ...
... properties , regular expressions are restricted to the description of strings only . They are formed from some character set by the operations alternation , composition and closure . The data structure for weighted information could be ...
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