Koprowski, Adam and Binsztok, Henri - TRX: A Formally Verified Parser Interpreter

lmcs:686 - Logical Methods in Computer Science, June 24, 2011, Volume 7, Issue 2
TRX: A Formally Verified Parser Interpreter

Authors: Koprowski, Adam and Binsztok, Henri

Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing formally correct parsers. We are using parsing expression grammars (PEGs), a formalism essentially representing recursive descent parsing, which we consider an attractive alternative to context-free grammars (CFGs). From this formalization we can extract a parser for an arbitrary PEG grammar with the warranty of total correctness, i.e., the resulting parser is terminating and correct with respect to its grammar and the semantics of PEGs; both properties formally proven in Coq.


Source : oai:arXiv.org:1105.2576
DOI : 10.2168/LMCS-7(2:18)2011
Volume: Volume 7, Issue 2
Published on: June 24, 2011
Submitted on: June 14, 2010
Keywords: Computer Science - Logic in Computer Science,Computer Science - Formal Languages and Automata Theory,Computer Science - Programming Languages,D.3.4, D.2.4, F.3.1, F.4.2


Share

Consultation statistics

This page has been seen 80 times.
This article's PDF has been downloaded 69 times.