Contact us on (02) 8445 2300
For all customer service and order enquiries

Woodslane Online Catalogues

9780898711646 Academic Inspection Copy

Lectures on the Logic of Computer Programming

Description
Table of
Contents
Google
Preview
This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification.
Partial correctness: Invariant method Subgoal method Subgoal method versus invariant method Termination: Well-founded ordering method The multiset ordering Total correctness Intermittent method Systematic program annotation Range of Individual variables Relation between variables Control invariants Debugging Termination and run-time analysis Synthesis of programs: The weakest precondition operator Transformation rules Simultaneous-goal principle Conditional-formation principle Recursion-formulation principle Generalization Program modification Comparison with structured programming Termination of production systems: Examples: Associativity Example: Distribution system Differentiation system Nested Multisets.
Google Preview content