{"id":"https://openalex.org/W2003410111","doi":"https://doi.org/10.1145/1291151.1291166","title":"Relating complexity and precision in control flow analysis","display_name":"Relating complexity and precision in control flow analysis","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2003410111","doi":"https://doi.org/10.1145/1291151.1291166","mag":"2003410111"},"language":"en","primary_location":{"id":"doi:10.1145/1291151.1291166","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1291151.1291166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGPLAN international conference on Functional programming","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/A5091183810","display_name":"David Van Horn","orcid":"https://orcid.org/0000-0002-9201-6864"},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Van Horn","raw_affiliation_strings":["Brandeis University, Waltham, MA","Brandeis University , Waltham, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brandeis University, Waltham, MA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Brandeis University , Waltham, MA","institution_ids":["https://openalex.org/I6902469"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091120658","display_name":"Harry G. Mairson","orcid":"https://orcid.org/0009-0008-4964-8170"},"institutions":[{"id":"https://openalex.org/I6902469","display_name":"Brandeis University","ror":"https://ror.org/05abbep66","country_code":"US","type":"education","lineage":["https://openalex.org/I6902469"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Harry G. Mairson","raw_affiliation_strings":["Brandeis University, Waltham, MA","Brandeis University , Waltham, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brandeis University, Waltham, MA","institution_ids":["https://openalex.org/I6902469"]},{"raw_affiliation_string":"Brandeis University , Waltham, MA","institution_ids":["https://openalex.org/I6902469"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I6902469"],"apc_list":null,"apc_paid":null,"fwci":2.468,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89176883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"85","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.996999979019165,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.7397737503051758},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5897260308265686},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5807533264160156},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5718695521354675},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5489202737808228},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5342710614204407},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.47954580187797546},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4745883643627167},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4741494059562683},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.47305646538734436},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4714145362377167},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4568234086036682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4469878375530243},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4380338490009308},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4241373538970947},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3868297338485718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36269229650497437}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.7397737503051758},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5897260308265686},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5807533264160156},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5718695521354675},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5489202737808228},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5342710614204407},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.47954580187797546},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4745883643627167},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4741494059562683},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.47305646538734436},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4714145362377167},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4568234086036682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4469878375530243},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4380338490009308},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4241373538970947},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3868297338485718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36269229650497437},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1291151.1291166","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1291151.1291166","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W10127936","https://openalex.org/W159715351","https://openalex.org/W207336988","https://openalex.org/W1486310769","https://openalex.org/W1498815108","https://openalex.org/W1507046749","https://openalex.org/W1517223271","https://openalex.org/W1546990306","https://openalex.org/W1553391613","https://openalex.org/W1553894716","https://openalex.org/W1576014443","https://openalex.org/W1587849775","https://openalex.org/W1599217540","https://openalex.org/W1599545360","https://openalex.org/W1603473135","https://openalex.org/W1807717811","https://openalex.org/W1976808561","https://openalex.org/W1986334602","https://openalex.org/W1988983596","https://openalex.org/W1997981086","https://openalex.org/W2003786919","https://openalex.org/W2004971560","https://openalex.org/W2008920425","https://openalex.org/W2016065322","https://openalex.org/W2021217869","https://openalex.org/W2032137108","https://openalex.org/W2038229970","https://openalex.org/W2046910245","https://openalex.org/W2052440299","https://openalex.org/W2053118768","https://openalex.org/W2059860151","https://openalex.org/W2065403304","https://openalex.org/W2071990711","https://openalex.org/W2077519206","https://openalex.org/W2088956149","https://openalex.org/W2092727913","https://openalex.org/W2102389857","https://openalex.org/W2106553898","https://openalex.org/W2135287414","https://openalex.org/W2136290535","https://openalex.org/W2163705167","https://openalex.org/W2293168108","https://openalex.org/W4233636389","https://openalex.org/W6606522490"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W4297231931","https://openalex.org/W2534244659","https://openalex.org/W266537895","https://openalex.org/W2574530711","https://openalex.org/W1589381382","https://openalex.org/W2549774298","https://openalex.org/W1560182867","https://openalex.org/W4321524632","https://openalex.org/W2398485441"],"abstract_inverted_index":{"We":[0,40,81],"analyze":[1],"the":[2,54,57],"computational":[3],"complexity":[4],"of":[5,9,73,87],"kCFA,":[6],"a":[7,21,42,69,84],"hierarchy":[8,25],"control":[10],"flow":[11],"analyses":[12],"that":[13,35,52,94],"determine":[14],"which":[15],"functions":[16],"may":[17,36],"be":[18],"applied":[19],"at":[20],"given":[22],"call-site.":[23],"This":[24],"specifies":[26],"related":[27,89],"decision":[28,44],"problems,":[29],"quite":[30],"apart":[31],"from":[32],"any":[33],"algorithms":[34],"implement":[37],"their":[38],"solutions.":[39],"identify":[41,83],"simple":[43],"problem":[45,58],"answered":[46],"by":[47],"this":[48],"analysis":[49],"and":[50,92,107],"prove":[51,93],"in":[53],"0CFA":[55,88],"case,":[56],"is":[59,66,96],"complete":[60,97],"for":[61,98],"polynomial":[62],"time.":[63],"The":[64],"proof":[65],"based":[67,103],"on":[68,104],"nonstandard,":[70],"symmetric":[71],"implementation":[72],"Boolean":[74],"logic":[75,79],"within":[76],"multiplicative":[77],"linear":[78],"(MLL).":[80],"also":[82],"simpler":[85],"version":[86],"to":[90],"\u03b7-expansion,":[91],"it":[95],"logarithmic":[99],"space,":[100],"using":[101],"arguments":[102],"computing":[105],"paths":[106],"permutations.":[108]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}