02141 Computer Science Modelling (Spring 2018)

 

Class schedule: Lectures and exercise classes generally take place Tuesday 13.00-17.00 and Friday 8.00-12.00 during the Spring Term.

Lectures and Exercises will both be in 303A-A041.

Course work: There is is a series of mandatory assignments – on top of the exercises in class.

Examination: There is an individual written exam at the end of the course; it may build in part on the mandatory assignments.

Rexamination: Reexaminations will be oral and individual; they may build in part on the mandatory assignments.

Lecturers: Hanne Riis Nielson | email,  Flemming Nielson | email,  and Alberto Lluch Lafuente | email.

Tutors: Mike Castro Lundin and Martin Obel Thomsen.

General course objectives: The students learn to understand and apply the central models and formalisms introduced in the course and to use software tools related to some of these formalisms.

Course prerequisites: Please note that the course 02157 is a prerequisite for this course, and we will be assuming that you can program in a functional language like F#.

Course contents: The course covers three main topics:

Tentative teaching schedule: Please note that the following schedule is tentative and may be changed.

Date

Meeting

Topic

Lecturer

Description

Reading material

30-Jan

1

RL

HRN

Introduction to Computer Science Modelling

HMU sec 1.1, 1.5, 2.1 

02-Feb

2

RL

HRN

Finite Automata 

HMU sec 1.4, 2.2, 2.3

06-Feb

3

FM

FN

Program Graphs 

FM chap 1

09-Feb

4

RL

HRN

Regular Expressions 

HMU sec 3.1, 3.2, 3.4 

13-Feb

5

FM

FN

Guarded Commands 

FM chap 2

16-Feb

6

RL

HRN

Equivalence Results for Regular Languages 

HMU sec 2.3, 2.5, 3.2 

20-Feb

7

FM

FN

Program Verification

FM chap 3

23-Feb

8

RL

HRN

Properties of Regular Languages 

HMU sec 4.1, 4.2, 4.3, 4.4

27-Feb

9

FM

FN

Consolidation

FM chap 1-3

02-Mar

10

CFL

ALL

Introduction to Context-Free Languages 

HMU sec 5.1, 5.2 

06-Mar

11

FM

FN

Program Analysis

FM chap 4

09-Mar

12

CFL

ALL

Using Context-Free Grammars 

HMU sec 5.3, 5.4 

13-Mar

13

FM

FN

Program Analysis

FM chap 4 

16-Mar

14

CFL

ALL

Using Parser Generators 

(To be determined)

20-Mar

15

FM

FN

Language Based Security

FM chap 5

23-Mar

16

CFL

ALL

Pushdown Automata

HMU sec 6.1-6.3

03-Apr

17

FM

FN

Language Based Security

FM chap 5

06-Apr

18

CFL

ALL

Deterministic Pushdown Automata

HMU sec 6.4

10-Apr

19

FM

FN

Concurrency

FM chap 8

13-Apr

20

CFL

ALL

Properties of Context-Free Languages

HMU sec 7.1-7.4

17-Apr

21

FM

FN

Concurrency

FM chap 8

20-Apr

22

CFL

ALL

Mandatory Assignment

N/A

24-Apr

23

CFL

ALL

Mandatory Assignment

N/A

01-May

24

FM

FN

Model Checking

FM chap 6

04-May

25

FM

FN

Model Checking

FM chap 6

08-May

26

N/A

FN

Wrapping up Computer Science Modelling

(Note: Friday Schedule)

 

Tentative schedule for mandatory exercises:


Learning objectives: A student who has met the objectives of the course will be able to:

 

Course literature:

 

Remarks: The course is given in English.

 

CampusNet: https://cn.inside.dtu.dk/cnnet/element/562353/frontpage