{"id":"https://openalex.org/W1979619055","doi":"https://doi.org/10.1145/1328438.1328461","title":"Back to the future","display_name":"Back to the future","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W1979619055","doi":"https://doi.org/10.1145/1328438.1328461","mag":"1979619055"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shuvendu Lahiri","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":17.7134,"has_fulltext":false,"cited_by_count":143,"citation_normalized_percentile":{"value":0.99808596,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"171","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9988999962806702,"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.794475793838501},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6882245540618896},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.6463139057159424},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6317617893218994},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.5250784754753113},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5153712630271912},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5017480850219727},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49852561950683594},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46178585290908813},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.45754334330558777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14842036366462708},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08195164799690247}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.794475793838501},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6882245540618896},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.6463139057159424},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6317617893218994},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.5250784754753113},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5153712630271912},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5017480850219727},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49852561950683594},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46178585290908813},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.45754334330558777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14842036366462708},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08195164799690247},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1328438.1328461","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328461","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W142561622","https://openalex.org/W1497571013","https://openalex.org/W1508811155","https://openalex.org/W1538691881","https://openalex.org/W1549008998","https://openalex.org/W1552077729","https://openalex.org/W1552505815","https://openalex.org/W1557880268","https://openalex.org/W1578097867","https://openalex.org/W1605593319","https://openalex.org/W1606540187","https://openalex.org/W1959256509","https://openalex.org/W1975156572","https://openalex.org/W1988441831","https://openalex.org/W1993836075","https://openalex.org/W2030101147","https://openalex.org/W2055477538","https://openalex.org/W2096449544","https://openalex.org/W2103953153","https://openalex.org/W2105588192","https://openalex.org/W2108611287","https://openalex.org/W2123828382","https://openalex.org/W2124704329","https://openalex.org/W2125967324","https://openalex.org/W2137628566","https://openalex.org/W2143331802","https://openalex.org/W2147832077","https://openalex.org/W2152492994","https://openalex.org/W2152686702","https://openalex.org/W2162284942","https://openalex.org/W2164778826","https://openalex.org/W2172166433","https://openalex.org/W2295903414","https://openalex.org/W4233804448","https://openalex.org/W4237492309","https://openalex.org/W4241226388","https://openalex.org/W4242057943"],"related_works":["https://openalex.org/W4296607663","https://openalex.org/W2578463151","https://openalex.org/W4290679430","https://openalex.org/W1481101394","https://openalex.org/W4290004727","https://openalex.org/W2810367355","https://openalex.org/W100569329","https://openalex.org/W2275420537","https://openalex.org/W1483783534","https://openalex.org/W4379142300"],"abstract_inverted_index":{"This":[0],"paper":[1],"takes":[2],"a":[3,64],"fresh":[4],"look":[5],"at":[6],"the":[7,22,30,71,89,92,95,106,110],"problem":[8],"of":[9,12,25,32,41,57,67,94,109],"precise":[10],"verification":[11],"heap-manipulating":[13,42],"programs":[14],"using":[15],"first-order":[16],"Satisfiability-Modulo-Theories":[17],"(SMT)":[18],"solvers.":[19,60],"We":[20,61],"augment":[21],"specification":[23],"logic":[24,45,69],"such":[26],"solvers":[27,72],"by":[28],"introducing":[29],"Logic":[31],"Interpreted":[33],"Sets":[34],"and":[35,52,74,76,91,102],"Bounded":[36],"Quantification":[37],"for":[38],"specifying":[39],"properties":[40],"programs.":[43,83],"Our":[44,84],"is":[46,87,97],"expressive,":[47],"closed":[48],"under":[49],"weakest":[50],"preconditions,":[51],"efficiently":[53],"implementable":[54],"on":[55],"top":[56],"existing":[58],"SMT":[59],"have":[62],"created":[63],"prototype":[65,79],"implementation":[66],"our":[68,78],"over":[70],"Simplify":[73],"Z3":[75],"used":[77],"to":[80],"verify":[81],"many":[82],"preliminary":[85],"experience":[86,108],"encouraging;":[88],"completeness":[90],"efficiency":[93],"decisionprocedure":[96],"clearly":[98],"evident":[99],"in":[100],"practice":[101],"has":[103],"greatly":[104],"improved":[105],"user":[107],"verifier.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":13}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}