Specification and Transformation of Programs: A Formal Approach to Software Development
Springer 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.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Formal Problem Specification
Basic Transformation Techniques
From Descriptive Specifications to Operational Ones
Modification of Applicative Programs
Citi izdevumi - Skatīt visu
abstract algebraic types algorithm applicability conditions arbitrary arguments assertion axioms based on BOOL basic Bauer binary tree bintree buffer cleartext clist command constructs data structures data types defined definedness definition denotes derive directed graphs dummy elem element elsf embedding emptyq endoftype EQUIV(m example expression false finite firstu folding formal specification funct f function function composition further given graph G hib(a imperative program implementation input instantiation introduced language lob(a mmap mode mset nati natmap natsequ natural numbers natz node nodemap nodesequ nodeset nodex non-empty object kinds Obviously oldbal operations particular Partsch predicate preds(x priority queues problem program transformations properties requirements engineering respective restt Sect semantic sequ sequence simplification sort step strategy string substs tail recursion technique termstring transformation rules transformational programming transition true H tuple type scheme unfold unfold/fold universal quantification variant yields