{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXXSSXDORH4XSRLC6KBDK25TVE","short_pith_number":"pith:MXXSSXDO","schema_version":"1.0","canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","source":{"kind":"arxiv","id":"1709.05045","version":1},"attestation_state":"computed","paper":{"title":"A Constructor-Based Reachability Logic for Rewrite Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrei Stefanescu, Jos\\'e Meseguer, Stephen Skeirik","submitted_at":"2017-09-15T03:37:46Z","abstract_excerpt":"Reachability logic has been applied to $\\mathbb{K}$ rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic's automation is increased by means of constructor-based semantic unification, matching, and satisfiability procedures. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation il"},"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":"1709.05045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-09-15T03:37:46Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"90003f458e4509aba6748f8182a55995d7f694e581f845e7bba23712812b46f9","abstract_canon_sha256":"0c2006367f2a34f9443c954785fe2965ea4e0e1d872d55158e935c84243405fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:06.858345Z","signature_b64":"cTB27hv/IjoSZ8/QIGFTiob7BAaIr+ju/ZBs2ZdXDKpfk/+qOSjGLgqoHWO5P+gGjz1kptIG7tfbiABitv2TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65ef295c6e89f9794562f282356bb3a91a750bbaa62ba37daa9be5bc3fca9c26","last_reissued_at":"2026-05-18T00:35:06.857866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:06.857866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constructor-Based Reachability Logic for Rewrite Theories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Andrei Stefanescu, Jos\\'e Meseguer, Stephen Skeirik","submitted_at":"2017-09-15T03:37:46Z","abstract_excerpt":"Reachability logic has been applied to $\\mathbb{K}$ rewrite-rule-based language definitions as a language-generic logic of programs. To be able to verify not just code but also distributed system designs, a new rewrite-theory-generic reachability logic is presented and proved sound for a wide class of rewrite theories. The logic's automation is increased by means of constructor-based semantic unification, matching, and satisfiability procedures. New methods for proving invariants of possibly never terminating distributed systems are developed, and experiments with a prototype implementation il"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05045","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":""},"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":"1709.05045","created_at":"2026-05-18T00:35:06.857936+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05045v1","created_at":"2026-05-18T00:35:06.857936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05045","created_at":"2026-05-18T00:35:06.857936+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXXSSXDORH4X","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXXSSXDORH4XSRLC","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXXSSXDO","created_at":"2026-05-18T12:31:31.346846+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/MXXSSXDORH4XSRLC6KBDK25TVE","json":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE.json","graph_json":"https://pith.science/api/pith-number/MXXSSXDORH4XSRLC6KBDK25TVE/graph.json","events_json":"https://pith.science/api/pith-number/MXXSSXDORH4XSRLC6KBDK25TVE/events.json","paper":"https://pith.science/paper/MXXSSXDO"},"agent_actions":{"view_html":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE","download_json":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE.json","view_paper":"https://pith.science/paper/MXXSSXDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05045&json=true","fetch_graph":"https://pith.science/api/pith-number/MXXSSXDORH4XSRLC6KBDK25TVE/graph.json","fetch_events":"https://pith.science/api/pith-number/MXXSSXDORH4XSRLC6KBDK25TVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/action/storage_attestation","attest_author":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/action/author_attestation","sign_citation":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/action/citation_signature","submit_replication":"https://pith.science/pith/MXXSSXDORH4XSRLC6KBDK25TVE/action/replication_record"}},"created_at":"2026-05-18T00:35:06.857936+00:00","updated_at":"2026-05-18T00:35:06.857936+00:00"}