{"id":"https://openalex.org/W1503677488","doi":"https://doi.org/10.1007/978-3-642-00593-0_33","title":"Finding Loop Invariants for Programs over Arrays Using a Theorem Prover","display_name":"Finding Loop Invariants for Programs over Arrays Using a Theorem Prover","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1503677488","doi":"https://doi.org/10.1007/978-3-642-00593-0_33","mag":"1503677488"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-00593-0_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00593-0_33","pdf_url":null,"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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071158512","display_name":"Laura Kov\u00e1cs","orcid":"https://orcid.org/0000-0002-8299-2714"},"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":true,"raw_author_name":"Laura Kov\u00e1cs","raw_affiliation_strings":["EPFL, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054629753","display_name":"\u0410\u043d\u0434\u0440\u0435\u0439 \u0412\u043e\u0440\u043e\u043d\u043a\u043e\u0432","orcid":"https://orcid.org/0009-0009-4367-4885"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Andrei Voronkov","raw_affiliation_strings":["University of Manchester, UK"],"affiliations":[{"raw_affiliation_string":"University of Manchester, UK","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071158512"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":14.0136,"has_fulltext":false,"cited_by_count":138,"citation_normalized_percentile":{"value":0.99401939,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"470","last_page":"485"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.508899986743927,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.508899986743927,"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/T10126","display_name":"Logic, programming, and type systems","score":0.36230000853538513,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.03060000017285347,"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/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7753539085388184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7052936553955078},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.6744053363800049},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6227641105651855},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5775958895683289},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.5487353801727295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4485526978969574},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.42216330766677856},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3827822804450989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3222385048866272},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19984686374664307},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.15629228949546814},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10361343622207642}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7753539085388184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7052936553955078},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.6744053363800049},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6227641105651855},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5775958895683289},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.5487353801727295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4485526978969574},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.42216330766677856},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3827822804450989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3222385048866272},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19984686374664307},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.15629228949546814},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10361343622207642},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-642-00593-0_33","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-00593-0_33","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.163.1650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.163.1650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mtc.epfl.ch/~likovacs/pub/FASE09_KovVor.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:159908","is_oa":false,"landing_page_url":"http://infoscience.epfl.ch/record/159908","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","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":"","raw_type":"Text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/d2d6a579-f62a-4f5e-abef-2778735bab89","is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/fase/fase2009.html#KovacsV09http://dblp.uni-trier.de/rec/bibtex/conf/fase/KovacsV09.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/fase/KovacsV09","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kov\u00e1cs, L & Voronkov, A 2009, Finding loop invariants for programs over arrays using a theorem prover. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 5503, Springer Nature, pp. 470-485, 12th International Conference on Fundamental Approaches to Software Engineering, FASE 2009, 1/07/09. https://doi.org/10.1007/978-3-642-00593-0_33","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.atira.dk:publications/d2d6a579-f62a-4f5e-abef-2778735bab89","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/d2d6a579-f62a-4f5e-abef-2778735bab89","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kov\u00e1cs, L & Voronkov, A 2009, Finding loop invariants for programs over arrays using a theorem prover. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 5503, Springer Nature, pp. 470-485, 12th International Conference on Fundamental Approaches to Software Engineering, FASE 2009, 1/07/09. https://doi.org/10.1007/978-3-642-00593-0_33","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W149680857","https://openalex.org/W171295454","https://openalex.org/W1503701626","https://openalex.org/W1506588809","https://openalex.org/W1507112684","https://openalex.org/W1517192598","https://openalex.org/W1528693048","https://openalex.org/W1531054827","https://openalex.org/W1546153726","https://openalex.org/W1553910098","https://openalex.org/W1557130751","https://openalex.org/W1558061996","https://openalex.org/W1585981132","https://openalex.org/W1590233219","https://openalex.org/W1711276981","https://openalex.org/W1807555267","https://openalex.org/W1959256509","https://openalex.org/W1968191809","https://openalex.org/W1972085995","https://openalex.org/W1993836075","https://openalex.org/W2015362443","https://openalex.org/W2043100293","https://openalex.org/W2060697066","https://openalex.org/W2066210260","https://openalex.org/W2132251441","https://openalex.org/W2132661148","https://openalex.org/W2142481893","https://openalex.org/W2294635730","https://openalex.org/W2987077139","https://openalex.org/W4285719527"],"related_works":["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/W2479603923","https://openalex.org/W2809689211","https://openalex.org/W260563712","https://openalex.org/W162260173"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-19T08:26:33.389920","created_date":"2025-10-10T00:00:00"}