{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZTWJ425EAPM6PFSTPF3FWK3X32","short_pith_number":"pith:ZTWJ425E","schema_version":"1.0","canonical_sha256":"ccec9e6ba403d9e7965379765b2b77de86be3e8391eb476b89a1998415e1bd8a","source":{"kind":"arxiv","id":"2405.16792","version":2},"attestation_state":"computed","paper":{"title":"Laurel: Unblocking Automated Verification with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Emmanuel Anaya Gonzalez, Eric Mugnier, Nadia Polikarpova, Ranjit Jhala, Yuanyuan Zhou","submitted_at":"2024-05-27T03:26:01Z","abstract_excerpt":"Program verifiers such as Dafny automate proofs by outsourcing them to an SMT solver. This automation is not perfect, however, and the solver often requires hints in the form of assertions, creating a burden for the proof engineer. In this paper, we propose Laurel, a tool that alleviates this burden by automatically generating assertions using large language models (LLMs). To improve the success rate of LLMs in this task, we design two domain-specific prompting techniques. First, we help the LLM determine the location of the missing assertion by analyzing the verifier's error message and inser"},"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":"2405.16792","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-05-27T03:26:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"82d6b07499b08e0673d1f04d3d8aba9a1126259bb5aa3628be08f11d523ddad6","abstract_canon_sha256":"1e2a9f07d9a829fad54b96ebcd422ee85d5fe32a48ec19a89008d2632abcf13c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:19.672181Z","signature_b64":"QSQyd54gRYds5/r+8awYrtM7GlJ4Q5DRbjHPG0AJqV1JZRoPuAtfsEV4Jon2ocs6yG3DLo+uFKWCJloOBGTmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccec9e6ba403d9e7965379765b2b77de86be3e8391eb476b89a1998415e1bd8a","last_reissued_at":"2026-07-05T10:23:19.671349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:19.671349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laurel: Unblocking Automated Verification with Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Emmanuel Anaya Gonzalez, Eric Mugnier, Nadia Polikarpova, Ranjit Jhala, Yuanyuan Zhou","submitted_at":"2024-05-27T03:26:01Z","abstract_excerpt":"Program verifiers such as Dafny automate proofs by outsourcing them to an SMT solver. This automation is not perfect, however, and the solver often requires hints in the form of assertions, creating a burden for the proof engineer. In this paper, we propose Laurel, a tool that alleviates this burden by automatically generating assertions using large language models (LLMs). To improve the success rate of LLMs in this task, we design two domain-specific prompting techniques. First, we help the LLM determine the location of the missing assertion by analyzing the verifier's error message and inser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16792","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16792/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":"2405.16792","created_at":"2026-07-05T10:23:19.671452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16792v2","created_at":"2026-07-05T10:23:19.671452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16792","created_at":"2026-07-05T10:23:19.671452+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTWJ425EAPM6","created_at":"2026-07-05T10:23:19.671452+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTWJ425EAPM6PFST","created_at":"2026-07-05T10:23:19.671452+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTWJ425E","created_at":"2026-07-05T10:23:19.671452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":95,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23109","citing_title":"Inductive Deductive Synthesis: Enabling AI to Generate Formally Verified Systems","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18436","citing_title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05820","citing_title":"SpecRL: Reinforcement Learning with Test-Based Completeness Rewards for Formal Specification Synthesis","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05080","citing_title":"Nidus: Externalized Reasoning for AI-Assisted Engineering","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32","json":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32.json","graph_json":"https://pith.science/api/pith-number/ZTWJ425EAPM6PFSTPF3FWK3X32/graph.json","events_json":"https://pith.science/api/pith-number/ZTWJ425EAPM6PFSTPF3FWK3X32/events.json","paper":"https://pith.science/paper/ZTWJ425E"},"agent_actions":{"view_html":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32","download_json":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32.json","view_paper":"https://pith.science/paper/ZTWJ425E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16792&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTWJ425EAPM6PFSTPF3FWK3X32/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTWJ425EAPM6PFSTPF3FWK3X32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32/action/storage_attestation","attest_author":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32/action/author_attestation","sign_citation":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32/action/citation_signature","submit_replication":"https://pith.science/pith/ZTWJ425EAPM6PFSTPF3FWK3X32/action/replication_record"}},"created_at":"2026-07-05T10:23:19.671452+00:00","updated_at":"2026-07-05T10:23:19.671452+00:00"}