PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th 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
Deciding validity in a spatial logic for trees
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Verifiable and Executable Logic Specifications of Concurrent Objects in Lpi
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Separability, Expressiveness, and Decidability in the Ambient Logic
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
XDuce: A Typed XML Processing Language (Preliminary Report)
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking mobile ambients
Theoretical Computer Science
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A Spatial Logic for Concurrency (Part II)
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Manipulating Trees with Hidden Labels
Electronic Notes in Theoretical Computer Science (ENTCS)
A Complete Axiomatic System for a Process-Based Spatial Logic
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Exploring the relation between intuitionistic bi and boolean bi: An unexpected embedding
Mathematical Structures in Computer Science
Observing distributed computation: a dynamic-epistemic approach
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Deciding safety properties in infinite-state pi-calculus via behavioural types
Information and Computation
Decidability of modular logics for concurrency
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Nondeterministic Phase Semantics and the Undecidability of Boolean BI
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.01 |
We consider a propositional spatial logic for finite trees. The logic includes $\A \Par \B$ (tree composition), $\A \,{\Guarantee}\, \B$ (the implication induced by composition), and $\Zero$ (the unit of composition). We show that the satisfaction and validity problems are equivalent, and decidable. The crux of the argument is devising a finite enumeration of trees to consider when deciding whether a spatial implication is satisfied. We introduce a sequent calculus for the logic, and show it to be sound and complete with respect to an interpretation in terms of satisfaction. Finally, we describe a complete proof procedure for the sequent calculus. We envisage applications in the area of logic-based type systems for semistructured data. We describe a small programming language based on this idea.