CONTENIDO:
1. Introducing abstract machines
2. Review of set theory and logic
3. Weakest preconditions
4. Towards machine consistency
5. Parameters, sets, and constants
6. Relations
7. Functions and sequences
8. Arrays
9. Nondeterminism
10. Structuring with includes
11. Structuring with sees and uses
12. Data refinement
13. Refinement of nondeterminism
14. Proof obligations for refinements
15. Loops
16. Implementation machines
17. Case study: heapsort
18. Library machines
Answers to self tests
A. Generalised substitution language
B. Machine readable AMN
Index of machines