Adjunct elimination in context logic for trees

Authors:
Cristiano Calcagno;Thomas Dinsdale-Young;Philippa Gardner
Affiliations:
Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK
Venue:
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Year:
2007

Citing 8
Cited 3

Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Context logic and tree update

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context logic as modal logic: completeness and parametric inexpressivity

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Adjunct elimination through games in static ambient logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Forest expressions

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic

Adjunct elimination in Context Logic for trees

Information and Computation
Small specifications for tree update

WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Detecting conflicts among declarative UI extensions

Proceedings of the 8th symposium on Dynamic languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not possible to prove such elimination results for the original single-holed formulation of Context Logic. Instead, we prove our results for multi-holed Context Logic.