{"id":"https://openalex.org/W7168143271","doi":"https://doi.org/10.4230/lipics.cp.2026.24","title":"Formally Verified Certification of Constraint Programming Proofs","display_name":"Formally Verified Certification of Constraint Programming Proofs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7168143271","doi":"https://doi.org/10.4230/lipics.cp.2026.24"},"language":"en","primary_location":{"id":"pmh:doi:10.4230/lipics.cp.2026.24","is_oa":true,"landing_page_url":"https://zenodo.org/records/20046134","pdf_url":"https://ceur-ws.org/Vol-3545/paper5.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ceur-ws.org/Vol-3545/paper5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120598868","display_name":"Maarten Flippo","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Flippo, Maarten","raw_affiliation_strings":["Delft University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0005-5333-2767","affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135317767","display_name":"Konstantin Sidorov","orcid":"https://orcid.org/0009-0009-0655-4200"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Sidorov, Konstantin","raw_affiliation_strings":["Delft University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0009-0009-0655-4200","affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140564699","display_name":"Tip ten Brink","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"ten Brink, Tip","raw_affiliation_strings":["Delft University of Technology, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018186543","display_name":"Cl\u00e9ment Pit-Claudel","orcid":"https://orcid.org/0000-0002-1900-3901"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Pit-Claudel, Cl\u00e9ment","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-1900-3901","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019385762","display_name":"Emir Demirovi\u0107","orcid":"https://orcid.org/0000-0003-1587-5582"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Demirovi\u0107, Emir","raw_affiliation_strings":["Delft University of Technology, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1587-5582","affiliations":[{"raw_affiliation_string":"Delft University of Technology, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7613999843597412},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.6200000047683716},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.550599992275238},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.5408999919891357},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5313000082969666},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5151000022888184},{"id":"https://openalex.org/keywords/certification","display_name":"Certification","score":0.5042999982833862},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4300000071525574},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.42419999837875366}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7613999843597412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7013999819755554},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.6200000047683716},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6055999994277954},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.550599992275238},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.5408999919891357},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5313000082969666},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5151000022888184},{"id":"https://openalex.org/C46304622","wikidata":"https://www.wikidata.org/wiki/Q374814","display_name":"Certification","level":2,"score":0.5042999982833862},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46480000019073486},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4300000071525574},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.42419999837875366},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4034999907016754},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3905999958515167},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3547999858856201},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.35019999742507935},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.3122999966144562},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.29120001196861267},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.26440000534057617},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25290000438690186}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.4230/lipics.cp.2026.24","is_oa":true,"landing_page_url":"https://zenodo.org/records/20046134","pdf_url":"https://ceur-ws.org/Vol-3545/paper5.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"pmh:oai:drops-oai.dagstuhl.de:26656","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2026.24","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.cp.2026.24","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.cp.2026.24","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:doi:10.4230/lipics.cp.2026.24","is_oa":true,"landing_page_url":"https://zenodo.org/records/20046134","pdf_url":"https://ceur-ws.org/Vol-3545/paper5.pdf","source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5676925691","display_name":"Towards a Unification of AI-Based Solving Paradigms for Combinatorial Optimisation","funder_award_id":"OCENW.M.21.078","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321012","display_name":"Technische Universiteit Delft","ror":"https://ror.org/02e2c7k09"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7168143271.pdf","grobid_xml":"https://content.openalex.org/works/W7168143271.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"As":[0],"constraint":[1],"programming":[2],"(CP)":[3],"solvers":[4,35],"are":[5],"increasingly":[6],"used":[7],"in":[8,118],"critical":[9],"applications,":[10],"there":[11],"is":[12,31],"a":[13,37,67,78,83,113],"growing":[14],"need":[15],"for":[16,33,71,86],"certification":[17,30,136],"of":[18,21,81],"solver":[19,74,94],"claims":[20],"infeasibility":[22],"and":[23,48,99,145],"optimality.":[24],"Recent":[25],"work":[26],"has":[27],"demonstrated":[28],"that":[29,91,120,131],"feasible":[32],"CP":[34,73,87],"using":[36],"multi-stage":[38],"proof-generation":[39],"framework;":[40],"however,":[41],"the":[42,59],"underlying":[43],"proof":[44,56,84,116],"system":[45,85],"was":[46],"informal,":[47],"verification":[49],"relied":[50],"on":[51],"translation":[52],"into":[53],"an":[54],"external":[55],"format,":[57],"impacting":[58],"trustworthiness.":[60],"We":[61,76,109],"address":[62],"these":[63],"issues":[64],"by":[65,102],"formalising":[66],"rigorous,":[68],"solver-agnostic":[69],"framework":[70,133],"certifying":[72],"claims.":[75],"present":[77],"formal":[79],"definition":[80],"DRCP,":[82],"over":[88],"integer":[89],"domains":[90],"captures":[92],"core":[93],"operations,":[95],"including":[96],"conflict":[97],"analysis":[98],"heterogeneous":[100],"propagation,":[101],"modular":[103],"inference":[104],"rules":[105],"with":[106,140],"precise":[107],"semantics.":[108],"also":[110],"develop":[111],"FznDrcpCheck,":[112],"formally":[114],"verified":[115],"checker":[117],"Rocq":[119],"validates":[121],"DRCP":[122],"proofs":[123],"directly":[124],"against":[125],"FlatZinc":[126],"models.":[127],"Our":[128],"evaluation":[129],"shows":[130],"our":[132],"enables":[134],"practical":[135],"across":[137],"various":[138],"benchmarks":[139],"negligible":[141],"overhead":[142],"during":[143],"solving":[144],"modest":[146],"proof-checking":[147],"costs.":[148]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-14T00:00:00"}