Semantics of programming languagesDF21000, 2012HT
No of lectures
~ 12 * 2h
Anybody interested in theoretical aspects of computer science and in precise reasoning about program correctness.
The course was last given
Introduction to formal description techniques for defining semantics
of programming languages.
The intention is to give a solid overview of classical approaches
to semantics of programming languages. We believe this knowledge is
necessary for everybody interested in tools and/or formal methods
dealing with program correctness.
Some degree of mathematical maturity; courses on discrete mathematics,
mathematical logic, and formal languages. Some programming
experience and familiarity with a few programming languages.
Under consideration: Optional tutorial classes (lektioner) and labs.
The core of the course:
- operational semantics (small step and big step approach)
- denotational semantics, including its mathematical foundations,
- axiomatic semantics, proving program correctness, and basics of
systematic construction of provably correct programs.
Additional subjects under consideration
Hanne Riis Nielson, Flemming Nielson: Semantics with Applications: An Appetizer. Springer, 2007.
The course is based on TDDA43/TDDD47 programmeringsteori.
Page responsible: Director of Graduate Studies