Model checking mobile ambients

DOI10.1016/S0304-3975(02)00832-0zbMath1068.68081OpenAlexW2031315747MaRDI QIDQ1884885

Andrew D. Gordon, Witold Charatonik, Jean-Marc Talbot, Supratik Mukhopadhyay, Silvano Dal Zilio

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00832-0

zbMATH Keywords

Model checkingVerificationAmbient calculusMobile computationAmbient logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Axiomatisation and decidability of multi-dimensional Duration Calculus ⋮ Expressiveness and complexity of graph logic ⋮ Deciding safety properties in infinite-state pi-calculus via behavioural types ⋮ Deciding Reachability in Mobile Ambients with Name Restriction ⋮ Abstract interpretation based verification of temporal properties for BioAmbients ⋮ On Model Checking Boolean BI ⋮ Undecidability of Model Checking in Brane Logic

Uses Software

• SLMC

Cites Work

• The polynomial-time hierarchy
• Mobile ambients
• Relationships between nondeterministic and deterministic tape complexities
• Separability in the Ambient Logic
• The Logic of Bunched Implications
• Anytime, anywhere
• Extensionality and intensionality of the ambient logics
• BI as an assertion language for mutable data structures
• Semantics for relevant logics
• Recursively enumerable sets of positive integers and their decision problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Model checking mobile ambients