{"id":"https://openalex.org/W2111050128","doi":"https://doi.org/10.1145/1480881.1480921","title":"Unifying type checking and property checking for low-level code","display_name":"Unifying type checking and property checking for low-level code","publication_year":2009,"publication_date":"2009-01-20","ids":{"openalex":"https://openalex.org/W2111050128","doi":"https://doi.org/10.1145/1480881.1480921","mag":"2111050128"},"language":"en","primary_location":{"id":"doi:10.1145/1480881.1480921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1480881.1480921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th annual 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/A5037548097","display_name":"Jeremy Condit","orcid":null},"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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeremy Condit","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082428064","display_name":"Brian Hackett","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Hackett","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuvendu K. Lahiri","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","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/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaz Qadeer","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5037548097"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":14.8668,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.99038743,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"314"},"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.9987000226974487,"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.9987000226974487,"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/T11424","display_name":"Security and Verification in Computing","score":0.9984999895095825,"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.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.7315753698348999},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7136883735656738},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6392831206321716},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6244378089904785},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4590612053871155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3344987630844116}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7315753698348999},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7136883735656738},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6392831206321716},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6244378089904785},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4590612053871155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3344987630844116},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1480881.1480921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1480881.1480921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.153.4198","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.4198","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/75197/popl099.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.360.4933","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.360.4933","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/en-us/um/people/qadeer/docs/popl09.havoc.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1508482211","https://openalex.org/W1532097571","https://openalex.org/W1590844387","https://openalex.org/W1606177908","https://openalex.org/W1606540187","https://openalex.org/W1825457006","https://openalex.org/W1874682220","https://openalex.org/W1887332367","https://openalex.org/W1959256509","https://openalex.org/W1979619055","https://openalex.org/W1991984504","https://openalex.org/W1993836075","https://openalex.org/W2005192022","https://openalex.org/W2034711041","https://openalex.org/W2044253896","https://openalex.org/W2051632385","https://openalex.org/W2066210260","https://openalex.org/W2069107692","https://openalex.org/W2098806455","https://openalex.org/W2114771706","https://openalex.org/W2114895548","https://openalex.org/W2120897738","https://openalex.org/W2128180740","https://openalex.org/W2129695855","https://openalex.org/W2137628566","https://openalex.org/W2152492994","https://openalex.org/W2153297607","https://openalex.org/W2155374739","https://openalex.org/W2159377125","https://openalex.org/W2162284942","https://openalex.org/W2164719159","https://openalex.org/W2164778826","https://openalex.org/W2295903414","https://openalex.org/W2295923951","https://openalex.org/W2504100651","https://openalex.org/W2525869977","https://openalex.org/W3006633543","https://openalex.org/W4230004677","https://openalex.org/W4233804448","https://openalex.org/W4241223029","https://openalex.org/W6638583435","https://openalex.org/W6677124578","https://openalex.org/W6727795161"],"related_works":["https://openalex.org/W1538854713","https://openalex.org/W2041209185","https://openalex.org/W4235160909","https://openalex.org/W1484021165","https://openalex.org/W3021865842","https://openalex.org/W2196991573","https://openalex.org/W4289687320","https://openalex.org/W2116366046","https://openalex.org/W925418074","https://openalex.org/W2119610731"],"abstract_inverted_index":{"We":[0,64],"present":[1],"a":[2,71],"unified":[3],"approach":[4],"to":[5,37,51],"type":[6,22,35,72],"checking":[7,10,15,41],"and":[8],"property":[9,40,81],"for":[11,16,33,42,74],"low-level":[12,17,43,75],"code.":[13],"Type":[14],"code":[18,44,76],"is":[19,45,49],"challenging":[20,46],"because":[21,47],"safety":[23],"often":[24],"depends":[25],"on":[26],"complex,":[27],"program-specific":[28],"invariants":[29],"that":[30,55],"are":[31],"difficult":[32,50],"traditional":[34],"checkers":[36],"express.":[38],"Conversely,":[39],"it":[48],"write":[52],"concise":[53],"specifications":[54],"distinguish":[56],"between":[57],"locations":[58],"in":[59],"an":[60],"untyped":[61],"program's":[62],"heap.":[63],"address":[65],"both":[66],"problems":[67],"simultaneously":[68],"by":[69],"implementing":[70],"checker":[73],"as":[77],"part":[78],"of":[79],"our":[80],"checker.":[82]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}