Temporal Logic of Programs
Published on 17. November 2011
Book
Paperback/Softback
VIII, 148 pages
978-3-642-71551-8 (ISBN)
Description
Introduction to the temporal logic of - in particular paral- lel - programs.Divided into three main parts: - Presenta- tion of the pure temporal logic: language, semantics, and proof theory; - Representation of programs and their proper- ties within the language of temporal logic; - Application of the logical apparatus to the verification of program proper- ties including a new embedding of Hoare's logic into the temporal framework.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1987
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Lower undergraduate
Illustrations
VIII, 148 p.
Dimensions
Height: 244 mm
Width: 170 mm
Thickness: 9 mm
Weight
289 gr
ISBN-13
978-3-642-71551-8 (9783642715518)
DOI
10.1007/978-3-642-71549-5
Schweitzer Classification
Other editions
Additional editions
Fred Kröger
Temporal Logic of Programs
Book
04/1987
Springer
€85.55
Article exhausted; check different version
Content
Logic and Programs.- Historical Remarks.- Some Concepts and Notions of Classical Logic.- I. Propositional Temporal Logic.- 1. A Language TTA of Propositional Temporal Logic.- 2. Semantics of TTA.- 3. Temporal Logical Laws.- 4. Some Further Temporal Operators.- II. Axiomatization of Propositional Temporal Logic.- 5. The Formal System ?TA.- 6. Completeness of ?TA.- 7. Induction Principles.- III. First-Order Temporal Logic.- 8. First-Order Temporal Languages and Their Semantics.- 9. The Formal System ?TP.- 10. The Principle of Well-Founded Orderings.- 11. Additional Propositional Variables.- IV. Temporal Semantics of Programs.- 12. Programs.- 13. Execution Sequences of Programs.- 14. Program Axioms.- 15. Description of Program Properties.- V. Invariance and Precedence Properties of Programs.- 16. The Basic Invariant Method.- 17. Examples of Applications.- 18. Invariant Methods for Precedence Properties.- 19. Examples of Applications.- VI. Eventuality Properties of Programs.- 20. Fair Execution Sequences.- 21. The Finite Chain Reasoning Method.- 22. The Method of Well-Founded Orderings.- 23. Examples of Applications.- VII. Special Methods for Sequential Programs.- 24. Hoare's Calculus.- 25. The Intermittent Assertion Method.- 26. Examples of Applications.- Bibliographical Remarks.- Appendix: Table of Laws and Rules.- References.