{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JRSTN2PSZR66PAQKZZ7KXPO5PL","short_pith_number":"pith:JRSTN2PS","schema_version":"1.0","canonical_sha256":"4c6536e9f2cc7de7820ace7eabbddd7aeca21e9fc8eab6359c8fea5f4081b5f7","source":{"kind":"arxiv","id":"1802.04970","version":2},"attestation_state":"computed","paper":{"title":"Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.LO","authors_text":"Aleksandar S. Dimovski","submitted_at":"2018-02-14T07:00:01Z","abstract_excerpt":"Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, their quality assurance and formal verification are of paramount importance. Family-based model checking allows simultaneous verification of all variants of a variational system in a single run by exploiting the commonalities between the variants. Yet, its computational cost still greatly depends on the number of variants (often huge).\n  In this work, we show how to achieve efficient family-based model checking of CTL* t"},"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":"1802.04970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-14T07:00:01Z","cross_cats_sorted":["cs.PL","cs.SE"],"title_canon_sha256":"8c903842133a54931ef2117e43ce9532a148e5462d30bab09ceb5efe1375299c","abstract_canon_sha256":"fb7a29e778a4b3a71a25892720ce3f899ccbc102f3477a92cb09c1d458d738b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:02.245598Z","signature_b64":"a75gcDowbbNIntT4X5RK/J/Jxme9g4RidZxbmLwNAemUt/FP/Z6cbplJNMGfLgVvNlwKK8GLjxB4UdHggE07DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c6536e9f2cc7de7820ace7eabbddd7aeca21e9fc8eab6359c8fea5f4081b5f7","last_reissued_at":"2026-05-18T00:22:02.245076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:02.245076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Abstract Family-based Model Checking using Modal Featured Transition Systems: Preservation of CTL* (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.LO","authors_text":"Aleksandar S. Dimovski","submitted_at":"2018-02-14T07:00:01Z","abstract_excerpt":"Variational systems allow effective building of many custom variants by using features (configuration options) to mark the variable functionality. In many of the applications, their quality assurance and formal verification are of paramount importance. Family-based model checking allows simultaneous verification of all variants of a variational system in a single run by exploiting the commonalities between the variants. Yet, its computational cost still greatly depends on the number of variants (often huge).\n  In this work, we show how to achieve efficient family-based model checking of CTL* t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04970","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":"1802.04970","created_at":"2026-05-18T00:22:02.245148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04970v2","created_at":"2026-05-18T00:22:02.245148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04970","created_at":"2026-05-18T00:22:02.245148+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRSTN2PSZR66","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRSTN2PSZR66PAQK","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRSTN2PS","created_at":"2026-05-18T12:32:31.084164+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/JRSTN2PSZR66PAQKZZ7KXPO5PL","json":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL.json","graph_json":"https://pith.science/api/pith-number/JRSTN2PSZR66PAQKZZ7KXPO5PL/graph.json","events_json":"https://pith.science/api/pith-number/JRSTN2PSZR66PAQKZZ7KXPO5PL/events.json","paper":"https://pith.science/paper/JRSTN2PS"},"agent_actions":{"view_html":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL","download_json":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL.json","view_paper":"https://pith.science/paper/JRSTN2PS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04970&json=true","fetch_graph":"https://pith.science/api/pith-number/JRSTN2PSZR66PAQKZZ7KXPO5PL/graph.json","fetch_events":"https://pith.science/api/pith-number/JRSTN2PSZR66PAQKZZ7KXPO5PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL/action/storage_attestation","attest_author":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL/action/author_attestation","sign_citation":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL/action/citation_signature","submit_replication":"https://pith.science/pith/JRSTN2PSZR66PAQKZZ7KXPO5PL/action/replication_record"}},"created_at":"2026-05-18T00:22:02.245148+00:00","updated_at":"2026-05-18T00:22:02.245148+00:00"}