Abstract
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) for reasoning hypothetically about data. We show how to interpret these structural connectives as modalities in Modal Logic and prove completeness results. The structural connectives are essential for describing properties of the underlying data, such as weakest preconditions for Hoare reasoning for Separation and Context Logic, and security properties for Ambient Logic. In fact, we introduced Context Logic to reason about tree update, precisely because the structural connectives of the Ambient Logic did not have enough expressive power. Despite these connectives being essential, first Lozes then Dawar, Gardner and Ghelli proved elimination results for Separation Logic and Ambient Logic (without quantifiers). In this paper, we solve this apparent contradiction. We study parametric inexpressivity results, which demonstrate that the structural connectives are indeed fundamental for this style of reasoning.
- J. Berdine, C. Calcagno, and P.W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In Proceedings of FMCO'05, volume 4111 of LNCS, 2006. Google ScholarDigital Library
- Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal Logic. Cambridge University Press, 2001. Google ScholarDigital Library
- C. Calcagno, P. Gardner, and U. Zarfaty. Context logic and tree update. In POPL, 2005. Google ScholarDigital Library
- L. Cardelli and G. Ghelli. TQL: A query language for semistructured data based on the ambient logic. To appear in MSCS. Google ScholarDigital Library
- L. Cardelli and A. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In POPL, 2000. Google ScholarDigital Library
- A. Dawar, P. Gardner, and G. Ghelli. Adjunct elimination using Enrenfeuch's games. In FSTTCS, 2004.Google Scholar
- H. Hosoya and B. Pierce. Xduce: A typed xml processing language. ACM Transactions on Internet Technology, 3:117--148, 2003. Google ScholarDigital Library
- S. Ishtiaq and P. O'Hearn. BI as an assertion language for mutable data structures. In POPL, 2001. Google ScholarDigital Library
- Etienne Lozes. Elimination of spatial connectives in static spatial logics. In TCS 330(3), 2005. Google ScholarDigital Library
- D. Pym, P. O'Hearn, and H. Yang. Possible worlds and resources: The semantics of BI. Theoretical Computer Science, 315(1), 2004. Google ScholarDigital Library
- J. C. Reynolds. Separation logic: a logic for shared mutable data structures. Invited Paper, LICS'02, 2002. Google ScholarDigital Library
- H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, University of Illinois, Urbana-Champaign, Illinois, USA, 2001. Google ScholarDigital Library
- H. Yang and P. O'Hearn. A semantic basis for local reasoning. FOSSACS, 2002. Google ScholarDigital Library
Index Terms
Context logic as modal logic: completeness and parametric inexpressivity
Recommendations
Context logic as modal logic: completeness and parametric inexpressivity
POPL '07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesSeparation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for reasoning about disjoint subdata, and corresponding structural adjoint(s) ...
Three-valued Logics in Modal Logic
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-...
Expressivity of coalgebraic modal logic: The limits and beyond
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modelled as coalgebras. Logics with modal operators obtained from so-called predicate liftings have been shown to be invariant under behavioural ...
Comments