PSC 2017/18 (375AA, 9 CFU)
Office hours: Wednesday 15:00-17:00 or by appointment
The objective of the course is to present:
The course will cover the basic techniques for assigning meaning to programs with higher-order, concurrent and probabilistic features (e.g., domain theory, logical systems, well-founded induction, structural recursion, labelled transition systems, Markov chains, probabilistic reactive systems, stochastic process algebras) and for proving their fundamental properties, such as termination, normalisation, determinacy, behavioural equivalence and logical equivalence. Temporal and modal logics will also be studied for the specification and analysis of programs. In particular, some emphasis will be posed on modularity and compositionality, in the sense of guaranteeing some property of the whole by proving simpler properties of its parts.
There are no prerequisites, but the students are expected to have some familiarity with discrete mathematics, first-order logic, context-free grammars, and code fragments in imperative and functional style.
The evaluation will be based on written and oral exams.
The written exam is not necessary if the two (written) mid-terms exams are evaluated positively.
Registration to written exams (mandatory): Exams registration system
In the written exam the student must demonstrate
During the oral exam the student must demonstrate
|1||Tue||20/02||14:00-16:00||L1||Introduction to the course|
formal semantics, logical systems, derivations
signatures, unification problem