{"id":"https://openalex.org/W2033942886","doi":"https://doi.org/10.1145/2429069.2429086","title":"Inductive data flow graphs","display_name":"Inductive data flow graphs","publication_year":2013,"publication_date":"2013-01-22","ids":{"openalex":"https://openalex.org/W2033942886","doi":"https://doi.org/10.1145/2429069.2429086","mag":"2033942886"},"language":"en","primary_location":{"id":"doi:10.1145/2429069.2429086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th 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/A5016276143","display_name":"Azadeh Farzan","orcid":"https://orcid.org/0000-0001-9005-2653"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Azadeh Farzan","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041698482","display_name":"Zachary Kincaid","orcid":"https://orcid.org/0000-0002-7294-9165"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zachary Kincaid","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062411838","display_name":"Andreas Podelski","orcid":"https://orcid.org/0000-0003-2540-9489"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Podelski","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.0494,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.98493885,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9965999722480774,"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.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.747361958026886},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7331855297088623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7329992651939392},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.6343500018119812},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5770038366317749},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5124833583831787},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46864646673202515},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.4430605173110962},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.4400067627429962},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.42643100023269653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3245489001274109},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21227172017097473},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1530829668045044}],"concepts":[{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.747361958026886},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7331855297088623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7329992651939392},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.6343500018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5770038366317749},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5124833583831787},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46864646673202515},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.4430605173110962},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.4400067627429962},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.42643100023269653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3245489001274109},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21227172017097473},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1530829668045044}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2429069.2429086","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2429069.2429086","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.651.1784","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.651.1784","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~zkincaid/pub/popl13.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1481018260","https://openalex.org/W1501731334","https://openalex.org/W1515906028","https://openalex.org/W1527654363","https://openalex.org/W1527710292","https://openalex.org/W1531955077","https://openalex.org/W1537510808","https://openalex.org/W1539795027","https://openalex.org/W1554063762","https://openalex.org/W1562915062","https://openalex.org/W1605985842","https://openalex.org/W1841626152","https://openalex.org/W1965662337","https://openalex.org/W1971388424","https://openalex.org/W1975653808","https://openalex.org/W1984342415","https://openalex.org/W1988949749","https://openalex.org/W2043100293","https://openalex.org/W2043555680","https://openalex.org/W2070908350","https://openalex.org/W2096199323","https://openalex.org/W2111996055","https://openalex.org/W2144344516","https://openalex.org/W2156461803","https://openalex.org/W2162339514","https://openalex.org/W2170487018","https://openalex.org/W2170736936","https://openalex.org/W2188469581","https://openalex.org/W2293685560","https://openalex.org/W2394814352","https://openalex.org/W2695578481","https://openalex.org/W3100198463","https://openalex.org/W4236040576","https://openalex.org/W4241108585","https://openalex.org/W4243742593","https://openalex.org/W6636362959"],"related_works":["https://openalex.org/W2151163382","https://openalex.org/W2166895275","https://openalex.org/W2998775986","https://openalex.org/W1549956274","https://openalex.org/W4256382613","https://openalex.org/W1484884871","https://openalex.org/W2114464863","https://openalex.org/W2052160877","https://openalex.org/W94523631","https://openalex.org/W2080046362"],"abstract_inverted_index":{"The":[0,80,98,137],"correctness":[1],"of":[2,12,36,52,70,100,111,130,142],"a":[3,50,65,115,157],"sequential":[4],"program":[5,55,72,94,151],"can":[6,118],"be":[7,119],"shown":[8],"by":[9],"the":[10,34,68,101,109,128,133,140,143,147],"annotation":[11],"its":[13],"control":[14],"flow":[15,24,27,46,87,104],"graph":[16,47,88,105],"with":[17,29],"inductive":[18,22,31,44,85,102],"assertions.":[19],"We":[20],"propose":[21],"data":[23,26,45,86,103,112,134],"graphs,":[25],"graphs":[28],"incorporated":[30],"assertions,":[32],"as":[33,64],"basis":[35],"an":[37,84],"approach":[38,81,138],"to":[39,77,156],"verifying":[40],"concurrent":[41,71],"programs.":[42],"An":[43],"accounts":[48],"for":[49,67],"set":[51,69],"dependencies":[53,113,135],"between":[54],"actions":[56],"in":[57,108,127],"interleaved":[58],"thread":[59],"executions,":[60],"and":[61,89],"therefore":[62],"stands":[63],"representation":[66],"traces":[73,95,152],"which":[74],"give":[75],"rise":[76],"these":[78],"dependencies.":[79],"first":[82],"constructs":[83],"then":[90],"checks":[91],"whether":[92,149],"all":[93,150],"are":[96,153],"represented.":[97],"size":[99],"is":[106],"polynomial":[107],"number":[110,129],"(in":[114],"sense":[116],"that":[117],"made":[120],"formal);":[121],"it":[122],"does":[123],"not":[124],"grow":[125],"exponentially":[126],"threads":[131],"unless":[132],"do.":[136],"shifts":[139],"burden":[141],"exponential":[144],"explosion":[145],"towards":[146],"check":[148],"represented,":[154],"i.e.,":[155],"combinatorial":[158],"problem":[159],"(over":[160],"finite":[161],"graphs).":[162]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}