Verified decision procedures on context-free grammars

  • Authors:
  • Yasuhiko Minamide

  • Affiliations:
  • Department of Computer Science, University of Tsukuba

  • Venue:
  • TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We verify three decision procedures on context-free grammars utilized in a program analyzer for a server-side programming language. One of the procedures decides inclusion between a context-free language and a regular language. The other two decide decision problems related to the well-formedness and validity of XML documents. From its formalization, we generate executable code for a balancedness checking procedure and incorporate it into an existing program analyzer.