This study track give you a solid foundation in the principles of programming languages and formal methods, with a particular emphasis on exploiting programming-language technology in safety- or performance-critical application domains.
You will learn the basic concepts and methodology for formally defining the meaning of programs and languages, and for proving correctness, equivalence, and other properties of both program fragments and particular language features.
You will get a systematic knowledge of resource-aware models of computation, and of the various fundamental limits on computational performance, or accuracy of program analysis.
At the same time, you will get hands-on experience with performing analysis and transformations of non-trivial programs, with writing tools for assisting in such tasks, and with expressing practical algorithms from a variety of domains in a form suitable for parallel execution.
Recommended prerequisites
Your bachelor's background should include
- an introductory compilers or programming-language implementation course
- working knowledge of basic discrete mathematics (elementary set theory, induction proofs, big-O notation, etc.).
However, even if you have no significant prior background in functional, declarative, or concurrent programming, you will in any case receive an introduction to those topics in the Advanced Programming course, prior to starting on the study track.