An extensible framework for synthesizing efficient, verified parsers
Name
940969842-MIT.pdf
Description
Full printable version
Size
4.4 MB
Format
Adobe PDF
Checksum (MD5)
2d7d9c095be15d189d7f5c84dfa286a3
Author(s)
Gross, Jason S
Advisor(s)
Adam Chlipala.
Date Issued
2015
Publisher
Massachusetts Institute of Technology
Abstract
Parsers have a long history in computer science. This thesis proposes a novel approach to synthesizing efficient, verified parsers by refinement, and presents a demonstration of this approach in the Fiat framework by synthesizing a parser for arithmetic expressions. The benefits of this framework may include more flexibility in the parsers that can be described, more control over the low-level details when necessary for performance, and automatic or mostly automatic correctness proofs.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 73-75).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
Persistent DSpace Link
