Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Efficient static analysis of XML paths and types
 
research article

Efficient static analysis of XML paths and types

Geneves, Pierre
•
Layaida, Nabil
•
Schmitt, Alan
2007
Acm Sigplan Notices

We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically type-check XPath queries. To this end, we prove the decidability of a logic with converse for finite ordered trees whose time complexity is a simple exponential of the size of a formula. The logic corresponds to the alternation free modal mu-calculus without greatest fixpoint, restricted to finite trees, and where formulas are cycle-free.

  • Details
  • Metrics
Type
research article
DOI
10.1145/1250734.1250773
Web of Science ID

WOS:000253409000034

Author(s)
Geneves, Pierre
Layaida, Nabil
Schmitt, Alan
Date Issued

2007

Published in
Acm Sigplan Notices
Volume

42

Start page

342

End page

351

Subjects

modal logic

•

satisfiability

•

type checking

•

XPath

•

Mu-Calculus

•

Xpath

•

Containment

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
IC  
Available on Infoscience
July 4, 2012
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/83482
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés