{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NTBVU2EY4U2MPV2766ZJGOE3D6","short_pith_number":"pith:NTBVU2EY","schema_version":"1.0","canonical_sha256":"6cc35a6898e534c7d75ff7b293389b1f987d72d940f2fcd2b7b80183292d737c","source":{"kind":"arxiv","id":"1911.10930","version":1},"attestation_state":"computed","paper":{"title":"Abstract Compilation for Verification of Numerical Accuracy Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.SE","authors_text":"Fonenantsoa Maurica, Franck V\\'edrine, Julien Signoles, Maxime Jacquemin, Nikolai Kosmatov","submitted_at":"2019-11-25T14:23:44Z","abstract_excerpt":"Verification of numerical accuracy properties in modern software remains an important and challenging task. This paper describes an original framework combining different solutions for numerical accuracy. First, we extend an existing runtime verification tool called E-ACSL with rational numbers to monitor accuracy properties at runtime. Second, we present an abstract compiler, FLDCompiler, that performs a source-to-source transformation such that the execution of the resulting program, called an abstract execution, is an abstract interpretation of the initial program. Third, we propose an inst"},"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":"1911.10930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-11-25T14:23:44Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"cea9668671b46a6d25861b731b0bebf212800846a5c7aca2a855ecc4ed77b9f7","abstract_canon_sha256":"9190c5a212f9e6f4e868e96f7cbaeeae7e4d532362e1884b56729f0ba20e991a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:21:43.731587Z","signature_b64":"5W9fFYnU1GxhnZAgVAHUDh5y9Fv08dnG+7n0y8bH56n4DuHR0Rp8GzzCEVcAhyVJJnYVd6hQ+e77mIvNmYrHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc35a6898e534c7d75ff7b293389b1f987d72d940f2fcd2b7b80183292d737c","last_reissued_at":"2026-07-05T00:21:43.731178Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:21:43.731178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstract Compilation for Verification of Numerical Accuracy Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.SE","authors_text":"Fonenantsoa Maurica, Franck V\\'edrine, Julien Signoles, Maxime Jacquemin, Nikolai Kosmatov","submitted_at":"2019-11-25T14:23:44Z","abstract_excerpt":"Verification of numerical accuracy properties in modern software remains an important and challenging task. This paper describes an original framework combining different solutions for numerical accuracy. First, we extend an existing runtime verification tool called E-ACSL with rational numbers to monitor accuracy properties at runtime. Second, we present an abstract compiler, FLDCompiler, that performs a source-to-source transformation such that the execution of the resulting program, called an abstract execution, is an abstract interpretation of the initial program. Third, we propose an inst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.10930","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.10930/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1911.10930","created_at":"2026-07-05T00:21:43.731231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.10930v1","created_at":"2026-07-05T00:21:43.731231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.10930","created_at":"2026-07-05T00:21:43.731231+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTBVU2EY4U2M","created_at":"2026-07-05T00:21:43.731231+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTBVU2EY4U2MPV27","created_at":"2026-07-05T00:21:43.731231+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTBVU2EY","created_at":"2026-07-05T00:21:43.731231+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09769","citing_title":"Abstract Compilation as Abstraction of Operator Semantics, applied to Cost Analysis","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6","json":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6.json","graph_json":"https://pith.science/api/pith-number/NTBVU2EY4U2MPV2766ZJGOE3D6/graph.json","events_json":"https://pith.science/api/pith-number/NTBVU2EY4U2MPV2766ZJGOE3D6/events.json","paper":"https://pith.science/paper/NTBVU2EY"},"agent_actions":{"view_html":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6","download_json":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6.json","view_paper":"https://pith.science/paper/NTBVU2EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.10930&json=true","fetch_graph":"https://pith.science/api/pith-number/NTBVU2EY4U2MPV2766ZJGOE3D6/graph.json","fetch_events":"https://pith.science/api/pith-number/NTBVU2EY4U2MPV2766ZJGOE3D6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6/action/storage_attestation","attest_author":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6/action/author_attestation","sign_citation":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6/action/citation_signature","submit_replication":"https://pith.science/pith/NTBVU2EY4U2MPV2766ZJGOE3D6/action/replication_record"}},"created_at":"2026-07-05T00:21:43.731231+00:00","updated_at":"2026-07-05T00:21:43.731231+00:00"}