Table of Contents
Concurrency (24h, 3 ECTS)Course director: Roberto Amadio Teachers for 2015-2016
GoalsThis course introduces formal methods for reasoning about properties of concurrent systems. Topics covered change every year and include models of shared memory concurrency (Java,...), logics to reason on such systems (rely-guarantee, concurrent separation logic,...), process calculi (CCS, pi-calculus,...), models of timed and stochastic behaviour, and applications of directed algebraic topology to concurrency. Plan of the course for 2015-2016Shared memory models and logics of concurrent systems (12h)
Process calculi and related type and proof systems (12h)
French and EnglishLectures are given either in French or in English depending on the teacher. The lecture notes and the text of the examinations are in English. The students may answer in French or English. Material
Bibliography
Intership ProposalsRelated coursesSemantics (2.1, 2.2, 2.4), Concurrent algorithms (2.18.2), Concurrent programming (2.23.1, 2.37.1), Proofs of programs (2.36.1). Formalisms related to the pi-calculus are used in the modelling of cryptographic protocols (course 2.30) and of biological reactions (course 2.19). PrerequisitesIt is useful, though not strictly necessary, to have attended courses (similar to) 1-15 (Semantics) and 1-16 (Concurrency). ExamsThis year course alternates between lectures on core/introductive material (Amadio's lectures) and lectures on more specialized/research topics (Lozes' lectures). Knowledge of the core material will be checked via a final exam while the more specialized/research topics will be the subject of a home assignment. Possible teachers
Calendar 2015-2016
Previous years Year 2015-2016 Year 2014-2015 Year 2013-2014 Year 2012-2013 |