{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OQGS6NIY2XWEZIOTO7EBHEUDH6","short_pith_number":"pith:OQGS6NIY","schema_version":"1.0","canonical_sha256":"740d2f3518d5ec4ca1d377c81392833f95af11d73e310b30f0eadfcf8c4e6a33","source":{"kind":"arxiv","id":"1112.0215","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Automated and Certified Refinement Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andreas Griesmayer, Charles Morisset, Shuling Wang, Zhiming Liu","submitted_at":"2011-12-01T15:43:48Z","abstract_excerpt":"The refinement calculus provides a methodology for transforming an abstract specification into a concrete implementation, by following a succession of refinement rules. These rules have been mechanized in theorem-provers, thus providing a formal and rigorous way to prove that a given program refines another one. In a previous work, we have extended this mechanization for object-oriented programs, where the memory is represented as a graph, and we have integrated our approach within the rCOS tool, a model-driven software development tool providing a refinement language. Hence, for any refinemen"},"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":"1112.0215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-12-01T15:43:48Z","cross_cats_sorted":[],"title_canon_sha256":"a48e528859bc0b2024ed1c77760291755315ea18336cf939cbc53b6abc75913d","abstract_canon_sha256":"94b7ca6b016d8ee2ec0a53b8ee63dff6603ee46efd9ae5481ddc3621650a744d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:16.539552Z","signature_b64":"by3fIUvqjzdFkpSd7xRCyGRxTJ7/K8t+s+85js9yCcDLAWdynWL13zm71cdqLYnGU0bEiJEAQUoG9iszX8foDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"740d2f3518d5ec4ca1d377c81392833f95af11d73e310b30f0eadfcf8c4e6a33","last_reissued_at":"2026-05-18T04:07:16.538847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:16.538847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Automated and Certified Refinement Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Andreas Griesmayer, Charles Morisset, Shuling Wang, Zhiming Liu","submitted_at":"2011-12-01T15:43:48Z","abstract_excerpt":"The refinement calculus provides a methodology for transforming an abstract specification into a concrete implementation, by following a succession of refinement rules. These rules have been mechanized in theorem-provers, thus providing a formal and rigorous way to prove that a given program refines another one. In a previous work, we have extended this mechanization for object-oriented programs, where the memory is represented as a graph, and we have integrated our approach within the rCOS tool, a model-driven software development tool providing a refinement language. Hence, for any refinemen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0215","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":"1112.0215","created_at":"2026-05-18T04:07:16.538967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0215v1","created_at":"2026-05-18T04:07:16.538967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0215","created_at":"2026-05-18T04:07:16.538967+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQGS6NIY2XWE","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQGS6NIY2XWEZIOT","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQGS6NIY","created_at":"2026-05-18T12:26:37.096874+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/OQGS6NIY2XWEZIOTO7EBHEUDH6","json":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6.json","graph_json":"https://pith.science/api/pith-number/OQGS6NIY2XWEZIOTO7EBHEUDH6/graph.json","events_json":"https://pith.science/api/pith-number/OQGS6NIY2XWEZIOTO7EBHEUDH6/events.json","paper":"https://pith.science/paper/OQGS6NIY"},"agent_actions":{"view_html":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6","download_json":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6.json","view_paper":"https://pith.science/paper/OQGS6NIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0215&json=true","fetch_graph":"https://pith.science/api/pith-number/OQGS6NIY2XWEZIOTO7EBHEUDH6/graph.json","fetch_events":"https://pith.science/api/pith-number/OQGS6NIY2XWEZIOTO7EBHEUDH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6/action/storage_attestation","attest_author":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6/action/author_attestation","sign_citation":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6/action/citation_signature","submit_replication":"https://pith.science/pith/OQGS6NIY2XWEZIOTO7EBHEUDH6/action/replication_record"}},"created_at":"2026-05-18T04:07:16.538967+00:00","updated_at":"2026-05-18T04:07:16.538967+00:00"}