{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4FTH2GLMSQKJIDQZYLGUDLF2JL","short_pith_number":"pith:4FTH2GLM","schema_version":"1.0","canonical_sha256":"e1667d196c9414940e19c2cd41acba4add818f037b3b80c2b11d1de0346359f2","source":{"kind":"arxiv","id":"1712.09818","version":1},"attestation_state":"computed","paper":{"title":"Automated Formal Equivalence Verification of Pipelined Nested Loops in Datapath Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bijan Alizadeh, Payman Behnam, Sajjad Taheri","submitted_at":"2017-12-28T10:46:05Z","abstract_excerpt":"In this paper, we present an efficient formal approach to check the equivalence of synthesized RTL against the high-level specification in the presence of pipelining transformations. To increase the scalability of our proposed method, we dynamically divide the designs into several smaller parts called segments by introducing cut-points. Then we employ Modular Horner Expansion Diagram (M-HED) to check whether the specification and implementation are equivalent or not. In an iterative manner, the equivalence checking for each segment is performed. At each step, the equivalent nodes and those nod"},"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":"1712.09818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2017-12-28T10:46:05Z","cross_cats_sorted":[],"title_canon_sha256":"75f48fcbb696de7d846035169f204c0316a950de2a9ba9a0dafd401cea8a6280","abstract_canon_sha256":"ef332dadbd9b80cf90c0574a75ab1469ac3c79ff16d6cd14f47d38d547a2ea2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.466817Z","signature_b64":"XhAIxmB7AUy8+hAuoOi6L3rSCmQT/OibF8YIV58LHaeQkYRMLmf+PufMcHrlMOWJ5cS78V/uhsPOlx98beYGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1667d196c9414940e19c2cd41acba4add818f037b3b80c2b11d1de0346359f2","last_reissued_at":"2026-05-18T00:27:05.466224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.466224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Formal Equivalence Verification of Pipelined Nested Loops in Datapath Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Bijan Alizadeh, Payman Behnam, Sajjad Taheri","submitted_at":"2017-12-28T10:46:05Z","abstract_excerpt":"In this paper, we present an efficient formal approach to check the equivalence of synthesized RTL against the high-level specification in the presence of pipelining transformations. To increase the scalability of our proposed method, we dynamically divide the designs into several smaller parts called segments by introducing cut-points. Then we employ Modular Horner Expansion Diagram (M-HED) to check whether the specification and implementation are equivalent or not. In an iterative manner, the equivalence checking for each segment is performed. At each step, the equivalent nodes and those nod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09818","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":"1712.09818","created_at":"2026-05-18T00:27:05.466307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09818v1","created_at":"2026-05-18T00:27:05.466307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09818","created_at":"2026-05-18T00:27:05.466307+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FTH2GLMSQKJ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FTH2GLMSQKJIDQZ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FTH2GLM","created_at":"2026-05-18T12:30:58.224056+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/4FTH2GLMSQKJIDQZYLGUDLF2JL","json":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL.json","graph_json":"https://pith.science/api/pith-number/4FTH2GLMSQKJIDQZYLGUDLF2JL/graph.json","events_json":"https://pith.science/api/pith-number/4FTH2GLMSQKJIDQZYLGUDLF2JL/events.json","paper":"https://pith.science/paper/4FTH2GLM"},"agent_actions":{"view_html":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL","download_json":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL.json","view_paper":"https://pith.science/paper/4FTH2GLM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09818&json=true","fetch_graph":"https://pith.science/api/pith-number/4FTH2GLMSQKJIDQZYLGUDLF2JL/graph.json","fetch_events":"https://pith.science/api/pith-number/4FTH2GLMSQKJIDQZYLGUDLF2JL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL/action/storage_attestation","attest_author":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL/action/author_attestation","sign_citation":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL/action/citation_signature","submit_replication":"https://pith.science/pith/4FTH2GLMSQKJIDQZYLGUDLF2JL/action/replication_record"}},"created_at":"2026-05-18T00:27:05.466307+00:00","updated_at":"2026-05-18T00:27:05.466307+00:00"}