Quelques propositions: themes  (G. Longo)

1.1 - Catuscia Palamidessi
Computer Science Dept.
Penn State University (USA)
themes de recherches, voir:


1.2 - Prakash Panangaden
Computer Science Dept.
McGill University (Canada)
themes de recherches, voir:

Research Summary

The main activity is the analysis of probabilistic systems. In particular we are concerned with systems that may have continuous state spaces or continuous time evolution. The intended area of application is the analysis and verification of stochastic hybrid systems. So far we have worked on the following topics:

We have done small case studies to verify some modules of a flight control system provided by an industrial partner. However the main thrust of the work so far has been mathematical and theoretical. Other areas of interest are: machine learning, quantum information theory, concurrency theory and categorical aspects of physics.

1.3 - John C Mitchell
Computer Science Dept.
Stanford University

Aspects of Computer Security,‹ John Mitchell (Stanford)
‹ Current efforts in this group include study of cryptographic
protocols and mobile code security. This work involves methods
based on logic, programming language theory, and probabilistic
computation. See


2 - Harry Mairson
C.S. Dept.
Brandeis University

Theme: Linear naming: using principles of linear logic and optimal
evaluation for language and network design.

Summary: We are working on both practical and theoretic aspects of these
topics, with topics currently including design of languages with
optimally-evaluated explicit control (call/cc and extensions), full
abstraction theorems for sharing, visualization tools for optimal
graph reduction, and compiler technology for related language and
network protocol design.

The project currently includes Alan Bawden (senior research associate),
Julia Lawall (research associate), Harry Mairson (professor), Charles
Stewart (postdoc), and two undergraduates.‹ We expect to be merging
with the "Church" experimental compiler project at Boston University,
which works on intersection types and related flow analysis for
programming languages.


3 - Jose Meseguer
Stanford (SRI)


I am willing to receive the visit of an ENS
student provided the student is sufficiently well recommended as to
expect that he/she will be able to accomplish some significant goals in a three-month period.‹ It may be best if the student has already some familiarity with the things we do, so that he/she could get actively involved in some research work
during his/her stay here.‹ This is particularly important in the
case of SRI, since there are no courses given here, so that direct involvement in research is the main thing to do.‹ Therefore, I would suggest that prior to the student coming here some preliminary planning of the visit and some prior study of some material by the student take place.

Note that the administrative process for somebody to visit SRI for
several months is not trivial, and that sufficient time (at least a couple
of months) has to be allowed for this process.‹ Besides some letters of > reccomendation allowing me to judge the quality of the student and to form some preliminary idea of what he/she could do here, the following additional things need to be done:

1. the student has to apply to SRI ahead of time to become an
"International Fellow"

2. upon my recommendation, the application has to be approved by an SRI
‹‹ vicepresident, who will send the student a formal letter of

3. a special J-1 visa form is prepared by SRI and sent to the
student.‹ This is the only visa with which he/she can be here for an extended period of time.

4. the student has to take the visa papers to the US Embassy to get the
‹‹ proper visa.

All this has to happen prior to the student coming to SRI.

Note also that I will be away from SRI from August 22 to October 1st.

Now regarding the research of the group I lead:

Group Name:

Topics of research:
More information about the recent work and papers of members of the
group and about Maude can be obtained from the Maude web page,



4 - Phokion Kolaitis
UCalifornia Santa Cruz

Our academic year is
divided into three quarters, with the fall quarter starting
at the end of September and ending in the middle of December.
To avoid having the students pay fees, it is possible in
some cases to arrange for a visiting researcher appointment
that carries no salary, but gives access to shared student
space, computer account, and library facilities.
Please note that there is a fair amount of paperwork involved
in this on our end (letter to the Dean, visa documents, etc.),
so the planning for a fall visit should take place in the previous

As for current active projects of my group:

--finite model theory (connections between logic and
complexity on finite structures);

--complexity in automated deduction
(complexity of equational matching and unification,
experimental evaluation of AC-matching and AC-unification

-- constraint satisfaction and database query evaluation


5 - Prof.H.Ehrig
Berlin Technical University

A students from ENS could participate in our regular courses for a
period of 3 months although this period is rather short.
Presently we have only a small enrollment fee which probably could be
avoided if they don't bedome officially students of TU Berlin.
My main topics are formal specification techniques, especially algebraic
specification, Petri nets, graph transformation, and integration of
specification techniques.


5 - Prof. Ugo Montanari ‹‹‹‹‹‹‹‹‹‹‹‹‹‹  Phone: +39 050 887221
Dipartimento di Informatica‹‹‹‹‹‹‹ Fax:‹‹ +39 050 887226
Universita' di Pisa‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹ Note the zero prefix in the area code.
Corso Italia, 40‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹  Email:
I-56100 Pisa, Italy‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹

Theme: Tile logic is a general logic (based on double categories)
for open, distributed, interactive systems. Rewriting logic and SOS specifications
are usually special cases of tile logic.

Keywords: Concurrency, compositional abstract semantics, monoidal
double categories, coalgebras, bisimulation.


6 - Prof. G. Ghelli
Dipartimento di Informatica‹‹‹‹‹‹‹ Fax:‹‹ +39 050 887226
Universita' di Pisa‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹ Note the zero prefix in the area code.
Corso Italia, 40‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹  Email:
I-56100 Pisa, Italy‹‹‹‹‹‹‹‹‹‹‹‹‹‹‹

Sujets: _Toy Languages_

PISA: Giorgio GHELLI, Dipartimento di Informatica, Universita' di Pisa
Ghelli <>

6.1 - A kernel language for extensible objects with roles.

The student will specify syntax, type rules, and operational
semantics of a toy language which supports a notion of objects which can change their most specific type and which answer a message in a way which depends on the 'role' they are playing. Then, the student will implement an interpreter for the toy language, using the language Fibonacci or another
object-oriented or functional language.

6.2 - A kernel reflexive language

The student will specify syntax, type rules, and operational
semantics of a typed toy language which includes a reflexive operation, i.e. an operation which allows code to be produced at run time and then executed.
Then, the student will implement an interpreter for
the toy language, using the language Fibonacci or another
object-oriented or functional language.

Similar experiments can be designed with respect to other
mechanisms we are studying, such as virtual object and collection, i.e. mechanisms which allow one to define mechanisms which are similar to the ``view'' mechanism of relational database systems.


7 - Masako Takahashi
Dept. of Mathematical & Computing Sciences,‹‹ Tel: +81-3-5734-3204
Tokyo Institute of Technology,‹‹‹‹‹ Fax: +81-3-5734-2714
O-okayama, Meguro-ku, Tokyo 152-8552, Japan

Beside myself, two professors in our department
showed their interest in your program. Without knowing which topic is
more appropriate to your students, I just list information from the
three research groups including mine, and leave to your discretion
which you pick up and put in your presentation to students.

7.1. Group of Prof. Masataka Sassa <>
Possible topics:
- Programming languages and their processors
‹ optimization, code generator
- Compiler generators
‹ Rie and Jun (generators based on attribute grammars)
- Programming environments
‹ visualization of language processors

7.2. Group of Prof. Osamu Watanabe <>
Possible topics:
‹‹‹ Computational Complexity Theory
7.3. Group of Prof. Masako Takahashi <>
Possible topics:
- Theory of computation
‹ (e.g., recursive functions on trees)
- Theory of types
‹ (e.g., functions representable by type theories)

If you need more information, please let me know or you may directly
write to the group leaders.

---------------------------------------------------------------------- ‹
8 - Susumu Hayashi
Department of Computer and Systems Engineering
Faculty of Engineering
Kobe University
Kobe, 657-8501, Japan

Titile: Proof Animation Project
Keywords: ProofWorks system: a proof checker for debugging formal proofs by exectuing them as programs via Curry-Howard isomorphism
Details are available at http:/


9 - Mitchell Wand
Northeastern University College of Computer Science:

Programming Languages and Semantics: (Mitchell Wand and William
Clinger).‹ Current interests include semantics of programming
languages, correctness of analysis-based optimizing compilers,
implementation of higher-order languages, and evaluation of
garbage-collection algorithms.


10 - Adriana Compagnoni

This is a project in collaboration
with Princeton, Bell Labs and Yale.

Design, analysis and implementation of frameworks for the development
of safe mobile software.

Keywords: Type Theory, Lambda Calculus, Intuitionistic Logic,
Security, Safety.

11 - Joseph Goguen
Univ. of California at San Diego

Participate in the Tatami project, which is using behavioral algebra to
specify and verify concurrent distributed sytems.‹ Possible topics include
doing some examples, such as internet protocols, improving the Kumo system, which is written in Java and uses the latest internet technology, and working  on social aspects of formal methods, including interface design, user requirements, actor-network analyses.


12 - Robert Harper
Carnegie Mellon University

"research in logic, semantics, and type theory with applications to programming".


13 - Carl Gunter
University of Pennsylvenia, Philadelphia

Project 1: Active Networks programming.
Programming in OCaml and PLAN.‹ Develop PLAN or implement a new protocol using PLAN and OCaml.

Project 2: Security Infrastructure programming.
Programming in OCaml, C, and QCM.‹ Develop QCM or work on the QCM-based secrurity infrastructure for the ABONE active network testbed.


14 - Fernando Orejas
Univ. of Barcellona

The department has research groups in the areas of‹ Logic and
Programming, Algorithms and Complexity Computer Graphics, Information
Systems and Data Bases, and‹ Artificial Intelligence. Anyhow, if you
ask me for two or three, I would say that the most active three
would be Logic and Programming (with research in Formal Specification,
Automated Deduction and Verification and Synthesis of Circuits),
Algorithms and Complexity (with special interest in Design and
Analysis of Algorithms and Data Structures, Structural Complexity
Theory and Algorithmic Learning Theory) and Computer Graphics
(with special interest in Computer-Aided Geometric Design,
Visualization and Virtual Reality).

More information about our Department at the URL: