{"id":"https://openalex.org/W2023867746","doi":"https://doi.org/10.1016/s1571-0661(04)80351-7","title":"Model Checking Erlang Programs \u2013 Abstracting Recursive Function Calls","display_name":"Model Checking Erlang Programs \u2013 Abstracting Recursive Function Calls","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2023867746","doi":"https://doi.org/10.1016/s1571-0661(04)80351-7","mag":"2023867746"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80351-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80351-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80351-7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021022617","display_name":"Frank Huch","orcid":"https://orcid.org/0000-0003-0156-5014"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Frank Huch","raw_affiliation_strings":["Institute for Computer Science, Christian-Albrechts-University of Kiel, D-24098 Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Computer Science, Christian-Albrechts-University of Kiel, D-24098 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021022617"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":0.3388,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.5510104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"64","issue":null,"first_page":"195","last_page":"219"},"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.9994000196456909,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/erlang","display_name":"Erlang (programming language)","score":0.8687349557876587},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"Abstract interpretation","score":0.8023171424865723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7429229021072388},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7428668141365051},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7119995355606079},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.6611599326133728},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.6088153123855591},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5435171127319336},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5415191650390625},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.45171573758125305},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4446156322956085},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.4353683590888977},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34928128123283386},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.2541253864765167},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.12962019443511963}],"concepts":[{"id":"https://openalex.org/C82484044","wikidata":"https://www.wikidata.org/wiki/Q334879","display_name":"Erlang (programming language)","level":3,"score":0.8687349557876587},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.8023171424865723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7429229021072388},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7428668141365051},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7119995355606079},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.6611599326133728},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.6088153123855591},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5435171127319336},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5415191650390625},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.45171573758125305},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4446156322956085},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.4353683590888977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34928128123283386},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.2541253864765167},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.12962019443511963},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80351-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80351-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80351-7","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80351-7","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.8199999928474426}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W148396834","https://openalex.org/W1504739534","https://openalex.org/W1506588809","https://openalex.org/W1512310098","https://openalex.org/W1529785310","https://openalex.org/W1540180001","https://openalex.org/W1584322803","https://openalex.org/W1598029861","https://openalex.org/W1598605911","https://openalex.org/W2021412145","https://openalex.org/W2040060046","https://openalex.org/W2043100293","https://openalex.org/W2054299141","https://openalex.org/W2057663649","https://openalex.org/W2072075503","https://openalex.org/W2080987629","https://openalex.org/W2090398333","https://openalex.org/W2093916942","https://openalex.org/W2105223068","https://openalex.org/W2174627168","https://openalex.org/W2913459036","https://openalex.org/W2989287749","https://openalex.org/W6606018955","https://openalex.org/W6632745820","https://openalex.org/W6668354557"],"related_works":["https://openalex.org/W2963283598","https://openalex.org/W2057663649","https://openalex.org/W3215981430","https://openalex.org/W9164568","https://openalex.org/W1856060541","https://openalex.org/W2561829717","https://openalex.org/W2611025373","https://openalex.org/W2072075503","https://openalex.org/W2136767512","https://openalex.org/W1489487975"],"abstract_inverted_index":{"We":[0,150],"present":[1],"an":[2,115],"approach":[3,154],"for":[4,23,26,32,48,95,174],"the":[5,39,44,74,118,122,131,135,146,168],"verification":[6],"of":[7,38,58,89,117,134,170],"Erlang":[8,176],"programs":[9],"using":[10],"abstract":[11,29,75,98],"interpretation":[12],"and":[13,105,158,172],"model":[14,71,106],"checking.":[15],"In":[16,110],"previous":[17],"work":[18],"we":[19,100,113],"defined":[20],"a":[21,59,79,156],"framework":[22,34],"data":[24],"abstraction":[25,45,116],"Erlang.":[27],"An":[28],"operational":[30,41,76],"semantics":[31,77],"this":[33,111,153],"preserves":[35],"all":[36,49,56],"paths":[37,57],"standard":[40],"semantics.":[42],"Hence,":[43],"is":[46,78,108],"safe":[47],"properties":[50,62,163],"that":[51],"have":[52,151],"to":[53,130,145,161],"hold":[54],"on":[55],"system,":[60],"like":[61,164],"in":[63,125],"LTL.":[64],"The":[65,138],"proof":[66],"can":[67],"be":[68,86],"automated":[69],"with":[70],"checking":[72,107],"if":[73],"finite":[80,96],"transition":[81],"system.":[82],"But":[83],"finiteness":[84],"cannot":[85],"guaranteed":[87],"because":[88],"non-tail":[90,126],"recursive":[91,123],"function":[92],"calls.":[93],"Even":[94],"domain":[97],"interpretations":[99],"get":[101],"infinite":[102],"state":[103],"systems":[104],"undecidable.":[109],"paper":[112],"formalize":[114],"control-flow.":[119],"It":[120],"replaces":[121],"calls":[124],"positions":[127],"by":[128,143],"jumps":[129,144],"last":[132],"call":[133],"same":[136],"function.":[137],"corresponding":[139],"returns":[140],"are":[141,159],"replaced":[142],"possible":[147],"return":[148],"points.":[149],"implemented":[152],"as":[155],"prototype":[157],"able":[160],"prove":[162],"mutual":[165],"exclusion":[166],"or":[167],"absence":[169],"deadlocks":[171],"lifelocks":[173],"some":[175],"programs.":[177]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}