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 89.
x. lappuse
... Expressions Choice and Description 3.4.4 Set Comprehension ...... .. 3.4.5 Computation Structures 3.5 Structuring and Modularization 3.6 Examples 84 95 98 100 107 109 113 115 117 119 3.6.1 Recognizing Palindromes 120 3.6.2 A Simple ...
... Expressions Choice and Description 3.4.4 Set Comprehension ...... .. 3.4.5 Computation Structures 3.5 Structuring and Modularization 3.6 Examples 84 95 98 100 107 109 113 115 117 119 3.6.1 Recognizing Palindromes 120 3.6.2 A Simple ...
17. lappuse
... expression by an equivalent function call , we obtain the recursive algorithm funct qu = ( sequ of [ 1..n ] t : It ≤n nconf ( t ) ) bool : if Id = n then true else [ 1..n ] p : nc ( t + p ) △ qu ( t + p ) fi . In order to get rid of ...
... expression by an equivalent function call , we obtain the recursive algorithm funct qu = ( sequ of [ 1..n ] t : It ≤n nconf ( t ) ) bool : if Id = n then true else [ 1..n ] p : nc ( t + p ) △ qu ( t + p ) fi . In order to get rid of ...
28. lappuse
... expressions , finite state mechanisms , and Petri nets ) that are frequently used in requirements engineering , although they have been introduced for rather different purposes . These formalisms have further in common that they are ...
... expressions , finite state mechanisms , and Petri nets ) that are frequently used in requirements engineering , although they have been introduced for rather different purposes . These formalisms have further in common that they are ...
30. lappuse
... expressions , were originally introduced for the precise ( formal ) description of syntax and parts of the semantics of programming ... expression ( ( info 1 | info 2 | info 3 390 2. Requirements Engineering Formal Languages and Grammars.
... expressions , were originally introduced for the precise ( formal ) description of syntax and parts of the semantics of programming ... expression ( ( info 1 | info 2 | info 3 390 2. Requirements Engineering Formal Languages and Grammars.
31. lappuse
... expression can be extended to allow modeling of concurrency . One common definition of the effect of concurrent ... expressions for P1 and P2 can be specified using an operation known as the shuffle operator . The resulting expressions ...
... expression can be extended to allow modeling of concurrency . One common definition of the effect of concurrent ... expressions for P1 and P2 can be specified using an operation known as the shuffle operator . The resulting expressions ...
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