MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Charatonik, Witold
Talbot, Jean-Marc		dblp
dblp
Editor(s):
Fribourg, Laurentdblp
BibTeX cite key*:
CharatonikTalbot-csl01
Title, Booktitle
Title*:
The Decidability of Model Checking Mobile Ambients
Booktitle*:
Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL
Event, URLs
Conference URL::
http://www.lsv.ens-cachan.fr/csl01/
Downloading URL:
Event Address*:
Paris, France
Language:
English
Event Date*
(no longer used):
September 10-13, 2001
Organization:
European Association for Computer Science Logic (EACSL)
Event Start Date:
14 May 2003
Event End Date:
18 May 2003
Publisher
Name*:
Springer
URL:
http://www.springer.de/
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
2142
Number:
Month:
September
Pages:
339-354
Year*:
2001
VG Wort Pages:
16
ISBN/ISSN:
3-540-42554-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
 The ambient calculus is a formalism for describing the mobility of
both software and hardware. The ambient logic is a modal logic
designed to specify properties of distributed and mobile
computations programmed in the ambient calculus. In this paper we
investigate the border between decidable and undecidable cases of
model checking mobile ambients for some fragments of the ambient
calculus and the ambient logic.

Recently, Cardelli and Gordon presented a model-checking algorithm
for a fragment of the calculus (without name restriction and without
replication) against a fragment of the logic (without composition
adjunct) and asked the question, whether this algorithm could be
extended to include either replication in the calculus or
composition adjunct in the logic. Here we answer this question
negatively: it is not possible to extend the algorithm, because each
of these extensions leads to undecidability of the problem. On the
other hand, we extend the algorithm to the calculus with name
restriction and logic with new constructs for reasoning about
restricted names.
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:
@INPROCEEDINGS{CharatonikTalbot-csl01,
AUTHOR = {Charatonik, Witold and Talbot, Jean-Marc},
 EDITOR = {Fribourg, Laurent},
 TITLE = {The Decidability of Model Checking Mobile Ambients},
 BOOKTITLE = {Computer science logic (CSL-01) : 15th International Workshop, CSL 2001, Annual Conference of the EACSL},
 PUBLISHER = {Springer},
 YEAR = {2001},
 ORGANIZATION = {European Association for Computer Science Logic (EACSL)},
 VOLUME = {2142},
 PAGES = {339--354},
 SERIES = {Lecture Notes in Computer Science},
 ADDRESS = {Paris, France},
 MONTH = {September},
 ISBN = {3-540-42554-3},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Witold Charatonik		Created
08/06/2001 02:42:01 PM
Revisions
6.
5.
4.
3.
2.		Editor(s)
Christine Kiesel
Manfred Jaeger
Uwe Brahm
Witold Charatonik
Witold Charatonik		Edit Dates
14.05.2003 15:56:25
04/24/2003 05:28:44 PM
03/28/2002 12:48:23 AM
11/01/2002 16:03:05
06/12/2001 11:45:47