{"id":"https://openalex.org/W2103279048","doi":"https://doi.org/10.1145/2737924.2737987","title":"DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs","display_name":"DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2103279048","doi":"https://doi.org/10.1145/2737924.2737987","mag":"2103279048"},"language":"en","primary_location":{"id":"doi:10.1145/2737924.2737987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2737924.2737987","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 ACM SIGPLAN Conference on Programming Language Design and Implementation","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/A5029930688","display_name":"Akash Lal","orcid":"https://orcid.org/0009-0002-4359-9378"},"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/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Akash Lal","raw_affiliation_strings":["Microsoft Research, India","Microsoft Research India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research India#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/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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9991,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.7150547,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"280","last_page":"290"},"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.9994999766349792,"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.9987999796867371,"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/reachability","display_name":"Reachability","score":0.9467341899871826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8036792874336243},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5727738738059998},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.5695713758468628},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.561398446559906},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5530385971069336},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5458231568336487},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5348334312438965},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.534083366394043},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5074021220207214},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.46706563234329224},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4538012146949768},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.40561336278915405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29451948404312134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.23432433605194092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17751508951187134},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09834012389183044}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9467341899871826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8036792874336243},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5727738738059998},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.5695713758468628},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.561398446559906},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5530385971069336},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5458231568336487},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5348334312438965},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.534083366394043},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5074021220207214},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.46706563234329224},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4538012146949768},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40561336278915405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29451948404312134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.23432433605194092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17751508951187134},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09834012389183044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2737924.2737987","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2737924.2737987","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 ACM SIGPLAN Conference on Programming Language Design and Implementation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7599999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W121297392","https://openalex.org/W147625861","https://openalex.org/W1507006488","https://openalex.org/W1514446453","https://openalex.org/W1606177908","https://openalex.org/W1691700263","https://openalex.org/W1979693894","https://openalex.org/W2044280934","https://openalex.org/W2057156093","https://openalex.org/W2058895276","https://openalex.org/W2062705593","https://openalex.org/W2096146112","https://openalex.org/W2118424088","https://openalex.org/W2123636373","https://openalex.org/W2129538349","https://openalex.org/W2152492994","https://openalex.org/W2158798798","https://openalex.org/W2162284942","https://openalex.org/W2500165681","https://openalex.org/W4233804448","https://openalex.org/W4242057943"],"related_works":["https://openalex.org/W2114879239","https://openalex.org/W3014139035","https://openalex.org/W2408108908","https://openalex.org/W3043232031","https://openalex.org/W2146072020","https://openalex.org/W1530824419","https://openalex.org/W2810777846","https://openalex.org/W2583954723","https://openalex.org/W2103279048","https://openalex.org/W3023596811"],"abstract_inverted_index":{"A":[0],"hierarchical":[1,23,75],"program":[2,100],"is":[3,40,77],"one":[4],"with":[5],"multiple":[6],"procedures":[7,82,146],"but":[8],"no":[9],"loops":[10],"or":[11],"recursion.":[12],"This":[13,38],"paper":[14],"studies":[15],"the":[16,60,88,95,99,112,115,128,143,173],"problem":[17,39],"of":[18,62,71,98,114,138,145,176],"deciding":[19,72],"reachability":[20,51,55,73,86],"queries":[21],"in":[22,31,36,52,74,111,172],"programs":[24,76],"where":[25],"individual":[26],"statements":[27],"can":[28,154],"be":[29],"encoded":[30],"a":[32,57,102,121,132,139,177],"decidable":[33],"logic":[34],"(say":[35],"SMT).":[37],"fundamental":[41],"to":[42,48,78,101,107,131,169],"verification":[43],"and":[44,65,83,104,119],"most":[45],"directly":[46],"applicable":[47],"doing":[49],"bounded":[50],"programs,":[53],"i.e.,":[54],"under":[56],"bound":[58],"on":[59,87],"number":[61],"loop":[63],"iterations":[64],"recursive":[66],"calls.":[67],"The":[68],"usual":[69],"method":[70,122],"first":[79],"inline":[80],"all":[81],"then":[84],"do":[85],"resulting":[89],"single-procedure":[90],"program.":[91,116],"Such":[92],"inlining":[93,125,153],"unfolds":[94,127],"call":[96,129],"graph":[97,130,135],"tree":[103,140,161],"may":[105],"lead":[106],"an":[108],"exponential":[109],"increase":[110],"size":[113],"We":[117],"design":[118],"evaluate":[120],"called":[123],"DAG":[124,152],"that":[126,166],"directed":[133],"acyclic":[134],"(DAG)":[136],"instead":[137],"by":[141],"sharing":[142],"bodies":[144],"at":[147],"certain":[148],"points":[149],"during":[150],"inlining.":[151,162],"produce":[155],"much":[156],"more":[157],"compact":[158],"representations":[159],"than":[160],"Empirically,":[163],"we":[164],"show":[165],"it":[167],"leads":[168],"significant":[170],"improvements":[171],"running":[174],"time":[175],"state-of-the-art":[178],"verifier.":[179]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}