The Decidability of Model Checking Mobile Ambients

Charatonik, Witold; Talbot, Jean-Marc

doi:10.1007/3-540-44802-0_24

Cited by 38 publications

(42 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By undecidability of SL {∃} (follows from [14]), of SL {R e } (follows from Corollary 5.13), and of SL {H} (follows from Corollary 5.14), the three logics of Corollary 4.6 are all undecidable. Hence, we have the following Corollary.…”

Section: Corollary 47 (Decidability Of Fresh Quantifiers) Model-chementioning

confidence: 99%

Decidability of Freshness, Undecidability of Revelation

Conforti

Ghelli

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study decidability of a logic for describing processes with restricted names. We choose a minimal fragment of the Ambient Logic, but the techniques we present should apply to every logic which uses Cardelli and Gordon revelation and hiding operators, and Gabbay and Pitts freshness quantifier. We start from the static fragment of ambient logic that Calcagno, Cardelli and Gordon proved to be decidable. We prove that the addition of a hiding quantifier makes the logic undecidable. Hiding can be decomposed as freshness plus revelation. Quite surprisingly, freshness alone is decidable, but revelation alone is not.

show abstract

Section: Corollary 47 (Decidability Of Fresh Quantifiers) Model-chementioning

confidence: 99%

Decidability of Freshness, Undecidability of Revelation

Conforti

Ghelli

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Focusing on ow-sensitive analyses, the last paper shows that analysis that requires the use of relational attributes for precision must be PSPACE-hard in general, and as soon as the language constructs are slightly strengthened to allow a computation to maintain a very limited summary of what happens along an execution path, inter-procedural analysis becomes EXPTIME-hard. On di erent perspectives, [18] investigates bottom-up logic programming as a formalism for expressing and analyzing static analysis, while [19,20] investigate the complexity of model checking Mobile Ambients.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

Nesting analysis of mobile ambients

Braghin

Cortesi

Focardi

et al. 2004

Computer Languages, Systems & Structures

View full text Add to dashboard Cite

A new algorithm is introduced for analyzing possible nestings in mobile ambient calculus. It improves both time and space complexities of the technique proposed by Nielson and Seidl. The improvements are achieved by enhancing the data structure representations, and by reducing the computation to the control ow analysis constraints that are e ectively necessary to get to the least solution. These theoretical results are also supported by experimental tests run on a Java-based tool that implements a suite of algorithms for nesting analysis of mobile ambients.

show abstract

“…However, in some interesting cases, the problem of whether P matches A becomes decidable [14]; some complexity results are also known [16]. A decision procedure for such a matching problem is also called a modelchecking algorithm.…”

Section: Equivalent Descriptions 5 From Descriptions To Queriesmentioning

confidence: 99%