{"id":"https://openalex.org/W1514446453","doi":"https://doi.org/10.1007/3-540-44585-4_30","title":"A BDD-Based Model Checker for Recursive Programs","display_name":"A BDD-Based Model Checker for Recursive Programs","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1514446453","doi":"https://doi.org/10.1007/3-540-44585-4_30","mag":"1514446453"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-44585-4_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44585-4_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5090378914","display_name":"Javier Esparza","orcid":"https://orcid.org/0000-0001-9862-4919"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Javier Esparza","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, x80290, M\u00fcnchen, Germany","[Technische Universit\u00e4t, M\u00fcnchen]"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, x80290, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"[Technische Universit\u00e4t, M\u00fcnchen]","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040146683","display_name":"Stefan Schwoon","orcid":"https://orcid.org/0000-0001-6622-6510"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Schwoon","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, x80290, M\u00fcnchen, Germany","[Technische Universit\u00e4t, M\u00fcnchen]"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, Arcisstr. 21, x80290, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"[Technische Universit\u00e4t, M\u00fcnchen]","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090378914"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":10.4838,"has_fulltext":false,"cited_by_count":159,"citation_normalized_percentile":{"value":0.98583911,"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":"324","last_page":"336"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9991999864578247,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/model-checking","display_name":"Model checking","score":0.8101000785827637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7550157308578491},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.728795051574707},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6100987195968628},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5226435661315918},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5208507180213928},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4993600845336914},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48355862498283386},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4721646010875702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4337165355682373},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.4163901209831238},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.41557109355926514},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.28737372159957886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17591309547424316}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8101000785827637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7550157308578491},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.728795051574707},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6100987195968628},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5226435661315918},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5208507180213928},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4993600845336914},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48355862498283386},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4721646010875702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4337165355682373},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.4163901209831238},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.41557109355926514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28737372159957886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17591309547424316},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-44585-4_30","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-44585-4_30","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1491036809","https://openalex.org/W1514446453","https://openalex.org/W1589224558","https://openalex.org/W1691700263","https://openalex.org/W1827592073","https://openalex.org/W2032304805","https://openalex.org/W2089139117","https://openalex.org/W2099120582","https://openalex.org/W2118382442","https://openalex.org/W4230796557"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W2763487042","https://openalex.org/W2521108391","https://openalex.org/W1532447905","https://openalex.org/W2031188261","https://openalex.org/W3021103820","https://openalex.org/W4285022830","https://openalex.org/W4232446061","https://openalex.org/W2077520193","https://openalex.org/W1513400763"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}