{"id":"https://openalex.org/W2137327104","doi":"https://doi.org/10.1145/1614431.1614433","title":"Automated termination proofs for logic programs by term rewriting","display_name":"Automated termination proofs for logic programs by term rewriting","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2137327104","doi":"https://doi.org/10.1145/1614431.1614433","mag":"2137327104"},"language":"en","primary_location":{"id":"doi:10.1145/1614431.1614433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1614431.1614433","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Peter Schneider-Kamp","raw_affiliation_strings":["University of Southern Denmark, Odense M, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Southern Denmark, Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Giesl","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany","RWTH-Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH-Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054753279","display_name":"Alexander Serebrenik","orcid":"https://orcid.org/0000-0002-1418-0095"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Alexander Serebrenik","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands","Eindhoven University of Technology , Eindhoven , The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology , Eindhoven , The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078037586","display_name":"Ren\u00e9 Thiemann","orcid":"https://orcid.org/0000-0002-0323-8829"},"institutions":[{"id":"https://openalex.org/I190249584","display_name":"Universit\u00e4t Innsbruck","ror":"https://ror.org/054pv6659","country_code":"AT","type":"education","lineage":["https://openalex.org/I190249584"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ren\u00e9 Thiemann","raw_affiliation_strings":["University of Innsbruck, Innsbruck, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Innsbruck, Innsbruck, Austria","institution_ids":["https://openalex.org/I190249584"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.6081,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.98767601,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"52"},"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.9997000098228455,"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.9997000098228455,"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.9972000122070312,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.7861354351043701},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.7376296520233154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6618831753730774},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5878222584724426},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5862704515457153},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5637089014053345},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.558594822883606},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5272875428199768},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.47881776094436646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42213213443756104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25101643800735474}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.7861354351043701},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.7376296520233154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6618831753730774},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5878222584724426},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5862704515457153},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5637089014053345},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.558594822883606},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5272875428199768},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.47881776094436646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42213213443756104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25101643800735474},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1145/1614431.1614433","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1614431.1614433","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/98f761ac-5805-43db-8d86-8030fadc734e","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/98f761ac-5805-43db-8d86-8030fadc734e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schneider-Kamp, P, Giesl, J, Serebrenik, A & Thiemann, R 2009, 'Automated termination proofs for logic programs by term rewriting', ACM Transactions on Computational Logic, vol. 11, no. 1, 2, pp. 2-1/52. https://doi.org/10.1145/1614431.1614433","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/805164f0-adb4-11de-9743-000ea68e967b","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/805164f0-adb4-11de-9743-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Schneider-Kamp, P, Giesl, J, Serebrenik, A & Thiemann, R 2009, 'Automated Termination Proofs for Logic Programs by Term Rewriting', ACM Transactions on Computational Logic, vol. 11, no. 1, pp. Article 2. https://doi.org/10.1145/1614431.1614433","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:674256","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=674256","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1529-3785","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.2770","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.2770","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://verify.rwth-aachen.de/giesl/papers/TOCL.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.314.4244","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.4244","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0803.0014v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.314.4333","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.314.4333","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0803.0014v2.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:674256","is_oa":false,"landing_page_url":"http://repository.tue.nl/674256","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1529-3785","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:publications.rwth-aachen.de:169767","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-047328%22","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM transactions on computational logic 11(1), 2 (2009). doi:10.1145/1614431.1614433","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/82d28d56-8dcb-40d8-94f5-54573ef5f990","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/82d28d56-8dcb-40d8-94f5-54573ef5f990","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/98f761ac-5805-43db-8d86-8030fadc734e","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/98f761ac-5805-43db-8d86-8030fadc734e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Computational Logic, 11(1):2, 2 - 1/52. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8451493964","display_name":null,"funder_award_id":"GI 274/5-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W91193428","https://openalex.org/W1483865431","https://openalex.org/W1484554695","https://openalex.org/W1485053244","https://openalex.org/W1492397127","https://openalex.org/W1493318828","https://openalex.org/W1499823109","https://openalex.org/W1506491404","https://openalex.org/W1522712062","https://openalex.org/W1530752153","https://openalex.org/W1532529131","https://openalex.org/W1558166004","https://openalex.org/W1566656731","https://openalex.org/W1570698975","https://openalex.org/W1570918840","https://openalex.org/W1579524364","https://openalex.org/W1583295953","https://openalex.org/W1584357601","https://openalex.org/W1591642134","https://openalex.org/W1595402260","https://openalex.org/W1597918680","https://openalex.org/W1605391485","https://openalex.org/W1753357466","https://openalex.org/W1808570911","https://openalex.org/W1875104636","https://openalex.org/W1987494796","https://openalex.org/W1996679397","https://openalex.org/W1999783590","https://openalex.org/W2001932052","https://openalex.org/W2009286786","https://openalex.org/W2011356136","https://openalex.org/W2014410720","https://openalex.org/W2024390796","https://openalex.org/W2038040550","https://openalex.org/W2062605570","https://openalex.org/W2069076448","https://openalex.org/W2070546615","https://openalex.org/W2083081801","https://openalex.org/W2090855107","https://openalex.org/W2093199226","https://openalex.org/W2095555925","https://openalex.org/W2099083823","https://openalex.org/W2111739714","https://openalex.org/W2120056071","https://openalex.org/W2121757274","https://openalex.org/W2121932590","https://openalex.org/W2125364400","https://openalex.org/W2137374798","https://openalex.org/W2141171354","https://openalex.org/W2143645917","https://openalex.org/W2156634602","https://openalex.org/W2168096396","https://openalex.org/W2168393711","https://openalex.org/W2170550263","https://openalex.org/W2397971081","https://openalex.org/W2405601722","https://openalex.org/W2519955368","https://openalex.org/W2561675875","https://openalex.org/W2786353107","https://openalex.org/W2913865624","https://openalex.org/W4230919050","https://openalex.org/W4240344417","https://openalex.org/W4253279779","https://openalex.org/W4285719527","https://openalex.org/W6635711394"],"related_works":["https://openalex.org/W2491573813","https://openalex.org/W4238632608","https://openalex.org/W4246350535","https://openalex.org/W3083050876","https://openalex.org/W1875958796","https://openalex.org/W1780472831","https://openalex.org/W1976200187","https://openalex.org/W1561644379","https://openalex.org/W2969536091","https://openalex.org/W783488073"],"abstract_inverted_index":{"There":[0],"are":[1,90,141],"two":[2],"kinds":[3],"of":[4,9,24,44,68,84,88,116,126,156,194],"approaches":[5,17,29,51],"for":[6,57,60,81,107,144,154,164],"termination":[7,19,43,146,155,183],"analysis":[8],"logic":[10,26,32,61,85,110,117,157,165],"programs:":[11],"\u201ctransformational\u201d":[12],"and":[13,40,186],"\u201cdirect\u201d":[14],"ones.":[15],"Direct":[16],"prove":[18],"directly":[20],"on":[21,190],"the":[22,25,45,66,114,124,182],"basis":[23],"program.":[27,111],"Transformational":[28],"transform":[30],"a":[31,35,191],"program":[33],"into":[34],"Term":[36],"Rewrite":[37],"System":[38],"(TRS)":[39],"then":[41],"analyze":[42],"resulting":[46],"TRS":[47],"instead.":[48],"Thus,":[49],"transformational":[50],"make":[52],"all":[53],"methods":[54,153],"previously":[55],"developed":[56],"TRSs":[58,139],"available":[59],"programs":[62,118],"as":[63,75],"well.":[64],"However,":[65],"applicability":[67],"most":[69,151],"existing":[70],"transformations":[71,101],"is":[72,161,172],"quite":[73],"restricted,":[74],"they":[76,104],"can":[77],"only":[78],"be":[79],"used":[80,174],"certain":[82],"subclasses":[83],"programs.":[86],"(Most":[87],"them":[89],"restricted":[91],"to":[92,150],"well-moded":[93],"programs.)":[94],"In":[95,148],"this":[96],"article":[97],"we":[98,121],"improve":[99],"these":[100],"such":[102],"that":[103,134],"become":[105],"applicable":[106],"any":[108],"definite":[109],"To":[112],"simulate":[113],"behavior":[115],"by":[119,128],"TRSs,":[120],"slightly":[122],"modify":[123],"notion":[125],"rewriting":[127],"permitting":[129],"infinite":[130],"terms.":[131],"We":[132,177],"show":[133],"our":[135,159,179],"transformation":[136],"results":[137],"in":[138,175,181],"which":[140,171],"indeed":[142],"suitable":[143],"automated":[145],"analysis.":[147],"contrast":[149],"other":[152],"programs,":[158],"technique":[160],"also":[162],"sound":[163],"programming":[166],"without":[167],"occur":[168],"check":[169],",":[170],"typically":[173],"practice.":[176],"implemented":[178],"approach":[180],"prover":[184],"AProVE":[185],"successfully":[187],"evaluated":[188],"it":[189],"large":[192],"collection":[193],"examples.":[195]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}