{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RMSH557XHVVKBQ6R2AXCIPE3BN","short_pith_number":"pith:RMSH557X","schema_version":"1.0","canonical_sha256":"8b247ef7f73d6aa0c3d1d02e243c9b0b66dcb960c5c256f2e78c850e1419cfc6","source":{"kind":"arxiv","id":"1105.2576","version":2},"attestation_state":"computed","paper":{"title":"TRX: A Formally Verified Parser Interpreter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.PL"],"primary_cat":"cs.LO","authors_text":"Adam Koprowski (MLstate, France), Henri Binsztok (MLstate, Paris","submitted_at":"2011-05-12T20:43:38Z","abstract_excerpt":"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 re"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1105.2576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-12T20:43:38Z","cross_cats_sorted":["cs.FL","cs.PL"],"title_canon_sha256":"abfe76975af32ad8be51a3d80610e2d33230afcc3257b5e878646043f26616df","abstract_canon_sha256":"06921eb972aad2f31482f3551e645a3db4301f70a65497d2df0acf5329d681cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.497434Z","signature_b64":"B5T9YH9NuruF4YJaEgAppkawYF/pt2zpeLqLs3x2a82OWFpt8iDvS+o12+A1FUE9VgyCv/Ip4794PenndIgHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b247ef7f73d6aa0c3d1d02e243c9b0b66dcb960c5c256f2e78c850e1419cfc6","last_reissued_at":"2026-05-18T01:37:39.496786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.496786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TRX: A Formally Verified Parser Interpreter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.PL"],"primary_cat":"cs.LO","authors_text":"Adam Koprowski (MLstate, France), Henri Binsztok (MLstate, Paris","submitted_at":"2011-05-12T20:43:38Z","abstract_excerpt":"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 re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2576","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.2576","created_at":"2026-05-18T01:37:39.496872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2576v2","created_at":"2026-05-18T01:37:39.496872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2576","created_at":"2026-05-18T01:37:39.496872+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMSH557XHVVK","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMSH557XHVVKBQ6R","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMSH557X","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN","json":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN.json","graph_json":"https://pith.science/api/pith-number/RMSH557XHVVKBQ6R2AXCIPE3BN/graph.json","events_json":"https://pith.science/api/pith-number/RMSH557XHVVKBQ6R2AXCIPE3BN/events.json","paper":"https://pith.science/paper/RMSH557X"},"agent_actions":{"view_html":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN","download_json":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN.json","view_paper":"https://pith.science/paper/RMSH557X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2576&json=true","fetch_graph":"https://pith.science/api/pith-number/RMSH557XHVVKBQ6R2AXCIPE3BN/graph.json","fetch_events":"https://pith.science/api/pith-number/RMSH557XHVVKBQ6R2AXCIPE3BN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN/action/storage_attestation","attest_author":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN/action/author_attestation","sign_citation":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN/action/citation_signature","submit_replication":"https://pith.science/pith/RMSH557XHVVKBQ6R2AXCIPE3BN/action/replication_record"}},"created_at":"2026-05-18T01:37:39.496872+00:00","updated_at":"2026-05-18T01:37:39.496872+00:00"}