INF220 - Programspesifikasjon
Contents on this web page
The course this semester couples the theory closely to
the programming language Magnolia.
Magnolia is a new programming language tightly integrating
specifications and code
with a foundation in institution theory.
It supports high integrity programming (reliable, robust, secure)
by validating correctness and guarding every operation.
The course will cover topics like the following.
- Algebraic specifications as a means of defining API contracts.
- Institutions as a means of understanding modularisation, reuse and testing.
- Data invariants and congruences as a means of understanding data abstraction.
- Assertions as a means of understanding algorithms.
- Pre-/post-conditions as a means of understanding methods.
There is no specific text book, and the curriculum consists of
all lectures, notes, handouts, exercises, and related course material.
The following supplementary reading material gives an idea about the course contents.
- C.A.R. Hoare: Proof of correctness of data representations. Acta Informatica 1(4):271-281 (1971). DOI 10.1007/BF00289507.
- James H. Morris Jr.: Types are Not Sets. POPL 1973:120-124. DOI 10.1145/512927.512938.
- Bertrand Meyer: Applying "Design by Contract". IEEE Computer 25(10): 40-51 (1992). Scan.
- Magne Haveraaen: Institutions, property-aware programming and testing. In Proceedings of the 2007 Symposium on Library-Centric Software Design (LCSD '07). 21-30 (2007). DOI 10.1145/1512762.1512765.
- Magne Haveraaen: Magnolia Semantics - alpha release. 2014.
- Magne Haveraaen and Anya Bagge: Magnolia Tutorial - alpha release. 2014.
Additional Reading Material
For those especially interested in reading up on the background material,
the following (classical) books are recommended.
Lecturer and course responsible: Magne Haveraaen
- David Gries: The Science of Programming. Springer 1981.
Covers topic 1.
Bertrand Meyer: Object-Oriented Software Construction, 2nd Edition Prentice-Hall 1997.
Covers topic 2 and some of 3.
- Jacques Loeckx, Hans-Dieter Ehrich and Markus Wolf:
Specification of abstract data types,
Wiley Teubner, 1996,
ISBN: 0-471-95067-x, 3-519-02115-3.
Corrected chapter 10.
Covers topic 4 and some of 5.
- Ole-Johan Dahl: Verifiable programming. Prentice Hall 1992.
Covers topic 1 and much of 4.
Teaching assistant: TBD
The participants are adviced to organise study groups for discussing
the topics of the course and assist each other in solving the exercises.
Teaching starts Monday August 18 2014 (week 34),
Teaching will be in the form of lectures, exercises and
time off for self studies.
The following teaching plan is very tentative and guaranteed to change.
- Mondays 1415 - 1600 in seminar room 2104 HiB
- Tuesdays 1415 - 1600 in seminar room 2104 HiB
- Wednesdays 1215 - 1400 in seminar room 2104 HiB
The exam is planned for the end of November/beginning of December.
The exercises will be provided as the course evolves,
The course will probably be evaluated by an oral exam.
- Introduction: Magnolia overview (language and library)
Algebraic specifications: Interface, Interface morphisms, Algebra (theory)
Algebraic specifications: Expressions (theory)
- Exercise set 1 (Set theory)
Exercise set 2
Exercise set 3
- Algebraic specifications: Evaluation, Equational Specifications (theory)
Magnolia specifications: Semigroup, Monoid, Group.
- Algebraic specifications
- Algebraic specifications
- Software development
- Pre-/post conditions
- Pre-/post conditions and data invariants
- Pre-/post conditions, data invariants and congruences
- Data abstraction
Sist oppdatert 2014-05-30 by