Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Peter Sewell
My research is mainly on the foundations of distributed
computation,
including the design, semantics and implementation of distributed
programming languages,
behavioural modelling for network protocols, and security issues.
Much of my work involves applied semantics, working with operational semantics,
type systems,
and concurrency theory.
Work on distributed programming languages is described in more detail
on the
Acute and
Nomadic
Pict pages; work on network semantics is described
on the Netsem page.
An informal description of my research area, written for the
non-technical reader in April 2001, is
here (in
postscript) and
in
pdf.
An approximation to the real TCP state diagram.
This is a poster with a version of the `TCP state diagram' extracted from the
specification. It is rather more complete than the
usual diagram,
but is still a very abstract and simplified view of the state space of
our specification. It is intended to be printed at A1 size or bigger.
Also in pdf.
Nomadic Pict: Language
and
Infrastructure Design for Mobile Agents,
Pawel Wojciechowski and Peter Sewell.
In
ASA/MA'99 (First International Symposium on Agent
Systems and Applications/Third International Symposium on
Mobile Agents), October 1999.
An extended version appeared in IEEE Concurrency vol 8 no 2, 2000.
A Brief Introduction to Applied Pi.
Notes from my lectures at the MATHFIT meeting
on
Recent Advances
in
Semantics and Types for Concurrency:
Theory & Practice,
Imperial College, July, 1998.
The slides and other pointers are here.
From Rewrite Rules to Bisimulation Congruences.
Technical Report 444, Computer Laboratory, University of Cambridge,
June 1998.
Here is the
abstract and
short and
long versions,
and the same in cmr: short and
long. An extended abstract of this
appeared in CONCUR 98, LNCS 1466.
Nonaxiomatisability of equivalences over finite state processes.
In Annals of Pure and
Applied Logic.
This supersedes the following paper and part of my thesis.
Here is the abstract; please
contact me for a preprint.
Some of the fonts used in the older papers are not supported at all sites - if
there are printing difficulties, try the cmr versions.
Copyright
The following IEEE
notices apply
to the LICS 2000, CSFW-13, ASA/MA 99, CSFW-12 and LICS 94 papers:
(c) 1994,1999,2000 IEEE. Personal use of this material is permitted. However,
permission to reprint/republish this material for advertising or
promotional purposes or for creating new collective works for
resale or redistribution to servers or lists, or to reuse any
copyrighted component of this work in other works must be
obtained from the IEEE.
This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All persons
copying this information are expected to adhere to the terms and
constraints invoked by each author's copyright. In most cases,
these works may not be reposted without the explicit permission of the copyright holder.
The published versions of the ESOP 2002, TACS 2001, CONCUR 97, ICALP 98, CONCUR 98 and IPL papers
are (c) Springer-Verlag; the versions above may differ from these.
The published version of the TCS rewrite rules paper is (c) Elsevier
Science B.V.