Deductive Program DesignManfred Broy Springer Science & Business Media, 18/06/1996 - 470 من الصفحات Deductive program design aims at methods that guide and support the development of programs by techniques of deduction. Deduction is a well-known subject of study in logical theories. However, the application of deductive techniques in program design needs methods, heuristics, and understanding of the required forms and formats of the development result that go far beyond those found in logical theories. The summer school presents a very broad spectrum of approaches to these issues. Edsger W. Dijkstra gives a number of beautiful examples that show how to design proofs. Samson Abramsky, Simon Gay, and Rajagopal Nagarajan contribute a fundamental study founding concurrent programming on interaction categories and foundations of type theory. Tony Hoare presents unifying views on mathematical models for computing science. Unifying theories are especially important if the whole development process of programs is to be supported by deductive techniques. The rest of the contributions address applications of deductive program design methods. They are directed to different areas of application; for example Richard Bird's and Oege de Moor's algebra of programming is mainly intended for classical functional programming, and the contribution on data refinement and their transformation by David Gries considers sequential procedural programs. |
المحتوى
I | |
II | 3 |
III | 5 |
IV | 9 |
V | 13 |
VI | 15 |
VII | 19 |
VIII | 23 |
XV | 163 |
XVI | 165 |
XVII | 203 |
XVIII | 231 |
XIX | 233 |
XX | 271 |
XXI | 303 |
XXII | 349 |
طبعات أخرى - عرض جميع المقتطفات
عبارات ومصطلحات مألوفة
abstract after(door algebra algorithm alphabet assertion assignment atomic actions axioms B₁ behaviour bisimulation boolean C.A.R. Hoare calculus catamorphism cell circuit combinational component composition Computer Science concurrent conjunction connected constraints construct coupling invariant defined definition denote described Edsger W element buffer equation equivalent example execution existential quantification expression false finite formal formula function functional programming functor gate given guarded command implementation in(CS₁ initial input Interaction Categories Ipo(s Lemma Leslie Lamport model checking monotonic morphism node operations output PO(S ports Predicate Logic problem process calculus proof outline Proposition prove queue refinement relation representation represented rule S₁ safety properties satisfies semantics sequence sequential signal simulation specification SProc structure stuttering equivalent synchronous temporal logic theorem theory transform transistor transition transition relation true valid variables verification wires ΕΙ