{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUHSFRLECKZXVNCILO66MAPUSR","short_pith_number":"pith:RUHSFRLE","schema_version":"1.0","canonical_sha256":"8d0f22c56412b37ab4485bbde601f494411e1f003d3d719126884a71086d5d13","source":{"kind":"arxiv","id":"1508.07829","version":1},"attestation_state":"computed","paper":{"title":"Using Program Synthesis for Program Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Cristina David, Daniel Kroening, Matt Lewis","submitted_at":"2015-08-31T13:58:14Z","abstract_excerpt":"In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation). We call this fragment the {\\it synthesis fragment}. Satisfiability of a formula in the synthesis fragment is decidable over finite domains; specifically the decision problem is NEXPTIME-complete. If a formula in this fragment is satisfiable, a solution consists of a satisfying assignment from the second order variables to \\emph{functions ov"},"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":"1508.07829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-31T13:58:14Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"f5efd1e65f16e2fe062447b025e8b8450935171224611925d7a6c5327f947547","abstract_canon_sha256":"68b92d36c712007965b5a8a18cb2133b2b30823dc1a1ed9bc1684eb03de3c8c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:31.372623Z","signature_b64":"htjNxHR4oW8Y+vnxH4E3ECJp36cCwM/iF1moPYTWJck0LszT+FgWEmOcUOogDz4uWZPxJfPYdZvzVj62OeZiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d0f22c56412b37ab4485bbde601f494411e1f003d3d719126884a71086d5d13","last_reissued_at":"2026-05-18T01:34:31.372152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:31.372152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Program Synthesis for Program Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Cristina David, Daniel Kroening, Matt Lewis","submitted_at":"2015-08-31T13:58:14Z","abstract_excerpt":"In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation). We call this fragment the {\\it synthesis fragment}. Satisfiability of a formula in the synthesis fragment is decidable over finite domains; specifically the decision problem is NEXPTIME-complete. If a formula in this fragment is satisfiable, a solution consists of a satisfying assignment from the second order variables to \\emph{functions ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07829","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":"1508.07829","created_at":"2026-05-18T01:34:31.372233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07829v1","created_at":"2026-05-18T01:34:31.372233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07829","created_at":"2026-05-18T01:34:31.372233+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUHSFRLECKZX","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUHSFRLECKZXVNCI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUHSFRLE","created_at":"2026-05-18T12:29:39.896362+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/RUHSFRLECKZXVNCILO66MAPUSR","json":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR.json","graph_json":"https://pith.science/api/pith-number/RUHSFRLECKZXVNCILO66MAPUSR/graph.json","events_json":"https://pith.science/api/pith-number/RUHSFRLECKZXVNCILO66MAPUSR/events.json","paper":"https://pith.science/paper/RUHSFRLE"},"agent_actions":{"view_html":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR","download_json":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR.json","view_paper":"https://pith.science/paper/RUHSFRLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07829&json=true","fetch_graph":"https://pith.science/api/pith-number/RUHSFRLECKZXVNCILO66MAPUSR/graph.json","fetch_events":"https://pith.science/api/pith-number/RUHSFRLECKZXVNCILO66MAPUSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR/action/storage_attestation","attest_author":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR/action/author_attestation","sign_citation":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR/action/citation_signature","submit_replication":"https://pith.science/pith/RUHSFRLECKZXVNCILO66MAPUSR/action/replication_record"}},"created_at":"2026-05-18T01:34:31.372233+00:00","updated_at":"2026-05-18T01:34:31.372233+00:00"}