Master in Information Security
For more information about the Information Security Master Track visit: http://www.infsecmaster.ethz.ch
Bachelor Course 252-0058-00L, Spring Semester 2008
Answers to questions:
Andreas will answer your questions in IFW C42 on Friday, June 6, 13:00.
Answers to questions:
Matthias can come to ETH (IFW C47.2) at Saturday, June 7, 14:00, in order to answer questions.
Please send him a mail, if you are interested.
The final exam will take place on June 9th, 10:00 to 12:00 in CAB G11 (names starting with A-M) and CAB G61 (names starting with N-Z). Do not forget to bring your legi.
The final exam will be a closed-book exam. However, you will be allowed to use the latest reference card, which will be distributed together with the exam questions.
Updated this week's lecture slides (Mathematical Language and Proofs, slide numbers 76, 77, 101, 110, 112, 113, and 150).
We will have the Course Evaluation for the FM part during next lecture on Tuesday, May 13th.
Midterm results announced in the display case in IFW floor C.
The post-exam review takes place on Wednesday, April 30th. Please go to Barbara Geiser's office (IFW C 49.1) or Benedikt Schmidt's office (IFW C43.2).
|11.04.2008||Formal Methods part starting next Tuesday, Apr 15th|
Exercise sessions: please continue to go to the same exercise session (same time and place), as you did for the Functional Programming part. Only your assistant might change for the FM part, see below.
Classes: Tue 8-11, HG E 7
There will be a mid-term and a final exam. More details to come.
Homework is optional, but highly recommended.
In this course, participants will learn about new ways of specifying, reasoning about, and developing programs and computer systems. Our objective is to help students raise their level of abstraction in modeling and implementing systems.
The first part of the course will focus on designing and reasoning about functional programs. Functional programs are mathematical expressions that are evaluated and reasoned about much like ordinary mathematical functions. As a result, these expressions are simple to analyze and compose to implement large-scale programs. We will cover the mathematical foundations of functional programming, the lambda calculus, as well as higher-order programming, typing, and proofs of correctness.
The second part of the course will focus on modeling and designing discrete transition systems. Here students will come to understand the difference between correct construction versus final validation. Our focus will include both background and applications. The background reviews logic, set theory, and a development framework for discrete transition model construction. The applications include the development of sequential, distributed, and concurrent programs as well as hardware systems and complete systems (e.g. embedded systems).
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to a newer browser.