ITA | ENG
B012489 - MODELS OF SEQUENTIAL AND CONCURRENT SYSTEMS
Main information
Course Content
Suggested readings
Learning Objectives
Teaching Methods
Further information
Type of Assessment
Course program
Academic Year 2013-14
Coorte 2013 - Second Cycle Degree in COMPUTER SCIENCE
Course year
First year - First Semester
Belonging Department
Mathematics and Computer Science "Ulisse Dini" (DIMAI)
Course Type
Single education field course
Scientific Area
INF/01 - INFORMATICS
Credits
9
Teaching Hours
72
Teaching Term
23/09/2013 ⇒ 20/12/2013
Attendance required
No
Type of Evaluation
Final Grade
Course Content
show
Course program
show
Lectureship
Course Content
The course is split into two parts: in the first part, some methods for defining the operational and denotational semantics of sequential programming languages are studied; in second part, some formalisms for specifying, designing, implementing, analyzing, and proving properties of concurrent and distributed systems are studied.
Suggested readings (Search our library's catalogue)
Notes, handouts and articles electronically provided by the teacher through the course website.
Learning Objectives
The student will learn to understand and define the semantics of programming languages and to design and implement simple concurrent systems.
The student will acquire the skills necessary to verify correctness of such systems, also by means of software supporting tools, and will acquire the basis for further study and research on theory of distributed systems, real-time systems and fault-tolerant systems.
The student will acquire the skills necessary to verify correctness of such systems, also by means of software supporting tools, and will acquire the basis for further study and research on theory of distributed systems, real-time systems and fault-tolerant systems.
Teaching Methods
Lectures and practical exercises.
Further information
Office hours: by appointment (contact the teacher by phone or e-mail)
Type of Assessment
The examination consists of an oral interview and of a project/relation on one of the topics covered in class.
Course program
Basic concepts of sequential and concurrent programming, of discrete mathematics and proof techniques. Finite state automata and labeled transition systems. Operational and denotational semantics of programming languages. Process algebras and calculi and their models as transition systems. Behavioral equivalences as systems‘
abstraction and minimization techniques and as a basis for correctness proofs. Temporal and modal logics, and model checking-based verification techniques of systems’ properties.
abstraction and minimization techniques and as a basis for correctness proofs. Temporal and modal logics, and model checking-based verification techniques of systems’ properties.