Clément Pit-ClaudelTeaching & PhD PhD Students Yawen Guan, Kacper Feliks Korban, Can Cebeci, Alexandre Pinazza, Shardul Chiplunkar Courses Interactive Theorem Proving Project CS-642 A project-focused introduction to interactive theorem proving. Interactive theorem proving CS-428 A hands-on introduction to interactive theorem proving, computer-checked mathematics, compiler verification, proofs as programs, dependent types, and proof automation.Come learn how to write computer-checked proofs an
Simon GuilloudExpertise
My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as probabilistic proofs, type theory, quantum computing and more.
Expertise
My main domains of research are proof assistants and algorithms for logic-related problems.I also have interests in various areas of computer science and mathematics and their applicability in proof systems such as
Florian Karl RichterCurriculum vitae You can download my CV here
ResearchResearch Fields Ergodic Theory, Combinatorics, Number TheoryList of Publications Open-access preprints and e-prints of all my publications are freely available on arXiv ↗ .An inverse theorem for sumsets of sets of positive density in the integersEthan Ackelsberg, Florian K. Richter submitted, 117 pageslink ↗Weighted averages of arithmetic functions and applications to equidistributionVitaly Bergelson, Michael Reilly, Florian K. Richter submitted, 29 page
Thomas Georges Pierre VidickTeaching & PhD PhD Students Itammar Steinberg, Aviv Taller Courses Formal Mathematics with Lean and AI CS-643 This graduate course provides an introduction to using Lean proof assistant to formalize mathematical definitions and theorems. We will have lectures on foundations (formal proofs, dependent type theory), learn about practice (proof tactics, use of AI, etc) and work on a formalization project. Introduction to quantum computation CS-308 The course introduces the para
Maryna ViazovskaMaryna Viazovska did her bachelor studies at the Kyiv National Taras ShevchenkoUniversity and completed her MSc at the Technical University Kaiserslautern.She obtained her PhD in 2013 in Bonn.She was a postdoctoral researcher at the Institut des Hautes Etudes Scientifiquesand at the Humboldt University of Berlin, and in 2017 was a Minerva DistinguishedVisitor at Princeton University. She joined EPFL in 2017 as Tenure-Track AssistantProfessor and was promoted Full Professor in 2018.
Viktor KuncakViktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.
Simon BossoneyTeaching & PhD Courses Algèbre linéaire et géométrie (pour MAN) PREPA-032(a) We present the fundamental notions of linear algebra in the geometric context where they emerged. We will therefore emphasize the dimensions 2 and 3, and insist on the visualisation of classical objects and operations in the plane and in the 3D space. Analysis I (for CMS) PREPA-003(a) This first semester class is an introduction to the basis of differential calculus. Analysis II (for CMS)
Ian SmithPhD, Cambridge University, 1982 Interests 1 Active shape control for structures for deployment and where serviceability criteria governs 2 Biomimetic structures (learning, self-diagnosis, self-repair) 3 Infrastructure management support through structural identification 4 Advanced computer-aided engineering applications of stochastic optimization and search, multi-criteria analysis, system uncertainties (measurement and modelling), multi-modal approaches (combining statistics with behavior models) More details : see https://www.epfl.ch/labs/imac/research/iansmith/ Alessandro ChiesaAlessandro Chiesa is a faculty member in computer science. He conducts research in complexity theory, cryptography, and security, with a focus on the theoretical foundations and practical implementations of cryptographic proofs that are short and easy to verify. He is a co-author of several zkSNARK libraries, and is a co-inventor of the Zerocash protocol. He has co-founded Zcash and StarkWare Industries. He is a recipient of a Sloan Research Fellowship (2021), an Okawa Foundation Research Grant (2020), and Google Faculty Research Awards (2018 and 2017). He was included in MIT Technology Review's "35 Innovators Under 35" list in 2018.
