A Discipline of ProgrammingExecutional abstraction; The role of programming languages; States and their characterization; The characterization of semantics; The semantic characterization of a programming language; Two theorems; On the design of properly terminating; Euclid's algorithm revisited; The formal treatment of some small examples; The linear search theorem; The problem of the next permutation. |
Contents
PROGRAMMING LANGUAGE | 24 |
5 | 37 |
EUCLIDS ALGORITHM REVISITED | 45 |
Copyright | |
10 other sections not shown
Other editions - View all
Common terms and phrases
activity algorithm allowed alternative answer argument array assignment begin belong boundary branches called chapter computation concerns condition connected consider constant construct correct decrease defined definition edges element empty equal established example execution exists expression face fact final formal function give given glocon guaranteed guarded guarded command holds hull implies increase initial inner block inspect instance integer introduce invariant language lead least machine means mechanism occur operation pebble position possible post-condition predicate privar problem proved question reason record regarded relation remaining remark repetitive construct require respect result satisfying seems semantics sequence solution space statement strong component subset termination theorem tion transformer true variable vertex vertices vir int wp(S
References to this book
Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan No preview available - 2004 |
Model Driven Architecture: Applying MDA to Enterprise Computing David S. Frankel No preview available - 2003 |