{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:UJIAFBJL6L77TI776P5V6DHQ5L","short_pith_number":"pith:UJIAFBJL","schema_version":"1.0","canonical_sha256":"a25002852bf2fff9a3fff3fb5f0cf0eae1c7c49ceaaf4bf3fda4d20f98680433","source":{"kind":"arxiv","id":"2205.08762","version":1},"attestation_state":"computed","paper":{"title":"Leapfrog: Certified Equivalence for Protocol Parsers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Greg Morrisett, John Sarracino, Nate Foster, Ryan Doenges, Tobias Kapp\\'e","submitted_at":"2022-05-18T07:19:19Z","abstract_excerpt":"We present Leapfrog, a Coq-based framework for verifying equivalence of network protocol parsers. Our approach is based on an automata model of P4 parsers, and an algorithm for symbolically computing a compact representation of a bisimulation, using \"leaps.\" Proofs are powered by a certified compilation chain from first-order entailments to low-level bitvector verification conditions, which are discharged using off-the-shelf SMT solvers. As a result, parser equivalence proofs in Leapfrog are fully automatic and push-button.\n  We mechanically prove the core metatheory that underpins our approac"},"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":"2205.08762","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-05-18T07:19:19Z","cross_cats_sorted":[],"title_canon_sha256":"fd9d7a6de316b0f396c0c7317f08ada8fff345dbb62a207ef0d4e50a8178e60c","abstract_canon_sha256":"22775ffb5494c8eb264debc31964c0c2cb30885f2ef19e2216e0ded488325791"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:08.470842Z","signature_b64":"N3OX71vRju2/DLJbpa/0CRO3AAeHzTob1rAoOycu1dRaHcEWAXkcDU0cXlLdPnPe75S9I0P587qKznGheev5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a25002852bf2fff9a3fff3fb5f0cf0eae1c7c49ceaaf4bf3fda4d20f98680433","last_reissued_at":"2026-07-05T05:38:08.470349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:08.470349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Leapfrog: Certified Equivalence for Protocol Parsers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Greg Morrisett, John Sarracino, Nate Foster, Ryan Doenges, Tobias Kapp\\'e","submitted_at":"2022-05-18T07:19:19Z","abstract_excerpt":"We present Leapfrog, a Coq-based framework for verifying equivalence of network protocol parsers. Our approach is based on an automata model of P4 parsers, and an algorithm for symbolically computing a compact representation of a bisimulation, using \"leaps.\" Proofs are powered by a certified compilation chain from first-order entailments to low-level bitvector verification conditions, which are discharged using off-the-shelf SMT solvers. As a result, parser equivalence proofs in Leapfrog are fully automatic and push-button.\n  We mechanically prove the core metatheory that underpins our approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08762","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.08762/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.08762","created_at":"2026-07-05T05:38:08.470409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08762v1","created_at":"2026-07-05T05:38:08.470409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08762","created_at":"2026-07-05T05:38:08.470409+00:00"},{"alias_kind":"pith_short_12","alias_value":"UJIAFBJL6L77","created_at":"2026-07-05T05:38:08.470409+00:00"},{"alias_kind":"pith_short_16","alias_value":"UJIAFBJL6L77TI77","created_at":"2026-07-05T05:38:08.470409+00:00"},{"alias_kind":"pith_short_8","alias_value":"UJIAFBJL","created_at":"2026-07-05T05:38:08.470409+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/UJIAFBJL6L77TI776P5V6DHQ5L","json":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L.json","graph_json":"https://pith.science/api/pith-number/UJIAFBJL6L77TI776P5V6DHQ5L/graph.json","events_json":"https://pith.science/api/pith-number/UJIAFBJL6L77TI776P5V6DHQ5L/events.json","paper":"https://pith.science/paper/UJIAFBJL"},"agent_actions":{"view_html":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L","download_json":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L.json","view_paper":"https://pith.science/paper/UJIAFBJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08762&json=true","fetch_graph":"https://pith.science/api/pith-number/UJIAFBJL6L77TI776P5V6DHQ5L/graph.json","fetch_events":"https://pith.science/api/pith-number/UJIAFBJL6L77TI776P5V6DHQ5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L/action/storage_attestation","attest_author":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L/action/author_attestation","sign_citation":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L/action/citation_signature","submit_replication":"https://pith.science/pith/UJIAFBJL6L77TI776P5V6DHQ5L/action/replication_record"}},"created_at":"2026-07-05T05:38:08.470409+00:00","updated_at":"2026-07-05T05:38:08.470409+00:00"}