{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OECRMODX5JB2VDNQ6ME3C2GN7K","short_pith_number":"pith:OECRMODX","schema_version":"1.0","canonical_sha256":"7105163877ea43aa8db0f309b168cdfa9f2b101530fc4d000d423e18c257ece3","source":{"kind":"arxiv","id":"1504.07041","version":3},"attestation_state":"computed","paper":{"title":"On the Verification of SCOOP Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bertrand Meyer, Georgiana Caltais","submitted_at":"2015-04-27T12:01:43Z","abstract_excerpt":"In this paper we focus on the development of a toolbox for the verification of programs in the context of SCOOP -- an elegant concurrency model, recently formalized based on Rewriting Logic (RL) and Maude. SCOOP is implemented in Eiffel and its applicability is demonstrated also from a practical perspective, in the area of robotics programming. Our contribution consists in devising and integrating an alias analyzer and a Coffman deadlock detector under the roof of the same RL-based semantic framework of SCOOP. This enables using the Maude rewriting engine and its LTL model-checker \"for free\", "},"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":"1504.07041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2015-04-27T12:01:43Z","cross_cats_sorted":[],"title_canon_sha256":"865d5cd216e1878b2448f467fa5887f3c294138a02271186cbc7c3364810a489","abstract_canon_sha256":"21c5cb134450bfc3bc11d527e71ba0d982665ec5f8bcd5ce1bf28f1108fdfbf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:23.696029Z","signature_b64":"M5FNRyvYQhMIIj5OxlAKYrbR0UV6DbKwGHXy7JTCI7eT9ZVynd7atYIX+znABvVtO35nSvOxDoYr8Ws+/CioBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7105163877ea43aa8db0f309b168cdfa9f2b101530fc4d000d423e18c257ece3","last_reissued_at":"2026-05-18T02:17:23.695293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:23.695293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Verification of SCOOP Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Bertrand Meyer, Georgiana Caltais","submitted_at":"2015-04-27T12:01:43Z","abstract_excerpt":"In this paper we focus on the development of a toolbox for the verification of programs in the context of SCOOP -- an elegant concurrency model, recently formalized based on Rewriting Logic (RL) and Maude. SCOOP is implemented in Eiffel and its applicability is demonstrated also from a practical perspective, in the area of robotics programming. Our contribution consists in devising and integrating an alias analyzer and a Coffman deadlock detector under the roof of the same RL-based semantic framework of SCOOP. This enables using the Maude rewriting engine and its LTL model-checker \"for free\", "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07041","kind":"arxiv","version":3},"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":"1504.07041","created_at":"2026-05-18T02:17:23.695437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07041v3","created_at":"2026-05-18T02:17:23.695437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07041","created_at":"2026-05-18T02:17:23.695437+00:00"},{"alias_kind":"pith_short_12","alias_value":"OECRMODX5JB2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OECRMODX5JB2VDNQ","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OECRMODX","created_at":"2026-05-18T12:29:34.919912+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/OECRMODX5JB2VDNQ6ME3C2GN7K","json":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K.json","graph_json":"https://pith.science/api/pith-number/OECRMODX5JB2VDNQ6ME3C2GN7K/graph.json","events_json":"https://pith.science/api/pith-number/OECRMODX5JB2VDNQ6ME3C2GN7K/events.json","paper":"https://pith.science/paper/OECRMODX"},"agent_actions":{"view_html":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K","download_json":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K.json","view_paper":"https://pith.science/paper/OECRMODX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07041&json=true","fetch_graph":"https://pith.science/api/pith-number/OECRMODX5JB2VDNQ6ME3C2GN7K/graph.json","fetch_events":"https://pith.science/api/pith-number/OECRMODX5JB2VDNQ6ME3C2GN7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K/action/storage_attestation","attest_author":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K/action/author_attestation","sign_citation":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K/action/citation_signature","submit_replication":"https://pith.science/pith/OECRMODX5JB2VDNQ6ME3C2GN7K/action/replication_record"}},"created_at":"2026-05-18T02:17:23.695437+00:00","updated_at":"2026-05-18T02:17:23.695437+00:00"}