Separability, expressiveness, and decidability in the ambient logic

Proceedings-Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 423-432

  Hirschkoff, Daniel ^a   Lozes, Étienne ^a   Sangiorgi, Davide ^b  

^a UNIVERSITÉ DE LYON   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AMBIENT LOGICS (AL); MOBILE AMBIENTS (MA);

CONSTRAINT THEORY; QUERY LANGUAGES; SEMANTICS; TREES (MATHEMATICS);

COMPUTABILITY AND DECIDABILITY;

EID: 0036053379     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2002.1029850     Document Type: Article

References (21)

1. A spatial logic for concurrency (Part I)
2. Computability and complexity results for a spatial assertion language for data structures
3. Describing semistructured data
4. A query language based on the ambient logic
5. Mobile ambients
6. Types for mobile ambients
7. Anytime, anywhere: Modal logics for mobile ambients
8. Logical properties of name restriction
9. The decidability of model checking mobile ambients
10. Structural congruence for ambients is decidable
11. A modal characterization of observational congruence on finite terms of CCS
12. Algebraic laws for nondeterminism and concurrency
13. Proving congruence of bisimulation in functional programming languages
14. Extensionality and intensionality of the ambient logic
15. Characteristic formulae for processes with divergence