{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:567EC5XTFNA2APWFVZTTOYLNGW","short_pith_number":"pith:567EC5XT","schema_version":"1.0","canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","source":{"kind":"arxiv","id":"1503.04320","version":2},"attestation_state":"computed","paper":{"title":"Using models to model-check recursive schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Igor Walukiewicz (CNRS, LaBRI, Sylvain Salvati (INRIA, universit\\'e de Bordeaux)","submitted_at":"2015-03-14T16:29:34Z","abstract_excerpt":"We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, "},"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":"1503.04320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"96ca7138673112e5969e55f605a4600c3c6aeb597f61117ac12a777646e316d8","abstract_canon_sha256":"a7b18c9114f6c8677ffcc88398592cd49557e03835daa5b2390aca446f3d23f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.862930Z","signature_b64":"2qKaHen3XEweL6vPnBQyBV4rqbIpKpuWnZW6UIeOyzCjNdavnncbHfyb//mt67pz+aDOI7ScbEkkfcbdZt8cBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","last_reissued_at":"2026-05-18T00:53:10.862468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.862468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using models to model-check recursive schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Igor Walukiewicz (CNRS, LaBRI, Sylvain Salvati (INRIA, universit\\'e de Bordeaux)","submitted_at":"2015-03-14T16:29:34Z","abstract_excerpt":"We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04320","kind":"arxiv","version":2},"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":"1503.04320","created_at":"2026-05-18T00:53:10.862531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04320v2","created_at":"2026-05-18T00:53:10.862531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04320","created_at":"2026-05-18T00:53:10.862531+00:00"},{"alias_kind":"pith_short_12","alias_value":"567EC5XTFNA2","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"567EC5XTFNA2APWF","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"567EC5XT","created_at":"2026-05-18T12:29:05.191682+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/567EC5XTFNA2APWFVZTTOYLNGW","json":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW.json","graph_json":"https://pith.science/api/pith-number/567EC5XTFNA2APWFVZTTOYLNGW/graph.json","events_json":"https://pith.science/api/pith-number/567EC5XTFNA2APWFVZTTOYLNGW/events.json","paper":"https://pith.science/paper/567EC5XT"},"agent_actions":{"view_html":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW","download_json":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW.json","view_paper":"https://pith.science/paper/567EC5XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04320&json=true","fetch_graph":"https://pith.science/api/pith-number/567EC5XTFNA2APWFVZTTOYLNGW/graph.json","fetch_events":"https://pith.science/api/pith-number/567EC5XTFNA2APWFVZTTOYLNGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/action/storage_attestation","attest_author":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/action/author_attestation","sign_citation":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/action/citation_signature","submit_replication":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/action/replication_record"}},"created_at":"2026-05-18T00:53:10.862531+00:00","updated_at":"2026-05-18T00:53:10.862531+00:00"}