A practical algorithm for exact array dependence analysis
Communications of the ACM
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
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
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Describing semistructured data
ACM SIGMOD Record
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
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
Counting and equality constraints for multitree automata
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
XML schema, tree logic and sheaves automata
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Elimination of spatial connectives in static spatial logics
Theoretical Computer Science - Expressiveness in concurrency
Deciding validity in a spatial logic for trees
Journal of Functional Programming
An efficient algorithm for XML type projection
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Name-passing in an ambient-like calculus and its proof using spatial logic
Theoretical Computer Science - Expressiveness in concurrency
Expressiveness and complexity of graph logic
Information and Computation
Exploiting schemas in data synchronization
Journal of Computer and System Sciences
One-unambiguity of regular expressions with numeric occurrence indicators
Information and Computation
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
On the analysis of queries with counting constraints
Proceedings of the 9th ACM symposium on Document engineering
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient reasoning about data trees via integer linear programming
Proceedings of the 14th International Conference on Database Theory
Mapping maintenance in XML p2p databases
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Automata and logics for unranked and unordered trees
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Query reasoning on trees with types, interleaving, and counting
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Structural recursion for querying ordered graphs
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
A parameterized graph transformation calculus for finite graphs with monadic branches
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression language for semistructured data. The essence of this result is a surprising connection between formulas of the ambient logic and counting constraints on (nested) vectors of integers.Our proof method is based on a new class of tree automata for unranked, unordered trees, which may result in practical algorithms for deciding the satisfiability of a formula. A benefit of our approach is to naturally lead to an extension of the logic with recursive definitions, which is also decidable. Finally, we identify a simple syntactic restriction on formulas that improves the effectiveness of our algorithms on large examples.