{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XGX5I6OZQBLHQOI2LMZT52RFMV","short_pith_number":"pith:XGX5I6OZ","schema_version":"1.0","canonical_sha256":"b9afd479d9805678391a5b333eea2565664cc79dcd5b90c49995842e7c2e8d1d","source":{"kind":"arxiv","id":"1511.02615","version":2},"attestation_state":"computed","paper":{"title":"Abstraction-driven Concolic Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ashutosh Gupta, Przemys{\\l}aw Daca, Thomas A. Henzinger","submitted_at":"2015-11-09T09:50:44Z","abstract_excerpt":"Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then "},"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":"1511.02615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-09T09:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"c32a1f5de2fc0d8db225b626c928415566b79434439cc4fa7332080fb2169306","abstract_canon_sha256":"b005e6dcd4e0402f1c323813974408ba7b63d2426d367c1d62ffee637d619292"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:45.769713Z","signature_b64":"uG9xJJA6qCR5Po2/YmAJYSTESP/z+lzlo2ResxRtxcWHbEIA0ITbFwchNycKaYFaZ+EIuPsIVECNfiq7/101Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9afd479d9805678391a5b333eea2565664cc79dcd5b90c49995842e7c2e8d1d","last_reissued_at":"2026-05-18T01:09:45.769235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:45.769235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstraction-driven Concolic Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ashutosh Gupta, Przemys{\\l}aw Daca, Thomas A. Henzinger","submitted_at":"2015-11-09T09:50:44Z","abstract_excerpt":"Concolic testing is a promising method for generating test suites for large programs. However, it suffers from the path-explosion problem and often fails to find tests that cover difficult-to-reach parts of programs. In contrast, model checkers based on counterexample-guided abstraction refinement explore programs exhaustively, while failing to scale on large programs with precision. In this paper, we present a novel method that iteratively combines concolic testing and model checking to find a test suite for a given coverage criterion. If concolic testing fails to cover some test goals, then "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02615","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":"1511.02615","created_at":"2026-05-18T01:09:45.769322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02615v2","created_at":"2026-05-18T01:09:45.769322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02615","created_at":"2026-05-18T01:09:45.769322+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGX5I6OZQBLH","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGX5I6OZQBLHQOI2","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGX5I6OZ","created_at":"2026-05-18T12:29:50.041715+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/XGX5I6OZQBLHQOI2LMZT52RFMV","json":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV.json","graph_json":"https://pith.science/api/pith-number/XGX5I6OZQBLHQOI2LMZT52RFMV/graph.json","events_json":"https://pith.science/api/pith-number/XGX5I6OZQBLHQOI2LMZT52RFMV/events.json","paper":"https://pith.science/paper/XGX5I6OZ"},"agent_actions":{"view_html":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV","download_json":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV.json","view_paper":"https://pith.science/paper/XGX5I6OZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02615&json=true","fetch_graph":"https://pith.science/api/pith-number/XGX5I6OZQBLHQOI2LMZT52RFMV/graph.json","fetch_events":"https://pith.science/api/pith-number/XGX5I6OZQBLHQOI2LMZT52RFMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV/action/storage_attestation","attest_author":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV/action/author_attestation","sign_citation":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV/action/citation_signature","submit_replication":"https://pith.science/pith/XGX5I6OZQBLHQOI2LMZT52RFMV/action/replication_record"}},"created_at":"2026-05-18T01:09:45.769322+00:00","updated_at":"2026-05-18T01:09:45.769322+00:00"}