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 27.
28. lappuse
... directed graph where the arcs indicate causal relationships ( the control flow ) between individual operations ( represented by the nodes of the graph ) . The operations are represented by boxes , and their meaning is info check buffer ...
... directed graph where the arcs indicate causal relationships ( the control flow ) between individual operations ( represented by the nodes of the graph ) . The operations are represented by boxes , and their meaning is info check buffer ...
31. lappuse
... directed graph and transitions are represented as arcs between two nodes . Arcs are labeled with conditions that cause transitions . Transition diagrams and transition tables are also representations for finite state automata [ Hopcroft ...
... directed graph and transitions are represented as arcs between two nodes . Arcs are labeled with conditions that cause transitions . Transition diagrams and transition tables are also representations for finite state automata [ Hopcroft ...
32. lappuse
... directed graph . The two types of nodes , which both also can be labeled , are called places ( represented by circles ) and transitions ( represented by bars or boxes ) . Arcs only lead from one node type to a respective other one . An ...
... directed graph . The two types of nodes , which both also can be labeled , are called places ( represented by circles ) and transitions ( represented by bars or boxes ) . Arcs only lead from one node type to a respective other one . An ...
41. lappuse
... directed graphs consisting of various types of nodes for describing element types and arcs between these nodes . For our sample problem we might have the R - net of Fig . 2.19 which is the graphical counterpart of the textual ...
... directed graphs consisting of various types of nodes for describing element types and arcs between these nodes . For our sample problem we might have the R - net of Fig . 2.19 which is the graphical counterpart of the textual ...
45. lappuse
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
Esat sasniedzis šīs grāmatas aplūkošanas reižu limitu.
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