In this course we will introduce the main approaches from Concurrency Theory for analyzing and verifying Security in various systems
Profesor: Frank Darwin Valencia
Horas de Clase: 3 / semana
Horas de trabajo independiente: 6 / semana
Prerequisitos: Conocimiento básico de autómatas, lógica y concurrencia.
Acerca del Curso
Security is concerned with the fundamental aspects of systems consisting of communicating agents (or processes) in which critical resources of some sort (e.g., secret information) must not be accessed, misused or modiﬁed by unwanted agents (e.g., attackers). This covers a vast variety of
complex systems particularly on the web. E.g., credit card usage on the Internet, now a common practice, is but one example where security is of the essence. Due to its practical relevance, ubiquity and complexity the study of security has become a serious challenge involving several disciplines of computer science, in particular Concurrency Theory. In fact, during the last decade, there has been a growing interest in the analysis of security protocols by developing formalisms that model communicating processes; in particular, the so-called Process Calculi.
|Basic concepts for automata theory.|
|Bisimilarity equivalence on automatas.|
|General aspects of process calculi.|
|Syntax and Semantics.|
|Midterm exam 1||30 %|
|Midterm exam 2||30 %|
|Midterm exam 3||30 %|
Sangiorgi, D. and Walker, D. (2001). The π-calculus: a Theory of Mobile Processes. Cambridge University Press
Milner, R. (1989). Communication and Concurrency. International Series in Computer Science. Prentice Hall.
Milner, R. (2001). The pi-calculus. Cambridge University Press.
Material de este semestre