{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6FMWYVM2JN6ZQ3GLH62GSSZHBQ","short_pith_number":"pith:6FMWYVM2","schema_version":"1.0","canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","source":{"kind":"arxiv","id":"1705.08262","version":1},"attestation_state":"computed","paper":{"title":"Verification of a lazy cache coherence protocol against a weak memory model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christopher J. Banks, Marco Elver, Paul Jackson, Ruth Hoffmann, Susmit Sarkar, Vijay Nagarajan","submitted_at":"2017-05-18T23:25:00Z","abstract_excerpt":"In this paper we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unlimited number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of forma"},"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":"1705.08262","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-05-18T23:25:00Z","cross_cats_sorted":[],"title_canon_sha256":"f48b057b657a4f028184e08ab062990e85af4e4f4a2ae4816f955ed3563e7841","abstract_canon_sha256":"518a98769bb8a27d0727ad3c20dfd2df5b0e7befc6bc51df640f284d6615623b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:48.873168Z","signature_b64":"+RF7rVB3GjVA6mj2dU9dfRaeJuls0blwFVBTigyrpsqqefn4AgCKQn+1TaTxEay5s6bnLMO2U9zz36WYQZqDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1596c559a4b7d986ccb3fb4694b270c18453cd34ebd944d45e8a7f5ee54a27d","last_reissued_at":"2026-05-18T00:43:48.872504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:48.872504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verification of a lazy cache coherence protocol against a weak memory model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christopher J. Banks, Marco Elver, Paul Jackson, Ruth Hoffmann, Susmit Sarkar, Vijay Nagarajan","submitted_at":"2017-05-18T23:25:00Z","abstract_excerpt":"In this paper we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unlimited number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of forma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08262","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":"1705.08262","created_at":"2026-05-18T00:43:48.872601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08262v1","created_at":"2026-05-18T00:43:48.872601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08262","created_at":"2026-05-18T00:43:48.872601+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FMWYVM2JN6Z","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FMWYVM2JN6ZQ3GL","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FMWYVM2","created_at":"2026-05-18T12:31:03.183658+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/6FMWYVM2JN6ZQ3GLH62GSSZHBQ","json":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ.json","graph_json":"https://pith.science/api/pith-number/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/graph.json","events_json":"https://pith.science/api/pith-number/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/events.json","paper":"https://pith.science/paper/6FMWYVM2"},"agent_actions":{"view_html":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ","download_json":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ.json","view_paper":"https://pith.science/paper/6FMWYVM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08262&json=true","fetch_graph":"https://pith.science/api/pith-number/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/action/storage_attestation","attest_author":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/action/author_attestation","sign_citation":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/action/citation_signature","submit_replication":"https://pith.science/pith/6FMWYVM2JN6ZQ3GLH62GSSZHBQ/action/replication_record"}},"created_at":"2026-05-18T00:43:48.872601+00:00","updated_at":"2026-05-18T00:43:48.872601+00:00"}