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
... transition tables ( Sect . 2.2.5 ) . A decision table is a matrix that is segmented into four quadrants . The rows in the upper half of the matrix state individual conditions together with possible values ( e.g. Y = yes , N = no ...
... transition tables ( Sect . 2.2.5 ) . A decision table is a matrix that is segmented into four quadrants . The rows in the upper half of the matrix state individual conditions together with possible values ( e.g. Y = yes , N = no ...
31. lappuse
... Transition diagrams are an alternate representation for transition tables . In a transition diagram , states are represented as nodes in a finite , directed graph and transitions are represented as arcs between two nodes . Arcs are ...
... Transition diagrams are an alternate representation for transition tables . In a transition diagram , states are represented as nodes in a finite , directed graph and transitions are represented as arcs between two nodes . Arcs are ...
32. lappuse
... transition tables ( or diagrams ) can be combined into finite state mechanisms for specification of the functional behavior of software systems [ Babb , Tripp 80 ] . Using a finite state mechanism , a system is described by a data flow ...
... transition tables ( or diagrams ) can be combined into finite state mechanisms for specification of the functional behavior of software systems [ Babb , Tripp 80 ] . Using a finite state mechanism , a system is described by a data flow ...
33. lappuse
... transition . If , as above , tokens have no internal structure , the corresponding Petri nets are called place / transition nets . Modeling communication in our sample problem is one of the standard examples used to illustrate the idea ...
... transition . If , as above , tokens have no internal structure , the corresponding Petri nets are called place / transition nets . Modeling communication in our sample problem is one of the standard examples used to illustrate the idea ...
34. lappuse
... transition ( which is restricted by the validity of the input condition for the input tokens ) new values for the output tokens are computed according to the output condition . For further details , see for example [ Reisig 85 ] . In ...
... transition ( which is restricted by the validity of the input condition for the input tokens ) new values for the output tokens are computed according to the output condition . For further details , see for example [ Reisig 85 ] . In ...
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