T. Chen, T. Han, and J. Lu (PRC)
Semi-structured data, Tree logic, Fixpoint, Model Check ing Algorithm
Semi-structured data plays an increasingly important role in the exchange of information between globally dis tributed applications, which invokes renewed interests in typed programming languages that can manipulate tree-like data structures. Tree logic, inherited from ambient logic, is introduced as the formal foundation of related program ming language and type systems. In this paper, we intro duce recursion into such logic system, which can describe the tree data more clearly and concisely. By making a dis tinction between proposition and predicate, a concise se mantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic withouto perator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.
Important Links:
Go Back
