{"id":"https://openalex.org/W1536773907","doi":"https://doi.org/10.1007/978-3-642-13321-3_4","title":"On Automated Program Construction and Verification","display_name":"On Automated Program Construction and Verification","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1536773907","doi":"https://doi.org/10.1007/978-3-642-13321-3_4","mag":"1536773907"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-13321-3_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13321-3_4","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/A5042138172","display_name":"Rudolf Berghammer","orcid":null},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Rudolf Berghammer","raw_affiliation_strings":["Institute of Computer Science, Christian-Albrechts-University of Kiel, Germany","Institute of Computer Science, Christian-Albrechts-University of Kiel, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, Christian-Albrechts-University of Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]},{"raw_affiliation_string":"Institute of Computer Science, Christian-Albrechts-University of Kiel, Germany#TAB#","institution_ids":["https://openalex.org/I32021983"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004734550","display_name":"Georg Struth","orcid":"https://orcid.org/0000-0001-9466-7815"},"institutions":[{"id":"https://openalex.org/I91136226","display_name":"University of Sheffield","ror":"https://ror.org/05krs5044","country_code":"GB","type":"education","lineage":["https://openalex.org/I91136226"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Georg Struth","raw_affiliation_strings":["Department of Computer Science, University of Sheffield, UK","Dept. of Comput. Sci., Univ. of Sheffield, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Sheffield, UK","institution_ids":["https://openalex.org/I91136226"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Univ. of Sheffield, UK#TAB#","institution_ids":["https://openalex.org/I91136226"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042138172"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8496,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.73133185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":"41"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"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.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7731345891952515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7645204663276672},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.7331328988075256},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6877800822257996},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6783063411712646},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.60878986120224},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.5648611187934875},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5351667404174805},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5018703937530518},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.47700977325439453},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4424169957637787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40471169352531433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16593414545059204},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16145527362823486},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15560704469680786},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.08922761678695679}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7731345891952515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7645204663276672},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7331328988075256},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6877800822257996},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6783063411712646},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.60878986120224},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.5648611187934875},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5351667404174805},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5018703937530518},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.47700977325439453},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4424169957637787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40471169352531433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16593414545059204},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16145527362823486},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15560704469680786},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.08922761678695679},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-13321-3_4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-13321-3_4","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W968309248","https://openalex.org/W1491463546","https://openalex.org/W1507039213","https://openalex.org/W1511826042","https://openalex.org/W1514642181","https://openalex.org/W1550114059","https://openalex.org/W1568120865","https://openalex.org/W1762364904","https://openalex.org/W1964754311","https://openalex.org/W1970275691","https://openalex.org/W1978606295","https://openalex.org/W1998368317","https://openalex.org/W2006006495","https://openalex.org/W2026501147","https://openalex.org/W2069300761","https://openalex.org/W2103953153","https://openalex.org/W2104734478","https://openalex.org/W2108661280","https://openalex.org/W2111706174","https://openalex.org/W2144973245","https://openalex.org/W2147543351","https://openalex.org/W2481850285","https://openalex.org/W2494986075","https://openalex.org/W2607631107","https://openalex.org/W2798401172","https://openalex.org/W2987907651","https://openalex.org/W3145128584","https://openalex.org/W3146075203","https://openalex.org/W4246219036","https://openalex.org/W4250930808","https://openalex.org/W4251912342","https://openalex.org/W4253748132","https://openalex.org/W4254354208","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2963892764","https://openalex.org/W2798731600","https://openalex.org/W3100311625","https://openalex.org/W2148568439"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}