Themes covered by the level 2 modules (this was last updated in 2013)

MPRI provides excellent coverage of the following themes in Computer Science:

COCO = Computability and Complexity,

ALGO = Algorithms,

COCA = Combinatorics and Computer Algebra,

CCSE = Cryptography, Coding, and Security,

LSPR = Logics and Semantics of Programs,

AUDE = Automated Deduction,

AUFL = Automata and Formal Languages,

SPAV = System Programming, Analysis, and Verification.

The following table roughly summarizes the main themes covered by each level 2 module.

Module COCOALGOCOCACCSELSPRAUDEAUFLSPAV
2.1 Linear logic X X
2.2 Models of programming languages: domains, categories, games X
2.3 Concurrency X X
2.4 Functional programming and type systems X X
2.5.1 Automated deduction X
2.6 Abstract interpretation: application to verification and static analysis X X
2.7.1 Foundations of proof systems X X
2.7.2 Proof assistants X
2.8 Foundations of real time systems verification X X
2.9.1 Mathematical foundations of the theory of infinite transition systems X X X
2.9.2 Algorithmic verification of programs X X X
2.10 Algorithmic aspects of combinatorics X X
2.11.1 Randomized algorithms X X
2.11.2 Randomness in complexity X X
2.12.1 Techniques in cryptography and cryptanalysis X
2.12.2 Arithmetic algorithms for cryptology X
2.13.1 Polynomial systems, computer algebra and applications X X
2.13.2 Error correcting codes and applications to cryptography X
2.14.1 Computational geometry learning X
2.15 Analysis of algorithms X X
2.16 Finite automata modelling X X
2.17.1 Foundations of network models X X
2.18.1 Distributed algorithms on networks X X
2.18.2 Distributed algorithms on shared memory X X
2.19 Computational methods for systems and synthetic biology X
2.20.1 Game theory techniques in computer science X
2.20.2 Mathematical foundations of automata theory X
2.22 Efficient algorithms in computer algebra X X X
2.23.1 Synchronous systems X X
2.24.1 Optimization X
2.26.1 Logic, descriptive complexity and database theory X X X
2.26.2 Web data management X X X
2.27.1 Computational structures and logics for natural language modelling X
2.29.1 Graph algorithms X
2.30 Cryptographic protocols: computational and symbolic proofs X X
2.31-1 Constraint satisfaction problems: algorithms and complexity X X X
2.33.1 Theory of computations X X
2.34.1 Quantum information and applications X X
2.35.1 Constraint programming X X
2.36.1 Proofs of programs X X
2.37.1 Semantics, languages and algorithms for multicore programming X X
2.38.1 Algorithms and combinatorics for geometric graphs X X
Module COCOALGOCOCACCSELSPRAUDEAUFLSPAV