{"id":"https://openalex.org/W2117111736","doi":"https://doi.org/10.1109/lics.2008.37","title":"Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs","display_name":"Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2117111736","doi":"https://doi.org/10.1109/lics.2008.37","mag":"2117111736"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2008.37","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2008.37","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"Proceedings - Symposium on Logic in Computer Science","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","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/A5045578851","display_name":"Vineet Kahlon","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vineet Kahlon","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA","NEC Lab. America, Princeton, NJ#TAB#"],"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"NEC Lab. America, Princeton, NJ#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045578851"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":0.6932,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.76277657,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":null,"first_page":"181","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dataflow","display_name":"Dataflow","score":0.7033879160881042},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6849657893180847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6573176383972168},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5086765885353088},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.45974546670913696},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4177265167236328},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3977028727531433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3180682063102722},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3073117434978485}],"concepts":[{"id":"https://openalex.org/C96324660","wikidata":"https://www.wikidata.org/wiki/Q205446","display_name":"Dataflow","level":2,"score":0.7033879160881042},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6849657893180847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6573176383972168},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5086765885353088},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.45974546670913696},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4177265167236328},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3977028727531433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3180682063102722},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3073117434978485}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lics.2008.37","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2008.37","pdf_url":null,"source":{"id":"https://openalex.org/S4210192682","display_name":"Proceedings - Symposium on Logic in Computer Science","issn_l":"1043-6871","issn":["1043-6871","2575-5528"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 23rd Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W313025167","https://openalex.org/W1545371423","https://openalex.org/W1568478782","https://openalex.org/W1583551426","https://openalex.org/W1587449012","https://openalex.org/W1589224558","https://openalex.org/W1911833263","https://openalex.org/W2038216124","https://openalex.org/W2043100293","https://openalex.org/W2060345611","https://openalex.org/W2098410450","https://openalex.org/W2111422217","https://openalex.org/W2119006541","https://openalex.org/W2132661148","https://openalex.org/W2147536493","https://openalex.org/W2152777241","https://openalex.org/W2160520283","https://openalex.org/W2164496154","https://openalex.org/W4247858957","https://openalex.org/W4301467326","https://openalex.org/W6635133958","https://openalex.org/W6681643983"],"related_works":["https://openalex.org/W2293118914","https://openalex.org/W2998381397","https://openalex.org/W4236419692","https://openalex.org/W3167919718","https://openalex.org/W4251718783","https://openalex.org/W2171015181","https://openalex.org/W4239447582","https://openalex.org/W1484403103","https://openalex.org/W2127267268","https://openalex.org/W2170721748"],"abstract_inverted_index":{"Dataflow":[0],"analysis":[1,270],"for":[2,99,131,201,237,251],"concurrent":[3,273],"programs":[4],"is":[5,20,97,235],"a":[6,28,31],"problem":[7,113],"of":[8,39,88,114,118,175,181,192,218,246,267],"critical":[9],"importance":[10],"but,":[11],"unfortunately,":[12],"also":[13],"an":[14,229,249],"undecidable":[15,98],"one.":[16],"A":[17],"key":[18],"obstacle":[19],"to":[21,47,262,271],"determine":[22],"precisely":[23],"how":[24],"dataflow":[25,269],"facts":[26],"at":[27],"location":[29],"in":[30,43,63,85,155,256],"given":[32,51],"thread":[33],"could":[34],"be":[35,225],"affected":[36],"by":[37,91],"operations":[38],"other":[40],"threads.This":[41],"problem,":[42],"turn,":[44],"boils":[45],"down":[46],"pairwise":[48,95,116,210,219],"reachability,":[49],"i.e.,":[50,129,275],"program":[52,157],"locations":[53,221],"c":[54,59,119,124,143,148],"<sub":[55,60,67,72,120,125,134,139,144,149,159,163,167,171,177,183,188,194],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[56,61,68,73,121,126,135,140,145,150,160,164,168,172,178,184,189,195],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[57,69,122,136,146,161,179,185],"and":[58,70,80,123,137,147,186,222,239,277],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[62,74,127,141,151,169,173,190,196],"two":[64,264],"threads":[65],"T":[66,71,158,166,182,193],",":[75,128,142],"respectively,":[76],"determining":[77],"whether":[78,130],"c1":[79],"c2":[81],"are":[82,152],"simultaneously":[83,153],"reachable":[84,154,220],"the":[86,106,110,156,216,244,272],"presence":[87],"constraints":[89],"imposed":[90],"synchronization":[92,101],"primitives.":[93,102],"Unfortunately,":[94],"reachability":[96,117,211],"most":[100],"However,":[103],"we":[104,242],"leverage":[105],"surprising":[107],"result":[108],"that":[109],"closely":[111],"related":[112],"parameterized":[115],"some":[132],"n":[133,138,162,170,176,187],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1||</sub>":[165],"comprised":[174],"copies":[180,191],",is":[197],"not":[198],"only":[199],"decidable":[200],"many":[202],"primitives,":[203],"but":[204],"efficiently":[205],"so.":[206],"Although":[207],"parameterization":[208,247,259],"makes":[209],"tractable":[212],"it":[213],"may":[214],"over-approximate":[215],"set":[217],"can,":[223],"therefore,":[224],"looked":[226],"upon":[227],"as":[228,232,248],"abstraction":[230,250],"technique.Where":[231],"abstract":[233,254],"interpretation":[234,255],"used":[236],"control":[238],"data":[240],"abstractions,":[241],"propose":[243],"use":[245],"concurrency.":[252],"Leveraging":[253],"conjunction":[257],"with":[258],"allows":[260],"us":[261],"lift":[263],"desirable":[265],"properties":[266],"sequential":[268],"domain,":[274],"precision":[276],"scalability.":[278]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}