{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SWB7JNVYZLKW3XFC6WK32Y3ULA","short_pith_number":"pith:SWB7JNVY","schema_version":"1.0","canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","source":{"kind":"arxiv","id":"1107.0349","version":1},"attestation_state":"computed","paper":{"title":"First-order finite satisfiability vs tree automata in safety verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexei Lisitsa","submitted_at":"2011-07-02T00:45:24Z","abstract_excerpt":"In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.\n  We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from "},"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":"1107.0349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-07-02T00:45:24Z","cross_cats_sorted":[],"title_canon_sha256":"ede364c6a7949f3b8f0ce8893647abee51d7c9edf693c5f8aa5ba1bea4163908","abstract_canon_sha256":"ddcdae43227d5d95bd684dcf82504b50b1bbb1058407d6abf4d41d11b3b63c48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:54.134166Z","signature_b64":"IptxQVUDNkAhUn8wY9BraEwb595ugZeKSB6gryWQOZKymkM0YbUo7fkKPFDS47EQuVaHAB+FQea3wnb33GrHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9583f4b6b8cad56ddca2f595bd637458099e12e00da7dbe7d52715c8160ef428","last_reissued_at":"2026-05-18T04:18:54.133731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:54.133731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"First-order finite satisfiability vs tree automata in safety verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexei Lisitsa","submitted_at":"2011-07-02T00:45:24Z","abstract_excerpt":"In this paper we deal with verification of safety properties of term-rewriting systems. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which further resolved by a generic finite model finding procedure. A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.\n  We show the relative completeness of this approach with respect to the tree automata completion technique. On a set of examples taken from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0349","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":"1107.0349","created_at":"2026-05-18T04:18:54.133798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0349v1","created_at":"2026-05-18T04:18:54.133798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0349","created_at":"2026-05-18T04:18:54.133798+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWB7JNVYZLKW","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWB7JNVYZLKW3XFC","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWB7JNVY","created_at":"2026-05-18T12:26:41.206345+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/SWB7JNVYZLKW3XFC6WK32Y3ULA","json":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA.json","graph_json":"https://pith.science/api/pith-number/SWB7JNVYZLKW3XFC6WK32Y3ULA/graph.json","events_json":"https://pith.science/api/pith-number/SWB7JNVYZLKW3XFC6WK32Y3ULA/events.json","paper":"https://pith.science/paper/SWB7JNVY"},"agent_actions":{"view_html":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA","download_json":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA.json","view_paper":"https://pith.science/paper/SWB7JNVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0349&json=true","fetch_graph":"https://pith.science/api/pith-number/SWB7JNVYZLKW3XFC6WK32Y3ULA/graph.json","fetch_events":"https://pith.science/api/pith-number/SWB7JNVYZLKW3XFC6WK32Y3ULA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/action/storage_attestation","attest_author":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/action/author_attestation","sign_citation":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/action/citation_signature","submit_replication":"https://pith.science/pith/SWB7JNVYZLKW3XFC6WK32Y3ULA/action/replication_record"}},"created_at":"2026-05-18T04:18:54.133798+00:00","updated_at":"2026-05-18T04:18:54.133798+00:00"}