{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OYV3THN4FOCEQ3WBNKYHEQNZFB","short_pith_number":"pith:OYV3THN4","schema_version":"1.0","canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","source":{"kind":"arxiv","id":"1903.11768","version":1},"attestation_state":"computed","paper":{"title":"SymInfer: Inferring Program Invariants using Symbolic States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Matthew B. Dwyer, ThanhVu Nguyen, Willem Visser","submitted_at":"2019-03-28T02:55:53Z","abstract_excerpt":"We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces"},"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":"1903.11768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-03-28T02:55:53Z","cross_cats_sorted":[],"title_canon_sha256":"640dd828f732a4119a368900a71b1126dbac5a035e77eeec76d6c0eada7cf20a","abstract_canon_sha256":"ef556549c54196df331cca6bbd0451d276028b450c98ff73e1a1b6e205f2c200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:01.836076Z","signature_b64":"a+gtx7NSY0Qj3kVAO0ZV9TKarXr0hsoIwNNk1gVOrlNn3s/R/ZFGFpWpqawbW8q3WQJN5syDjfgnRbv9nAx+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762bb99dbc2b84486ec16ab07241b9287830e921a4413cb1933beba30ce9cda6","last_reissued_at":"2026-05-17T23:50:01.835612Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:01.835612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SymInfer: Inferring Program Invariants using Symbolic States","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Matthew B. Dwyer, ThanhVu Nguyen, Willem Visser","submitted_at":"2019-03-28T02:55:53Z","abstract_excerpt":"We introduce a new technique for inferring program invariants that uses symbolic states generated by symbolic execution. Symbolic states, which consist of path conditions and constraints on local variables, are a compact description of sets of concrete program states and they can be used for both invariant inference and invariant verification. Our technique uses a counterexample-based algorithm that creates concrete states from symbolic states, infers candidate invariants from concrete states, and then verifies or refutes candidate invariants using symbolic states. The refutation case produces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11768","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":"1903.11768","created_at":"2026-05-17T23:50:01.835670+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11768v1","created_at":"2026-05-17T23:50:01.835670+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11768","created_at":"2026-05-17T23:50:01.835670+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYV3THN4FOCE","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYV3THN4FOCEQ3WB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYV3THN4","created_at":"2026-05-18T12:33:24.271573+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/OYV3THN4FOCEQ3WBNKYHEQNZFB","json":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB.json","graph_json":"https://pith.science/api/pith-number/OYV3THN4FOCEQ3WBNKYHEQNZFB/graph.json","events_json":"https://pith.science/api/pith-number/OYV3THN4FOCEQ3WBNKYHEQNZFB/events.json","paper":"https://pith.science/paper/OYV3THN4"},"agent_actions":{"view_html":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB","download_json":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB.json","view_paper":"https://pith.science/paper/OYV3THN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11768&json=true","fetch_graph":"https://pith.science/api/pith-number/OYV3THN4FOCEQ3WBNKYHEQNZFB/graph.json","fetch_events":"https://pith.science/api/pith-number/OYV3THN4FOCEQ3WBNKYHEQNZFB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/action/storage_attestation","attest_author":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/action/author_attestation","sign_citation":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/action/citation_signature","submit_replication":"https://pith.science/pith/OYV3THN4FOCEQ3WBNKYHEQNZFB/action/replication_record"}},"created_at":"2026-05-17T23:50:01.835670+00:00","updated_at":"2026-05-17T23:50:01.835670+00:00"}