{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ANI2JWXD32T5WFD26HKC4D5YWA","short_pith_number":"pith:ANI2JWXD","schema_version":"1.0","canonical_sha256":"0351a4dae3dea7db147af1d42e0fb8b0335033d291a26b3664781254ef023d76","source":{"kind":"arxiv","id":"2307.16537","version":1},"attestation_state":"computed","paper":{"title":"Compositional Verification in Rewriting Logic","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Alberto Verdejo, Narciso Mart\\'i-Oliet, \\'Oscar Mart\\'in","submitted_at":"2023-07-31T10:05:23Z","abstract_excerpt":"In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee technique can be transposed to our setting, by giving appropriate definitions of satisfaction based on transition structures and path semantics. We also show that simulation and equational abstraction can be done componentwise. Appropriate concepts of fairness and deadlock for our composition operation are "},"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":"2307.16537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LO","submitted_at":"2023-07-31T10:05:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3cb97ad7903ecf28d5d7adf77a1f1491344abd3862130946b70a12c03811aee9","abstract_canon_sha256":"c3c89473bf51f49659610f2f5e115a011f8dd730fafcd249853c1ffbfe335fb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:04.840691Z","signature_b64":"mdpdMe5ysCm3YcxeOZF8+T8lPLQX1ZMWyCnWAg3FjnolN4Pq6lsp55g0HFaRJBJIYW26Vo1AjoT+rnLOlb2VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0351a4dae3dea7db147af1d42e0fb8b0335033d291a26b3664781254ef023d76","last_reissued_at":"2026-07-05T06:36:04.840161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:04.840161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Verification in Rewriting Logic","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Alberto Verdejo, Narciso Mart\\'i-Oliet, \\'Oscar Mart\\'in","submitted_at":"2023-07-31T10:05:23Z","abstract_excerpt":"In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on compositional verification. We show how the assume/guarantee technique can be transposed to our setting, by giving appropriate definitions of satisfaction based on transition structures and path semantics. We also show that simulation and equational abstraction can be done componentwise. Appropriate concepts of fairness and deadlock for our composition operation are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16537","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/2307.16537/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":"2307.16537","created_at":"2026-07-05T06:36:04.840226+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.16537v1","created_at":"2026-07-05T06:36:04.840226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16537","created_at":"2026-07-05T06:36:04.840226+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANI2JWXD32T5","created_at":"2026-07-05T06:36:04.840226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANI2JWXD32T5WFD2","created_at":"2026-07-05T06:36:04.840226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANI2JWXD","created_at":"2026-07-05T06:36:04.840226+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/ANI2JWXD32T5WFD26HKC4D5YWA","json":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA.json","graph_json":"https://pith.science/api/pith-number/ANI2JWXD32T5WFD26HKC4D5YWA/graph.json","events_json":"https://pith.science/api/pith-number/ANI2JWXD32T5WFD26HKC4D5YWA/events.json","paper":"https://pith.science/paper/ANI2JWXD"},"agent_actions":{"view_html":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA","download_json":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA.json","view_paper":"https://pith.science/paper/ANI2JWXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.16537&json=true","fetch_graph":"https://pith.science/api/pith-number/ANI2JWXD32T5WFD26HKC4D5YWA/graph.json","fetch_events":"https://pith.science/api/pith-number/ANI2JWXD32T5WFD26HKC4D5YWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA/action/storage_attestation","attest_author":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA/action/author_attestation","sign_citation":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA/action/citation_signature","submit_replication":"https://pith.science/pith/ANI2JWXD32T5WFD26HKC4D5YWA/action/replication_record"}},"created_at":"2026-07-05T06:36:04.840226+00:00","updated_at":"2026-07-05T06:36:04.840226+00:00"}