Constraint checking for XML-based language specification by SAT solver

Hao Xiao*, Zheng Wang, Gegang Pu, Bin Gu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

XML has been widely applied in kinds of areas and applications as a data exchange format. Recently, plenty of of languages based on XML emerge. There are many constraints specified by natural language in these XML-based language specifications to regulate the rules that are supposed to be obeyed by designers or programmers. To specify those constraints precisely, we present a relational calculus to capture them. Meanwhile, by means of the constraint solvers (SAT or SMT solver), we can decide that whether a XML-based document satisfies the constraints specified in its corresponding specification.

Original languageEnglish
Title of host publicationSSIRI-C 2010 - 4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion
Pages26-27
Number of pages2
DOIs
StatePublished - 2010
Event4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion, SSIRI-C 2010 - Singapore, Singapore
Duration: 9 Jun 201011 Jun 2010

Publication series

NameSSIRI-C 2010 - 4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion

Conference

Conference4th IEEE International Conference on Secure Software Integration and Reliability Improvement Companion, SSIRI-C 2010
Country/TerritorySingapore
CitySingapore
Period9/06/1011/06/10

Fingerprint

Dive into the research topics of 'Constraint checking for XML-based language specification by SAT solver'. Together they form a unique fingerprint.

Cite this