{"id":"https://openalex.org/W4400169040","doi":"https://doi.org/10.1007/978-3-031-63498-7_25","title":"A Formal Model to\u00a0Prove Instantiation Termination for\u00a0E-matching-Based Axiomatisations","display_name":"A Formal Model to\u00a0Prove Instantiation Termination for\u00a0E-matching-Based Axiomatisations","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4400169040","doi":"https://doi.org/10.1007/978-3-031-63498-7_25"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-031-63498-7_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-63498-7_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-63498-7_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-63498-7_25.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069534231","display_name":"Rui Ge","orcid":"https://orcid.org/0000-0003-1049-8132"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Rui Ge","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0003-1049-8132","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051937731","display_name":"Ronald Garcia","orcid":"https://orcid.org/0000-0002-0982-1118"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ronald Garcia","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0002-0982-1118","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080556886","display_name":"Alexander J. Summers","orcid":"https://orcid.org/0000-0001-5554-9381"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alexander J. Summers","raw_affiliation_strings":["Department of Computer Science, University of British Columbia, Vancouver, BC, Canada"],"raw_orcid":"https://orcid.org/0000-0001-5554-9381","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of British Columbia, Vancouver, BC, Canada","institution_ids":["https://openalex.org/I141945490"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069534231"],"corresponding_institution_ids":["https://openalex.org/I141945490"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.749,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68813857,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"419","last_page":"438"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.820249617099762},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6487799882888794},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6462562084197998},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5902199745178223},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.5850191712379456},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5453247427940369},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5016987323760986},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.47569334506988525},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4525611996650696},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.4516037702560425},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44706207513809204},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.4351123571395874},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.43445637822151184},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4300650954246521},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.41488611698150635},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35797709226608276},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20398104190826416},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.1943739354610443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13368451595306396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.820249617099762},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6487799882888794},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6462562084197998},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5902199745178223},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.5850191712379456},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5453247427940369},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5016987323760986},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.47569334506988525},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4525611996650696},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.4516037702560425},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44706207513809204},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.4351123571395874},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.43445637822151184},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4300650954246521},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.41488611698150635},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35797709226608276},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20398104190826416},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.1943739354610443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13368451595306396},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-031-63498-7_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-63498-7_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-63498-7_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-031-63498-7_25","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-031-63498-7_25","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-031-63498-7_25.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4400169040.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W70797468","https://openalex.org/W798190714","https://openalex.org/W1480909796","https://openalex.org/W1536511644","https://openalex.org/W1552077729","https://openalex.org/W1569747018","https://openalex.org/W1820726602","https://openalex.org/W1895616280","https://openalex.org/W1968428133","https://openalex.org/W1978790429","https://openalex.org/W2055477538","https://openalex.org/W2114917372","https://openalex.org/W2130427425","https://openalex.org/W2157039289","https://openalex.org/W2159786179","https://openalex.org/W2294722445","https://openalex.org/W2491721896","https://openalex.org/W2907207368","https://openalex.org/W2925976527","https://openalex.org/W3199921595","https://openalex.org/W4225922019","https://openalex.org/W4396819469"],"related_works":["https://openalex.org/W4214737172","https://openalex.org/W3012938552","https://openalex.org/W2324712051","https://openalex.org/W2798639752","https://openalex.org/W1550311267","https://openalex.org/W4287825236","https://openalex.org/W1524103539","https://openalex.org/W1239946963","https://openalex.org/W1973527399","https://openalex.org/W2600774173"],"abstract_inverted_index":{"Abstract":[0],"SMT-based":[1,21],"program":[2,10],"analysis":[3],"and":[4,38,43,57,102,185],"verification":[5],"often":[6],"involve":[7],"reasoning":[8,22],"about":[9],"features":[11],"that":[12,97,105,134],"have":[13],"been":[14],"specified":[15],"using":[16],"quantifiers;":[17],"incorporating":[18],"quantifiers":[19],"into":[20],"is,":[23],"however,":[24],"known":[25],"to":[26,45,54,111,124,141,146],"be":[27,41],"challenging.":[28],"If":[29],"quantifier":[30,50,68,149],"instantiation":[31,51],"is":[32,61,127],"not":[33,81],"carefully":[34],"controlled,":[35],"then":[36],"runtime":[37],"outcomes":[39],"can":[40,52],"brittle":[42],"hard":[44],"predict.":[46],"In":[47],"particular,":[48],"uncontrolled":[49],"lead":[53],"unexpected":[55],"incompleteness":[56],"even":[58,75],"non-termination.":[59,122],"E-matching":[60,85,138],"the":[62,99,137,163,183],"most":[63,142],"widely-used":[64],"approach":[65],"for":[66,103,131,173],"controlling":[67],"instantiation,":[69],"but":[70,153],"when":[71,148],"axiomatisations":[72],"are":[73,144,151],"complex,":[74],"experts":[76],"cannot":[77,120],"tell":[78],"whether":[79],"or":[80,88,118],"their":[82],"use":[83],"of":[84,158,165],"guarantees":[86],"completeness":[87],"termination.":[89],"This":[90],"paper":[91],"presents":[92],"a":[93,107,170,174],"new":[94],"formal":[95],"model":[96],"facilitates":[98],"proof,":[100],"once":[101],"all,":[104],"giving":[106],"complex":[108],"E-matching-based":[109],"axiomatisation":[110,177],"an":[112,128],"SMT":[113],"solver":[114,132],"such":[115],"as":[116],"Z3":[117],"cvc5,":[119],"cause":[121],"Key":[123],"our":[125,166],"technique":[126,167],"operational":[129],"semantics":[130],"behaviour":[133],"models":[135],"how":[136],"rules":[139],"common":[140],"solvers":[143],"used":[145,181],"determine":[147],"instantiations":[150],"enabled,":[152],"abstracts":[154],"over":[155],"irrelevant":[156],"details":[157],"individual":[159],"solvers.":[160],"We":[161],"demonstrate":[162],"effectiveness":[164],"by":[168],"presenting":[169],"termination":[171],"proof":[172],"set":[175],"theory":[176],"adapted":[178],"from":[179],"those":[180],"in":[182],"Dafny":[184],"Viper":[186],"verifiers.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}