{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LTGSTOSSTXT2CAPEVWMZ2QIS7S","short_pith_number":"pith:LTGSTOSS","schema_version":"1.0","canonical_sha256":"5ccd29ba529de7a101e4ad999d4112fc9c655d7dbfb1c0c5223a2edba6975536","source":{"kind":"arxiv","id":"2606.23870","version":1},"attestation_state":"computed","paper":{"title":"ESBMC-PLC+: A Unified IEC~61131-3 Formal Verification Framework as a PLCverif Successor","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.SE"],"primary_cat":"cs.PL","authors_text":"Lucas Cordeiro, Pierre Dantas, Waldir Junior","submitted_at":"2026-06-22T19:13:02Z","abstract_excerpt":"PLCverif is the most mature open-source platform for PLC formal verification, developed at CERN and in production use since 2019. Yet it has two fundamental limitations: no support for Ladder Diagram (LD) programs, the dominant PLC notation, and reliance on CBMC as its primary backend, which restricts verification to bounded proofs. The PLCverif authors themselves identified ESBMC as the appropriate backend improvement. Prior work established ESBMC-PLC (a textual LD frontend with k-induction) and ESBMC-GraphPLC (graphical PLCopen XML support); together, they cover LD with unbounded proofs but "},"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":"2606.23870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-06-22T19:13:02Z","cross_cats_sorted":["cs.CL","cs.SE"],"title_canon_sha256":"92d557e0c5106369f956205248c9ba7eadee85834d5609e9ace865e5c8c0b89f","abstract_canon_sha256":"0c202211f9f6a82b9f5876b84bdf870893be3af577042ac38956d31cb4e6af40"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:29.014081Z","signature_b64":"e531GZl6b/S36L27DNcoqwMHniTm1VlANggaMURiFRDWkKKpXK3cGhIs/TRb/KrnVGd3e2nAGoBm6DmLvkA0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ccd29ba529de7a101e4ad999d4112fc9c655d7dbfb1c0c5223a2edba6975536","last_reissued_at":"2026-06-24T00:14:29.013677Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:29.013677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ESBMC-PLC+: A Unified IEC~61131-3 Formal Verification Framework as a PLCverif Successor","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL","cs.SE"],"primary_cat":"cs.PL","authors_text":"Lucas Cordeiro, Pierre Dantas, Waldir Junior","submitted_at":"2026-06-22T19:13:02Z","abstract_excerpt":"PLCverif is the most mature open-source platform for PLC formal verification, developed at CERN and in production use since 2019. Yet it has two fundamental limitations: no support for Ladder Diagram (LD) programs, the dominant PLC notation, and reliance on CBMC as its primary backend, which restricts verification to bounded proofs. The PLCverif authors themselves identified ESBMC as the appropriate backend improvement. Prior work established ESBMC-PLC (a textual LD frontend with k-induction) and ESBMC-GraphPLC (graphical PLCopen XML support); together, they cover LD with unbounded proofs but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23870","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/2606.23870/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":"2606.23870","created_at":"2026-06-24T00:14:29.013741+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23870v1","created_at":"2026-06-24T00:14:29.013741+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23870","created_at":"2026-06-24T00:14:29.013741+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTGSTOSSTXT2","created_at":"2026-06-24T00:14:29.013741+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTGSTOSSTXT2CAPE","created_at":"2026-06-24T00:14:29.013741+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTGSTOSS","created_at":"2026-06-24T00:14:29.013741+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/LTGSTOSSTXT2CAPEVWMZ2QIS7S","json":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S.json","graph_json":"https://pith.science/api/pith-number/LTGSTOSSTXT2CAPEVWMZ2QIS7S/graph.json","events_json":"https://pith.science/api/pith-number/LTGSTOSSTXT2CAPEVWMZ2QIS7S/events.json","paper":"https://pith.science/paper/LTGSTOSS"},"agent_actions":{"view_html":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S","download_json":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S.json","view_paper":"https://pith.science/paper/LTGSTOSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23870&json=true","fetch_graph":"https://pith.science/api/pith-number/LTGSTOSSTXT2CAPEVWMZ2QIS7S/graph.json","fetch_events":"https://pith.science/api/pith-number/LTGSTOSSTXT2CAPEVWMZ2QIS7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S/action/storage_attestation","attest_author":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S/action/author_attestation","sign_citation":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S/action/citation_signature","submit_replication":"https://pith.science/pith/LTGSTOSSTXT2CAPEVWMZ2QIS7S/action/replication_record"}},"created_at":"2026-06-24T00:14:29.013741+00:00","updated_at":"2026-06-24T00:14:29.013741+00:00"}