Logical properties of name restriction

DOI10.1007/3-540-45413-6_8MaRDI QIDQ2778816zbMATH OpenFDO

Authors Luca Cardelli, Andrew D. Gordon

Publication date 21 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2044/20440046

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Name-passing in an ambient-like calculus and its proof using spatial logic
• Name-passing in an ambient-like calculus and its proof using spatial logic
• Trustworthy Global Computing
• Modal logic with names
• Nominal logic, a first order theory of names and binding

Cited in

(15)

• Probabilistic mobile ambients
• Elimination of spatial connectives in static spatial logics
• A spatial logic for concurrency. II
• Model checking mobile ambients
• Nominal logic, a first order theory of names and binding
• A spatial logic for concurrency. I
• An axiomatisation of a pure calculus of names
• Name-passing in an ambient-like calculus and its proof using spatial logic
• Elimination of quantifiers and undecidability in spatial logics for concurrency
• Intensionality of modal logic for robust ambient calculus
• Name-passing in an ambient-like calculus and its proof using spatial logic
• Local reasoning about data update
• Freshness and Name-Restriction in Sets of Traces with Names
• Computer Science Logic
• Relating state-based and process-based concurrency through linear logic (full-version)

This page was built for publication: Logical properties of name restriction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778816)