[Prev][Next][Index][Thread]
MOD Summerschool on FOUNDATIONS OF SECURE COMPUTATION
The 20th International Marktoberdorf Summer School on
FOUNDATIONS OF SECURE COMPUTATION
Marktoberdorf, Germany July 27 to August 8, 1999
is a NATO Advanced Study Institute directed by F. L: Bauer.
The summer school is a two weeks' course for young computer scientists and
mathematicians working in the field of formal systems development. The
course aims at the dissemination of advanced scientific knowledge and the
promotion of international contacts among scientists.
In recent years a global computational infrastructure has been
established. This and the advent of programming languages like Java
supporting mobile distributed computing has posed a great challenge to the
computer science community. The global infrastructure will support
commerce, medicine, and government, but it can only do so safely if
communication and computing can be secured against catastrophic failure and
malicious interference. Several authoritative studies have shown that the
global software infrastructure is now at risk and the risk is increasing
over time. Additionally the ability to apply software solutions to many
pressing problems is blocked by collective inability to produce software in
which users and builders have a high degree of confidence.
The capability to secure the infrastructure rests on mathematical
foundations for programming languages and communications systems. The work
The capability to secure the infrastructure rests on mathematical
foundations for programming languages and communications systems. The work
on semantics is thus an essential part of the summer school. There is a
need to extend the semantics to take into account system performance and
respon-siveness. Besides constructive type theory, work on linear logic,
game semantics, and feasible mathematics are critical disciplines. The
summer school will bring together leading experts from all of these areas.
LECTURES
Martin Abadi Principles and Calculi for Security Protocols
Luca Cardelli Mobility and Security
Robert L. Constable Reasoning about Automata and Protocols in Type Theory
Nancy A. Lynch Specifying Distributed Systems with IO Automata
Jan A. Bergstra Process Algebra and Program Algebra
Olivier Danvy Partial Evaluation
Samson Abramsky Game Semantics
Viggo Stoltenberg-Hansen Mathematical Theory of Domains
Jean-Yves Girard Linear Logic
Henk Barendregt Lambda Calculus with Types
Helmut Schwichtenberg Proofs and Programs
Stanley S. Wainer Proof Theoretic Complexity
Drafts of the lectures can be found on the web early in 1999 under the URL
http://www4.in.tum.de/div/summerschool/
Apply for participation under this URL
DEADLINE for APPLICATION: March 6, 1999