Lectures on the Logic of Computer Programming
Will be published approx. on 28. February 1987
Book
Paperback/Softback
53 pages
978-0-89871-164-6 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Product notice
Paperback (trade)
Dimensions
Height: 255 mm
Width: 179 mm
Thickness: 8 mm
Weight
120 gr
ISBN-13
978-0-89871-164-6 (9780898711646)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
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.
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.