*********************************************************************
* Ecole Normale Supe'rieure *
* *
* Se'minaire *
* SEMANTIQUE ET INTERPRETATION ABSTRAITE *
* P. Cousot *
* *
* Vendredi, 14h00--15h30 *
* Salle W, 4e`me e'tage, toits du DMI *
* DMI ENS 45 rue d'Ulm 75005 Paris *
*********************************************************************
*** Vendredi 6 juin 1997 **** 14h00 *********************************
Generalizations of Domain Theory
Michael MISLOVE (Tulane University and Paris VII)
Re'sume' : Domain theory evolved as a mathematical tool for providing
models for programming languages. While it has had good success in this
regard, some problems have arisen in theoretical computation that
require more general structures and different techniques than domain
theory affords. In this talk I will outline a few of the generalizations
that have been developed in this regard, and describe the problems to
which these generalizations have helped solve.
*** Vendredi 13 juin 1997 **** 14h00 ********************************
Static Analysis of Interaction Nets for Distributed Implementations
Ian MACKIE (LIX)
Re'sume' :
Interaction nets can be seen as both a programming language and an
intermediate language for the implementation of other paradigms of
computation. One of their principal advantages is that the reduction
process is both local and confluent, thus being ideally suited for the
development of parallel implementations. For distributed memory
architectures, however, there is a need to know how the net should be
distributed amongst processors, i.e. how do we break up the net so that
the communication is kept to a minimum. The purpose of this talk is
to suggest an analysis to solve this problem, and hint at
other possible analyses that can be useful for other applications,
for example dynamic load balancing.
*** Vendredi 20 juin 1997 **** 14h00 ********************************
Real-Time Logics : Fictitious Clock as an Abstraction of Dense Time
Jean Francois RASKIN (FUNDP, Namur)
Re'sume' : In this work we study two possible semantics for the real-time logic
MTL (Metric Temporal Logic). In the first semantics, called dense
time semantics, time is modeled by the positive real numbers. In the
second one, called fictitious clock semantics, real-time information
is delivered by a global fictitious clock. We show that the
fictitious clock semantics can be viewed as an abstraction of the
dense time semantics. This abstraction relation is formalized
by a parametric conservative connection. This formalization can be
used to partially decide undecidable problems in the dense time
semantics by computing in the fictitious clock semantics.
*** Vendredi 27 juin 1997 **** 14h00 ********************************
Relache (Habilitation de Jean GOUBAULT-LARRECQ)
*********************************************************************
Pour recevoir l'annonce par courrier electronique: cousot@dmi.ens.fr
WWW: http://www.ens.fr/~cousot/annonceseminaire.html
*********************************************************************