Predicate calculus and program semantics / Edsger W. Dijkstra and Carel S. Scholten.
Material type:
TextSeries: Texts and monographs in computer sciencePublication details: New York : Springer-Verlag, c1990.Description: x, 220 p. : ill. ; 25 cmISBN: - 0387969578
- 005.1015113 23 D575
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|
| Books | ISI Library, Kolkata | 005.1015113 D575 (Browse shelf(Opens below)) | Available | C26431 |
Browsing ISI Library, Kolkata shelves Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | |||||||
| 005.101 M134 Introduction to decision logic tables | 005.101 ক৯৩ ব বেসিক প্রোগ্রামিং | 005.10151 B285 Algorithmic complexity | 005.1015113 D575 Predicate calculus and program semantics / | 005.1015113 M696 Logics in computer science: a study on extensions of temporal and strategic logics/ | 005.1015113 N451 Logic for applications / | 005.103 M147 McGraw Hill personal computer programming encyclopedia : languages and operating systems |
Includes index.
1. On structures--
2. On substitution and replacement--
3. On functions and equality--
4. On our proof format--
5. The calculus of boolean structures--
6. Some properties of predicate transformers--
7. Semantics of straight-line programs--
8. Equations in predicates and their extreme solutions--
9. Semantics of repetitions--
10. Operational considerations--
11.Converse predicate transformers--
12. The strongest postcondition--
Index.
This text gives a foundation of predicate transformer semantics by making extensive use of the predicate calculus. The semantics of the repetitive construct is defined in terms of weakest and strongest solutions in terms of the weakest precondition and the weakest liberal precondition.
There are no comments on this title.
