{"id":"https://openalex.org/W4232668957","doi":"https://doi.org/10.1145/1133981.1134029","title":"Termination proofs for systems code","display_name":"Termination proofs for systems code","publication_year":2006,"publication_date":"2006-06-11","ids":{"openalex":"https://openalex.org/W4232668957","doi":"https://doi.org/10.1145/1133981.1134029"},"language":"en","primary_location":{"id":"doi:10.1145/1133981.1134029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1134029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-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/A5112528389","display_name":"Byron Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Byron Cook","raw_affiliation_strings":["Microsoft Research"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062411838","display_name":"Andreas Podelski","orcid":"https://orcid.org/0000-0003-2540-9489"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Podelski","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044737952","display_name":"Andrey Rybalchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrey Rybalchenko","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik and EPFL"],"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik and EPFL","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112528389"],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":28.8714,"has_fulltext":false,"cited_by_count":237,"citation_normalized_percentile":{"value":0.99720361,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"415","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"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/T11424","display_name":"Security and Verification in Computing","score":0.9998000264167786,"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.9990000128746033,"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"}},{"id":"https://openalex.org/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.8558731079101562},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8102390170097351},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7177937030792236},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5699000954627991},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5396912097930908},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5378377437591553},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48277488350868225},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.4757397174835205},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.47492489218711853},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41505444049835205},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40842974185943604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34162285923957825},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09385782480239868},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.09229868650436401}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8558731079101562},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8102390170097351},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7177937030792236},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5699000954627991},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5396912097930908},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5378377437591553},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48277488350868225},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.4757397174835205},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.47492489218711853},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41505444049835205},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40842974185943604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34162285923957825},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09385782480239868},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.09229868650436401},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1133981.1134029","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1133981.1134029","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1503537039","https://openalex.org/W1521232193","https://openalex.org/W1530375435","https://openalex.org/W1541144457","https://openalex.org/W1552505815","https://openalex.org/W1584357601","https://openalex.org/W1608799719","https://openalex.org/W1836035163","https://openalex.org/W1993129359","https://openalex.org/W1996679397","https://openalex.org/W2126160338","https://openalex.org/W2131195907","https://openalex.org/W2136333450","https://openalex.org/W2165069483","https://openalex.org/W3100198463","https://openalex.org/W4212792638","https://openalex.org/W4251912342"],"related_works":["https://openalex.org/W2950202488","https://openalex.org/W2604424424","https://openalex.org/W2954326042","https://openalex.org/W1567449721","https://openalex.org/W765055999","https://openalex.org/W1970588133","https://openalex.org/W2745567114","https://openalex.org/W2884574904","https://openalex.org/W1763168562","https://openalex.org/W3100311625"],"abstract_inverted_index":{"Program":[0],"termination":[1,20,96],"is":[2,80],"central":[3],"to":[4],"the":[5,84,87,95,100,111],"process":[6],"of":[7,42,77,90,114],"ensuring":[8],"that":[9,22],"systems":[10],"code":[11],"can":[12],"always":[13],"react.":[14],"We":[15],"describe":[16],"a":[17,24],"new":[18],"program":[19,28,35],"prover":[21],"performs":[23],"path-sensitive":[25],"and":[26,30,92],"context-sensitive":[27],"analysis":[29],"provides":[31],"capacity":[32],"for":[33,47],"large":[34],"fragments":[36],"(i.e.":[37],"more":[38],"than":[39],"20,000":[40],"lines":[41],"code)":[43],"together":[44],"with":[45,116],"support":[46],"programming":[48],"language":[49],"features":[50],"such":[51],"as":[52],"arbitrarily":[53],"nested":[54],"loops,":[55],"pointers,":[56],"function-pointers,":[57],"side-effects,":[58],"etc.We":[59],"also":[60],"present":[61],"experimental":[62],"results":[63],"on":[64],"device":[65],"driver":[66],"dispatch":[67],"routines":[68],"from":[69],"theWindows":[70],"operating":[71],"system.":[72],"The":[73],"most":[74],"distinguishing":[75],"aspect":[76],"our":[78],"tool":[79],"how":[81,108],"it":[82],"shifts":[83],"balance":[85],"between":[86],"two":[88],"tasks":[89],"constructing":[91],"respectively":[93],"checking":[94,115],"argument.":[97],"Checking":[98],"becomes":[99],"hard":[101],"step.":[102],"In":[103],"this":[104],"paper":[105],"we":[106,109],"show":[107],"solve":[110],"corresponding":[112],"challenge":[113],"binary":[117],"reachability":[118],"analysis.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":30}],"updated_date":"2026-04-11T08:14:18.477133","created_date":"2025-10-10T00:00:00"}