Verified Decision Procedures on Context-Free Grammars [chapter]

Yasuhiko Minamide
Lecture Notes in Computer Science  
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. genv-onestep
doi:10.1007/978-3-540-74591-4_14 fatcat:fuozf3w5b5awvgbc6rcpm3xvk4