{"id":"https://openalex.org/W2102339469","doi":"https://doi.org/10.1145/1273920.1273922","title":"Formalizing and verifying semantic type soundness of a simple compiler","display_name":"Formalizing and verifying semantic type soundness of a simple compiler","publication_year":2007,"publication_date":"2007-07-14","ids":{"openalex":"https://openalex.org/W2102339469","doi":"https://doi.org/10.1145/1273920.1273922","mag":"2102339469"},"language":"en","primary_location":{"id":"doi:10.1145/1273920.1273922","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273920.1273922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming","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/A5023252122","display_name":"Nick Benton","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"]},{"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":"Nick Benton","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/A5052030545","display_name":"Uri Zarfaty","orcid":null},"institutions":[{"id":"https://openalex.org/I2802000487","display_name":"Imperial Valley College","ror":"https://ror.org/039kas258","country_code":"US","type":"education","lineage":["https://openalex.org/I2802000487"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uri Zarfaty","raw_affiliation_strings":["Imperial College","imperial College"],"affiliations":[{"raw_affiliation_string":"Imperial College","institution_ids":["https://openalex.org/I2802000487"]},{"raw_affiliation_string":"imperial College","institution_ids":["https://openalex.org/I2802000487"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5023252122"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":4.8296,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.94961705,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9951000213623047,"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/soundness","display_name":"Soundness","score":0.8825709819793701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.869242250919342},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8244134783744812},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.7092095613479614},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5769128203392029},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.5526233911514282},{"id":"https://openalex.org/keywords/low-level-programming-language","display_name":"Low-level programming language","score":0.45203083753585815},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41689518094062805}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.8825709819793701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.869242250919342},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8244134783744812},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.7092095613479614},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5769128203392029},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.5526233911514282},{"id":"https://openalex.org/C124577441","wikidata":"https://www.wikidata.org/wiki/Q558937","display_name":"Low-level programming language","level":5,"score":0.45203083753585815},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41689518094062805},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.0},{"id":"https://openalex.org/C119263510","wikidata":"https://www.wikidata.org/wiki/Q7248501","display_name":"Programming domain","level":4,"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/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1273920.1273922","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1273920.1273922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.9253","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.9253","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/~nick/formaltr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6200000047683716,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W326743114","https://openalex.org/W1495368328","https://openalex.org/W1495825275","https://openalex.org/W1511487092","https://openalex.org/W1523713898","https://openalex.org/W1529372568","https://openalex.org/W1529526858","https://openalex.org/W1539402181","https://openalex.org/W1540509734","https://openalex.org/W1593280365","https://openalex.org/W1596014701","https://openalex.org/W1677332761","https://openalex.org/W1808214913","https://openalex.org/W1854089346","https://openalex.org/W1859811486","https://openalex.org/W1903525885","https://openalex.org/W1965602413","https://openalex.org/W1969600954","https://openalex.org/W1980939032","https://openalex.org/W1991984504","https://openalex.org/W1992347193","https://openalex.org/W2002475773","https://openalex.org/W2003820289","https://openalex.org/W2003848320","https://openalex.org/W2034043336","https://openalex.org/W2034711041","https://openalex.org/W2035030296","https://openalex.org/W2054279067","https://openalex.org/W2057648994","https://openalex.org/W2069107692","https://openalex.org/W2069300761","https://openalex.org/W2088982170","https://openalex.org/W2093541252","https://openalex.org/W2101241724","https://openalex.org/W2101444617","https://openalex.org/W2114834520","https://openalex.org/W2115974895","https://openalex.org/W2118246706","https://openalex.org/W2127625071","https://openalex.org/W2128180740","https://openalex.org/W2129695855","https://openalex.org/W2134553977","https://openalex.org/W2135620953","https://openalex.org/W2137628566","https://openalex.org/W2149996206","https://openalex.org/W2153297607","https://openalex.org/W2168734799","https://openalex.org/W2561675875","https://openalex.org/W2914920194","https://openalex.org/W4210653864","https://openalex.org/W4241057360","https://openalex.org/W4285719527","https://openalex.org/W6638366060"],"related_works":["https://openalex.org/W2192862863","https://openalex.org/W2369288331","https://openalex.org/W2044422526","https://openalex.org/W2519339279","https://openalex.org/W2467097043","https://openalex.org/W1497385637","https://openalex.org/W2562482846","https://openalex.org/W2038237961","https://openalex.org/W3034079570","https://openalex.org/W2102339469"],"abstract_inverted_index":{"We":[0],"describe":[1],"a":[2,14,17,45],"semantic":[3],"type":[4],"soundness":[5],"result,":[6],"formalized":[7],"in":[8,30,55],"the":[9,31,56],"Coq":[10],"proof":[11],"assistant,":[12],"for":[13],"compiler":[15],"from":[16],"simple":[18],"imperative":[19],"language":[20,33],"with":[21],"heap-allocated":[22],"data":[23],"into":[24],"an":[25],"idealized":[26],"assembly":[27],"language.":[28],"Types":[29],"high-level":[32],"are":[34],"interpreted":[35],"as":[36],"binary":[37],"relations,":[38],"built":[39],"using":[40],"both":[41],"second-order":[42],"quantification":[43],"and":[44,52],"form":[46],"of":[47],"separation":[48],"structure,":[49],"over":[50],"stores":[51],"code":[53],"pointers":[54],"low-level":[57],"machine.":[58]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}