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
29. lappuse
... data structures . For our buffer example , the activities in connection with storing a piece of information into the buffer could be represented by a flowchart as in Fig . 2.3 . Flowcharts can be used on arbitrary levels of abstraction ...
... data structures . For our buffer example , the activities in connection with storing a piece of information into the buffer could be represented by a flowchart as in Fig . 2.3 . Flowcharts can be used on arbitrary levels of abstraction ...
30. lappuse
... data structures that can be defined adequately by grammars , they are used also in connection with requirements ... data structure for weighted information could be described by the production rules weighted_information :: = information ...
... data structures that can be defined adequately by grammars , they are used also in connection with requirements ... data structure for weighted information could be described by the production rules weighted_information :: = information ...
31. lappuse
... data structures . Due to their restricted range of application , however , they should be used only in addition to or as part of other concepts for formulating requirements . 2.2.5 Finite State Mechanisms Like grammars , finite state ...
... data structures . Due to their restricted range of application , however , they should be used only in addition to or as part of other concepts for formulating requirements . 2.2.5 Finite State Mechanisms Like grammars , finite state ...
34. lappuse
... data structures . For Petri nets to be of practical use in the development of software , further development of methodology and tools is necessary . 2.2.7 SA / SADT SA ( Structured Analysis ) , the language of the methodology SADT ...
... data structures . For Petri nets to be of practical use in the development of software , further development of methodology and tools is necessary . 2.2.7 SA / SADT SA ( Structured Analysis ) , the language of the methodology SADT ...
38. lappuse
... structures in PSL is by texts within the PROCEDURE statement of a PROCESS segment . In addition to such a verbal ... data structures , PSL allows the description. Figure 2.17 . PSL description in graphical form Figure 2.18 . PSL data ...
... structures in PSL is by texts within the PROCEDURE statement of a PROCESS segment . In addition to such a verbal ... data structures , PSL allows the description. Figure 2.17 . PSL description in graphical form Figure 2.18 . PSL data ...
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