{"id":"https://openalex.org/W2123828382","doi":"https://doi.org/10.1145/1111037.1111048","title":"Verifying properties of well-founded linked lists","display_name":"Verifying properties of well-founded linked lists","publication_year":2006,"publication_date":"2006-01-11","ids":{"openalex":"https://openalex.org/W2123828382","doi":"https://doi.org/10.1145/1111037.1111048","mag":"2123828382"},"language":"en","primary_location":{"id":"doi:10.1145/1111037.1111048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1111037.1111048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5041084431","display_name":"Shuvendu K. Lahiri","orcid":"https://orcid.org/0000-0002-4446-4777"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"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","US"],"is_corresponding":true,"raw_author_name":"Shuvendu K. Lahiri","raw_affiliation_strings":["Microsoft Research","Microsoft research#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072464909","display_name":"Shaz Qadeer","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"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Shaz Qadeer","raw_affiliation_strings":["Microsoft Research","Microsoft research#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041084431"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":23.7256,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.99578303,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"126"},"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.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/T10126","display_name":"Logic, programming, and type systems","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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9897000193595886,"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/correctness","display_name":"Correctness","score":0.7945014238357544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7398532629013062},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6946755647659302},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6817044019699097},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.6704268455505371},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6306702494621277},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.5341996550559998},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.5272618532180786},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5233627557754517},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5170369744300842},{"id":"https://openalex.org/keywords/program-synthesis","display_name":"Program synthesis","score":0.4997081756591797},{"id":"https://openalex.org/keywords/generic-programming","display_name":"Generic programming","score":0.49661165475845337},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4499196410179138},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.4277937710285187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34383922815322876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21476119756698608},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.16000166535377502},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11696311831474304}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7945014238357544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7398532629013062},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6946755647659302},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6817044019699097},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.6704268455505371},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6306702494621277},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.5341996550559998},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.5272618532180786},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5233627557754517},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5170369744300842},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.4997081756591797},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.49661165475845337},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4499196410179138},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.4277937710285187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34383922815322876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21476119756698608},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.16000166535377502},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11696311831474304},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1111037.1111048","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1111037.1111048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.3054","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.3054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.microsoft.com/pubs/76589/popl06-havoc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W106387794","https://openalex.org/W1485718948","https://openalex.org/W1495368328","https://openalex.org/W1497571013","https://openalex.org/W1515278398","https://openalex.org/W1533299090","https://openalex.org/W1552505815","https://openalex.org/W1557880268","https://openalex.org/W1558061996","https://openalex.org/W1578097867","https://openalex.org/W1582008002","https://openalex.org/W1592502301","https://openalex.org/W1602537816","https://openalex.org/W1851346840","https://openalex.org/W1972085995","https://openalex.org/W1974265510","https://openalex.org/W1988441831","https://openalex.org/W1993836075","https://openalex.org/W2009489912","https://openalex.org/W2030101147","https://openalex.org/W2030697178","https://openalex.org/W2055477538","https://openalex.org/W2080769562","https://openalex.org/W2082827821","https://openalex.org/W2103953153","https://openalex.org/W2108611287","https://openalex.org/W2136767512","https://openalex.org/W2137628566","https://openalex.org/W2139356751","https://openalex.org/W2142785340","https://openalex.org/W2147832077","https://openalex.org/W2162284942","https://openalex.org/W2164778826","https://openalex.org/W2170577595","https://openalex.org/W2295903414","https://openalex.org/W2912166712","https://openalex.org/W4242057943","https://openalex.org/W4256027310","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2520438138","https://openalex.org/W2985615839","https://openalex.org/W2074285438","https://openalex.org/W2294635730","https://openalex.org/W4321434118","https://openalex.org/W4229576726","https://openalex.org/W2171685273","https://openalex.org/W2123828382","https://openalex.org/W4253618974","https://openalex.org/W5424990"],"abstract_inverted_index":{"We":[0,97,113,157,172,200,231],"describe":[1],"a":[2,45,50,56,64,150,160,183,206,216],"novel":[3,161],"method":[4,204],"for":[5,81,193,245],"verifying":[6],"programs":[7,220],"that":[8,17,44,54,67,99,190],"manipulate":[9],"linked":[10,110],"lists,":[11],"based":[12],"on":[13,58],"two":[14,125,155,180],"new":[15],"predicates":[16,24,130],"characterize":[18],"reachability":[19],"of":[20,71,107,136,153,169,186,197,215,218,236],"heap":[21,70],"cells.":[22],"These":[23],"allow":[25],"reasoning":[26],"about":[27],"both":[28,222],"acyclic":[29,223],"and":[30,131,144,208,224,228],"cyclic":[31,225],"lists":[32,227],"uniformly":[33],"with":[34,109,122],"equal":[35],"ease.":[36],"The":[37],"crucial":[38],"insight":[39],"behind":[40],"our":[41,100,115,154,174,203],"approach":[42],"is":[43],"circular":[46],"list":[47],"invariably":[48],"contains":[49,91],"distinguished":[51],"head":[52,95],"cell":[53],"provides":[55],"handle":[57],"the":[59,69,72,86,103,120,145,167,170,195,213,234],"list.":[60],"This":[61],"observation":[62],"suggests":[63],"programming":[65,108],"methodology":[66,101,116],"requires":[68],"program":[73,121,142],"at":[74,92],"each":[75],"step":[76],"to":[77,124,177,211,240],"be":[78],"well-founded,":[79],"i.e.,":[80],"any":[82],"field":[83],"f":[84],"in":[85,134,205],"program,":[87],"every":[88],"sequence":[89],"u.f,u.f.f,...":[90],"least":[93],"one":[94],"cell.":[96],"believe":[98],"captures":[102],"most":[104],"common":[105],"idiom":[106],"data":[111],"structures.":[112],"enforce":[114],"by":[117,166],"automatically":[118,241],"instrumenting":[119],"updates":[123],"auxiliary":[126,138],"variables":[127],"representing":[128],"these":[129,137,246],"adding":[132],"assertions":[133],"terms":[135],"variables.":[139],"To":[140],"prove":[141],"properties":[143],"instrumented":[146],"assertions,":[147],"we":[148],"provide":[149],"first-order":[151,188],"axiomatization":[152],"predicates.":[156],"also":[158,232],"introduce":[159],"induction":[162,175],"principle":[163,176],"made":[164],"possible":[165],"well-foundedness":[168],"heap.":[171],"use":[173,235],"derive":[178],"from":[179],"basic":[181],"axioms":[182,189],"small":[184],"set":[185],"additional":[187],"are":[191],"useful":[192],"proving":[194],"correctness":[196,214],"several":[198],"programs.":[199],"have":[201],"implemented":[202],"tool":[207],"used":[209],"it":[210],"verify":[212],"variety":[217],"nontrivial":[219],"manipulating":[221],"singly-linked":[226],"doubly-linked":[229],"lists.":[230],"demonstrate":[233],"indexed":[237],"predicate":[238],"abstraction":[239],"synthesize":[242],"loop":[243],"invariants":[244],"examples.":[247]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}