An extensible framework for synthesizing efficient, verified parsers
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/101581 |
| _version_ | 1811091996126740480 |
|---|---|
| author | Gross, Jason S |
| author2 | Adam Chlipala. |
| author_facet | Adam Chlipala. Gross, Jason S |
| author_sort | Gross, Jason S |
| collection | MIT |
| description | Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. |
| first_indexed | 2024-09-23T15:11:15Z |
| format | Thesis |
| id | mit-1721.1/101581 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T15:11:15Z |
| publishDate | 2016 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/1015812019-04-11T04:22:18Z An extensible framework for synthesizing efficient, verified parsers Gross, Jason S Adam Chlipala. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. 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). 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. by Jason S. Gross. S.M. 2016-03-03T21:10:19Z 2016-03-03T21:10:19Z 2015 2015 Thesis http://hdl.handle.net/1721.1/101581 940969842 eng 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. http://dspace.mit.edu/handle/1721.1/7582 75 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Gross, Jason S An extensible framework for synthesizing efficient, verified parsers |
| title | An extensible framework for synthesizing efficient, verified parsers |
| title_full | An extensible framework for synthesizing efficient, verified parsers |
| title_fullStr | An extensible framework for synthesizing efficient, verified parsers |
| title_full_unstemmed | An extensible framework for synthesizing efficient, verified parsers |
| title_short | An extensible framework for synthesizing efficient, verified parsers |
| title_sort | extensible framework for synthesizing efficient verified parsers |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/101581 |
| work_keys_str_mv | AT grossjasons anextensibleframeworkforsynthesizingefficientverifiedparsers AT grossjasons extensibleframeworkforsynthesizingefficientverifiedparsers |