cours:2012-2013-cours2

List of available level 2 modules for the academic year 2012-13

Module	Title	Nb. H	ECTS	Period(s)	Person(s) in charge	Teaching Language	Breakable
2.1	Logique linéaire et paradigmes logiques du calcul Linear logic	48	6	1 - 2	R. Di Cosmo	3/4 French by default, 1/4 English
2.2	Modèles des langages de programmation: domaines, catégories, jeux Models of programming languages: domains, categories, games	48	6	1 - 2	P.-A. Melliès	English upon request
2.3	Concurrence Concurrency	48	6	1 - 2	R. Amadio	English upon request	Yes
2.4	Programmation fonctionnelle et systemes de types Functional programming and type systems	48	6	1 - 2	X. Leroy	French by default
2.5	Démonstration automatique Automated deduction	48	6	1 - 2	E. Contejean	French by default
2.6	Interprétation abstraite: application à la vérification et à l'analyse statique Abstract interpretation: application to verification and static analysis	48	6	1 - 2	R. Cousot	English upon request
2.7.1	Fondements des systèmes de preuves Foundations of proof systems	24	3	1	B. Werner	English upon request
2.7.2	Assistants de preuves Proof assistants	24	3	2	B. Barras	French by default
2.8	Fondements pour la vérification des systèmes temps-réel Foundations of real time systems verification	48	6	1 - 2	P. Bouyer	French by default
2.9.1	Fondements mathématiques de la théorie des systèmes infinis Mathematical foundations of the theory of infinite transition systems	24	3	1	A. Finkel	English upon request
2.9.2	Vérification algorithmique des programmes Algorithmic verification of programs	24	3	2	A. Bouajjani	English upon request
2.10	Aspects algorithmiques de la combinatoire Algorithmic aspects of combinatorics	48	6	1 - 2	G. Schaeffer	French
2.11.1	Algorithmique avancée Advanced algorithmics	24	3	1	N.Schabanel	1/2 English 1/2 English upon request
2.11.2	Complexité randomisée Randomness in Complexity	24	3	1	I. Kerenidis	English
2.12.1	Techniques in Cryptography and Cryptanalysis	24	3	1	M. Abdalla	English
2.12.2	Algorithmes arithmétiques pour la cryptologie Arithmetic algorithms for cryptology	24	3	1 - 2	F. Morain	1/3 English by default 2/3 English upon request
2.13.1	Systèmes polynomiaux, calcul formel et applications Polynomial systems, computer algebra and applications	24	3	1 - 2	J.-C. Faugère	English by default
2.13.2	Codes correcteurs d'erreurs et applications à la cryptographie Error correcting codes and applications to cryptography	24	3	1 - 2	D. Augot	??
2.14.1	Analyse Géométrique des Données Computational Geometry Learning	24	3	1	M. Yvinec	English upon request
2.15	Analyse d'algorithmes Analysis of algorithms	48	6	1-2	M. Soria	French
2.16	Modélisation par automates finis	48	6	1 - 2	J. Sakarovitch	English upon request
2.17.1	Fondements sur la modélisation des réseaux Foundations of network models	24	3	2	J. Mairesse	English upon request
2.18.1	Algorithmique distribuée pour les réseaux Distributed algorithms for the networks	24	3	1 - 2	P. Fraigniaud	French by default
2.18.2	Algorithmique distribuée avec mémoire partagée	24	3	1	C. Delporte	French
2.19	Méthodes informatiques pour la biologie systémique et synthétique Computational methods for systems and synthetic biology	48	6	1 - 2	F. Fages	French by default
2.20.1	Techniques de théorie des jeux en informatique Game theory techniques in computer science	24	3	1 - 2	W. Zielonka	1/2 English 1/2 English upon request
2.20.2	Fondations mathématiques de la théorie des automates Mathematical foundations of automata theory	24	3	1 - 2	J.-E. Pin	English upon request
2.22	Algorithmes efficaces en calcul formel Efficient algorithms in computer algebra	48	6	1 - 2	B. Salvy	French	Yes
2.23.1	Systèmes synchrones Synchronous systems	24	3	1	M. Pouzet	English upon request
2.24.1	Optimisation Optimization	24	3	1 - 2	Ch. Durr	1/2 English upon request, 1/2 English
	2.25.1	Vision algorithmique I: Reconstruction 3D	24	3	Available at MVA	R. Keriven
2.26.2	Gestion de données sur le web Web data management	24	3	2	S. Abiteboul	English upon request
2.27.1	Structures Informatiques et Logiques pour la Modélisation Linguistique	24	3	1	S. Schmitz	English upon request
2.29.1	Algorithmique des graphes Graph algorithms	24	3	1 - 2	M. Habib	French
2.30	Protocoles cryptographiques : preuves formelles et calculatoires Cryptographic protocols: computational and symbolic proofs	48	6	1 - 2	H. Comon-Lundh	English upon request	Yes
2.31.1	Algorithmique et complexité des problèmes de satisfaction de contraintes Constraint Satisfaction Problems: algorithms and complexity	24	3	1 - 2	M. Hermann	1/2 English by default 1/2English upon request
2.33.1	Théorie des calculs Theory of computations	24	3	1 - 2	O. Bournez	English upon request
2.34.1	Informatique quantique et applications Quantum information and applications	24	3	2	S. Laplante	English upon request
2.36.1	Preuve de programmes Proofs of programs	24	3	2	C. Marché	English upon request
2.37.1	Sémantique, langages et algorithmes pour la programmation multicore Semantics, languages and algorithms for multicore programming	24	3	2	A. Cohen	English
2.38.1	Algorithmes pour les graphes plongés Algorithms for embedded graphs	24	3	1	Eric Colin de Verdiere	French by default

Semantics of the teaching languages annotations:

“English upon request” means that the module will be taught in French, unless one non-French speaking student requests English
“French by Default” means that the module is taught in French, unless at least one non-French speaking student requests English and no French speaking students requests French
“English by Default” is obtained by transposing “French” and “English” in the above case.
“English” (resp. “French”) means that the module will be taught in English (resp. French) independently of the students attending. Most of the time, however, some of the teaching material is available in French (resp. English)

For a more detailed information on the teaching language of each module, as well as concerning the language of the exams, please look at the web page of the module.

The following table summarizes the duration of each module and the weekly teaching load. The modules lasting for 8 or 16 weeks may organize optional exercise classes before the exam.

Module	Nb.Weeks	Nb hours each week	Module	Nb.Weeks	Nb hours each week
2.1	20	2.5	2.18.1	16	1.5
2.2	16	3	2.18.2	8	3
2.3	20	2.5	2.19	16	3
2.4	20	2.5	2.20.1	16	1.5
2.5	16	3	2.20.2	16	1.5
2.6	16	3	2.22	16	3
2.7.1	8	3	2.23.1	8	3
2.7.2	10	2.5	2.24.1	16	1.5
2.8	16	3	2.26.2	10	2.5
2.9.1	10	2.5	2.27.1	8	3
2.9.2	8	3	2.29.1	16	1.5
2.10	20	2.5	2.30	16	3
2.11.1	8	3	2.31.1	16	1.5
2.11.2	8	3	2.33.1	16	1.5
2.12.1	8	3	2.34.1	8	3
2.12.2	16	1.5	2.35.1	8	3
2.13.1	16	1.5	2.36.1	8	3
2.13.2	16	1.5	2.37.1	8	3
2.14.1	10	2.5	2.38.1	8	3
2.15	16	3
2.16	16	3
2.17.1	10	2.5