Logical Derivation of Computer Programs
Primarily for use as a textbook for courses on program derivation, this presents a powerful new tool for creating error-free programs, developing a new language-based logic for procedures to derive computer programs from formal specifications. Class-tested by the author, the book has down-to-earth explanations, lots of details, cogent examples, and solved exercises.
What people are saying - Write a review
We haven't found any reviews in the usual places.
a,b)e x abbreviated annotation ae x v ae algebra of relations algebra of sets algorithm Assume Axiom b,c)e y Boolean algebra Boolean expression c.p. assignments containing only c.p. data abstraction defined Derive a nonrecursive derive a procedure element equation equivalence relation evolver Example Consider exercise exists a set finite set Following execution formal specification Hence inductive definition inductive step input iterator form k:=k-l elihw l:l lists Leibnitz rule Lemma lxl-l lyl-l m-l do p:=p+l mathematical induction natural numbers nonrecursive procedure nonrecursive program ordered pairs otherwise output Peano Postulates Problem Derive procedural derivation procedure calls gives procedure containing procedure equivalent procedure without side program derivation programming languages proof calls propositional calculus prove recursive procedure rightside procedure set operators set theory set-theoretic identities set-theoretic predicates side effects Solution sorted list subset t:=0 fi rof tail recursion Theorem topdown Va(ae variable Vc(ce while-loops x A ae