Skip to main content
SpringerLink
Log in

Specification and verification for semi-structured data

  • Web Data Management Information Integration
  • Published:
Wuhan University Journal of Natural Sciences

Abstract

Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems. In this paper, we introduce recursion into such logic system, which can describe the tree data more clearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without δ operator. 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Calcagno C, Cardelli L, Gordon A, Deciding Validity in a Spatial Logic for Trees.Proc TLDI'03, ACM Press, 2003, 62–73.

  2. Caires L, Cardelli L. A Spatical Logic for Concurrency (Part I).Proc TACS' 2001, Lecture Notes in Computer Science, 2001,2215: 1–30.

    MathSciNet  Google Scholar 

  3. Milner R, Parrow J, Walker D. A Calculus of Mobile Process, part I/IL.Journal of Information and Computation, 1992,100: 1–77.

    Article  MATH  MathSciNet  Google Scholar 

  4. Chen T, Han T, Lu J. Tree Logic with Recursion and Model Checking Algorithm.http://moon.nju.edu.cn/∼ctl/ docs/treeLogic.pdf, September 2004.

  5. Charatonik W, Talbot J. The Decidability of Model Checking Mobile Ambient.Proc CSL'01. Lecture Notes in Computer Science, 2001,2142: 339–354.

    MathSciNet  Google Scholar 

  6. Winskel G. A Note on Model Checking the Modal-calculus.Theoretical Computer Science, 1991,83: 157–167.

    Article  Google Scholar 

  7. Cardelli L, Gardner P, Ghelli G. Manipulating Trees with Hidden Labels.Proc FOSSACS'03, Lecture Notes in Computer Science, New York: Springer, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Novel Software Technology, Nanjing University, 210093, Najing, Jiangsu, China

    Chen Tao-Iue, Han Ting-ting & Lu Jian

Authors
  1. Chen Tao-Iue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Han Ting-ting
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lu Jian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lu Jian.

Additional information

Foundation item: Supported by the National Natural Sciences Foundation of China (60233010, 60273034, 60403014), 863 Program of China (2002 AA116010), 973 Program of China (2002CB312002)

Biography: CHEN Tao-lue (1980-), male, Master, research direction: formal method, mobile computation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tao-Iue, C., Ting-ting, H. & Jian, L. Specification and verification for semi-structured data. Wuhan Univ. J. Nat. Sci. 11, 107–112 (2006). https://doi.org/10.1007/BF02831713

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02831713

Key words

CLC number

Search

Navigation