论文信息 - Adjunct elimination in Context Logic for trees

Adjunct elimination in Context Logic for trees

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.

Philippa Gardner | Cristiano Calcagno | Thomas Dinsdale-Young

[1] Peter W. O'Hearn,et al. BI as an assertion language for mutable data structures , 2001, POPL '01.

[2] Philippa Gardner,et al. Context logic as modal logic: completeness and parametric inexpressivity , 2007, POPL '07.

[3] Luca Cardelli,et al. Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[4] Peter W. O'Hearn,et al. A Semantic Basis for Local Reasoning , 2002, FoSSaCS.

[5] Philippa Gardner,et al. Adjunct Elimination in Context Logic for Trees , 2007, APLAS.

[6] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[7] Mikolaj Bojanczyk. Forest Expressions , 2007, CSL.

[8] Étienne Lozes. Adjuncts elimination in the static ambient logic , 2003, EXPRESS.

[9] Uschi Heuter,et al. First-order properties of trees, star-free expressions, and aperiodicity , 1991, RAIRO Theor. Informatics Appl..

[10] Philippa Gardner,et al. Context logic and tree update , 2005, POPL '05.

[11] Peter W. O'Hearn,et al. The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[12] Anuj Dawar,et al. Adjunct Elimination Through Games in Static Ambient Logic , 2004, FSTTCS.