{"id":"https://openalex.org/W182717014","doi":"https://doi.org/10.1007/978-3-642-28756-5_17","title":"Compositional Termination Proofs for Multi-threaded Programs","display_name":"Compositional Termination Proofs for Multi-threaded Programs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W182717014","doi":"https://doi.org/10.1007/978-3-642-28756-5_17","mag":"182717014"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-28756-5_17","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-28756-5_17","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-28756-5_17.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":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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-28756-5_17.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036625175","display_name":"Corneliu Popeea","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Corneliu Popeea","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044737952","display_name":"Andrey Rybalchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrey Rybalchenko","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036625175"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1807,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.97302505,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9991000294685364,"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.9972000122070312,"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.9023244380950928},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.7559992074966431},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7268345952033997},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6115491390228271},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5248532295227051},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5122694373130798},{"id":"https://openalex.org/keywords/principle-of-compositionality","display_name":"Principle of compositionality","score":0.45384588837623596},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.43195459246635437},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4230327010154724},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4215043783187866},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.41664785146713257},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3217906355857849},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.21532240509986877},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16744840145111084}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9023244380950928},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.7559992074966431},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7268345952033997},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6115491390228271},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5248532295227051},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5122694373130798},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.45384588837623596},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.43195459246635437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4230327010154724},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4215043783187866},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.41664785146713257},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3217906355857849},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.21532240509986877},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16744840145111084},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-28756-5_17","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-28756-5_17","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-28756-5_17.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":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":{"id":"doi:10.1007/978-3-642-28756-5_17","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-642-28756-5_17","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-642-28756-5_17.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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W182717014.pdf","grobid_xml":"https://content.openalex.org/works/W182717014.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1480600454","https://openalex.org/W1503537039","https://openalex.org/W1505537169","https://openalex.org/W1529511237","https://openalex.org/W1530375435","https://openalex.org/W1566412221","https://openalex.org/W1573651116","https://openalex.org/W1996245589","https://openalex.org/W2000589007","https://openalex.org/W2086460553","https://openalex.org/W2088139180","https://openalex.org/W2090551028","https://openalex.org/W2101161997","https://openalex.org/W2107089133","https://openalex.org/W2115969864","https://openalex.org/W2124909257","https://openalex.org/W2124945255","https://openalex.org/W2145062333","https://openalex.org/W2154713600","https://openalex.org/W2158395308","https://openalex.org/W2170487018","https://openalex.org/W2293708017","https://openalex.org/W2796564118","https://openalex.org/W3010298153","https://openalex.org/W4232668957","https://openalex.org/W4236040576","https://openalex.org/W4248689402"],"related_works":["https://openalex.org/W1526190050","https://openalex.org/W4251923961","https://openalex.org/W2560696689","https://openalex.org/W1486758468","https://openalex.org/W2043780920","https://openalex.org/W2024419412","https://openalex.org/W2396117615","https://openalex.org/W1903811031","https://openalex.org/W124433265","https://openalex.org/W2963257091"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}