Constraint Checking for XML-Based Language Specification by SAT Solver

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.