Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Theoretical Computer Science
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
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 as modal logic: completeness and parametric inexpressivity
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science - Applied semantics: Selected topics
Local Reasoning about Data Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Manipulating Trees with Hidden Labels
Electronic Notes in Theoretical Computer Science (ENTCS)
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
FLUX: functional updates for XML
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Initial Algebra Semantics for Cyclic Sharing Structures
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Algebra and logic for resource-based systems modelling
Mathematical Structures in Computer Science
Maintaining XML Data Integrity in Programs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Local Reasoning About Tree Update
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybrid logical analyses of the ambient calculus
Information and Computation
Adjunct elimination in Context Logic for trees
Information and Computation
An introduction to context logic
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
Adjunct elimination in context logic for trees
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
DynXML: safely programming the dynamic web
APLWACA '10 Proceedings of the 2010 Workshop on Analysis and Programming Languages for Web Applications and Cloud Applications
Small specifications for tree update
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
The next 700 separation logics
VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Abstraction and refinement for local reasoning
VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Forest: a language and toolkit for programming with filestores
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Abstract local reasoning for program modules
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
A simple abstraction for complex concurrent indexes
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Patterns and types for querying XML documents
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A complete temporal and spatial logic for distributed systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Automata-Based verification of programs with tree updates
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Superficially substructural types
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Hi-index | 0.00 |
Spatial logics have been used to describe properties of tree-like structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separation Logic). We integrat this work by analyzing dynamic updates to tree-like structures with pointers (such as XML with identifiers and idrefs). Naíve adaptations of the Ambient Logic are not expressive enough to capture such local updates. Instead we must explicitly reason about arbitrary tree contexts in order to capture updates throughout the tree. We introduce Context Logic, study its proof theory and models, and show how it generalizes Separation Logic and its general theory BI. We use it to reason locally about a small imperative programming language for updating trees, using a Hoare logic in the style of O'Hearn, Reynolds and Yang, and show that weakest preconditions are derivable. We demonstrate the robustness of our approach by using Context Logic to capture the locality of term rewrite systems.