{"id":"https://openalex.org/W4236379125","doi":"https://doi.org/10.1145/1190216.1190247","title":"Logic-flow analysis of higher-order programs","display_name":"Logic-flow analysis of higher-order programs","publication_year":2007,"publication_date":"2007-01-17","ids":{"openalex":"https://openalex.org/W4236379125","doi":"https://doi.org/10.1145/1190216.1190247"},"language":"en","primary_location":{"id":"doi:10.1145/1190216.1190247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th 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/A5086121459","display_name":"Matthew Might","orcid":"https://orcid.org/0000-0002-8430-5316"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Might","raw_affiliation_strings":["Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086121459"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":1.1128,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79549711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10142","display_name":"Formal Methods in Verification","score":0.9986000061035156,"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/T11424","display_name":"Security and Verification in Computing","score":0.9984999895095825,"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/computer-science","display_name":"Computer science","score":0.7052058577537537},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.6952440738677979},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6677433252334595},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6577192544937134},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6094942092895508},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5002398490905762},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49037814140319824},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.47839248180389404},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.47474414110183716},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.4613639712333679},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4537979066371918},{"id":"https://openalex.org/keywords/continuation","display_name":"Continuation","score":0.42784443497657776},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.4137773811817169},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.16236677765846252}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7052058577537537},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.6952440738677979},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6677433252334595},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6577192544937134},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6094942092895508},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5002398490905762},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49037814140319824},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.47839248180389404},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.47474414110183716},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.4613639712333679},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4537979066371918},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.42784443497657776},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.4137773811817169},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.16236677765846252}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1190216.1190247","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1190216.1190247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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":14,"referenced_works":["https://openalex.org/W2043100293","https://openalex.org/W2062823821","https://openalex.org/W2079752311","https://openalex.org/W2086991228","https://openalex.org/W2099107163","https://openalex.org/W2100962534","https://openalex.org/W2109772966","https://openalex.org/W2110507526","https://openalex.org/W2114614628","https://openalex.org/W2122820409","https://openalex.org/W2151716725","https://openalex.org/W3158747708","https://openalex.org/W4237721941","https://openalex.org/W4250199140"],"related_works":["https://openalex.org/W2025838732","https://openalex.org/W2525463489","https://openalex.org/W1608803044","https://openalex.org/W1600237262","https://openalex.org/W2157660637","https://openalex.org/W2077499329","https://openalex.org/W2970480852","https://openalex.org/W2952741507","https://openalex.org/W1836373119","https://openalex.org/W1606129265"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3,34,39,69,92,98,102,113],"framework":[4,17],"for":[5,46,95],"fusing":[6],"flow":[7,78],"analysis":[8,14,79],"and":[9,32,112],"theorem":[10],"proving":[11],"called":[12],"logic-flow":[13],"(LFA).":[15],"The":[16,43],"itself":[18],"is":[19,48,83],"the":[20,49,74,77],"reduced":[21],"product":[22,104],"of":[23,36,52,105,110],"two":[24,106],"abstract":[25,29,107],"interpretations:":[26],"(1)":[27],"an":[28],"state":[30],"machine":[31],"(2)":[33],"set":[35],"propositions":[37],"in":[38],"restricted":[40],"first-order":[41,100],"logic.":[42],"motivating":[44],"application":[45],"LFA":[47,64],"safe":[50],"removal":[51],"implicit":[53],"array-bounds":[54],"checks":[55],"without":[56],"type":[57],"information,":[58],"user":[59],"interaction":[60],"or":[61,76],"program":[62],"annotation.":[63],"achieves":[65],"this":[66],"by":[67],"delegating":[68],"given":[70],"task":[71],"to":[72,86],"either":[73],"prover":[75],"depending":[80],"on":[81],"which":[82],"best":[84],"suited":[85],"discharge":[87],"it.":[88],"Described":[89],"within":[90],"are":[91],"concrete":[93],"semantics":[94],"continuation-passing":[96],"style;":[97],"restricted,":[99],"logic;":[101],"woven":[103],"interpretations;":[108],"proofs":[109],"correctness;":[111],"worked":[114],"example.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}