{"id":"https://openalex.org/W2171982732","doi":"https://doi.org/10.1016/j.scico.2010.03.004","title":"Deadlock and starvation free reentrant readers\u2013writers: A case study combining model checking with theorem proving","display_name":"Deadlock and starvation free reentrant readers\u2013writers: A case study combining model checking with theorem proving","publication_year":2010,"publication_date":"2010-06-17","ids":{"openalex":"https://openalex.org/W2171982732","doi":"https://doi.org/10.1016/j.scico.2010.03.004","mag":"2171982732"},"language":"en","primary_location":{"id":"doi:10.1016/j.scico.2010.03.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.scico.2010.03.004","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-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/A5020172219","display_name":"Bernard van Gastel","orcid":"https://orcid.org/0000-0002-0974-4634"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bernard van Gastel","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038997447","display_name":"Leonard Lensink","orcid":"https://orcid.org/0000-0002-2400-2532"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Leonard Lensink","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042479410","display_name":"Sjaak Smetsers","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Sjaak Smetsers","raw_affiliation_strings":["Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112510889","display_name":"Marko van Eekelen","orcid":null},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]},{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Marko van Eekelen","raw_affiliation_strings":["School of Computer Science, Open University of the Netherlands, Netherlands","Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Open University of the Netherlands, Netherlands","institution_ids":["https://openalex.org/I7876267"]},{"raw_affiliation_string":"Institute for Computing and Information Sciences, Radboud University Nijmegen, Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112510889"],"corresponding_institution_ids":["https://openalex.org/I145872427","https://openalex.org/I7876267"],"apc_list":{"value":2460,"currency":"USD","value_usd":2460},"apc_paid":null,"fwci":0.3383,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65241636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"76","issue":"2","first_page":"82","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9955000281333923,"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"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9950000047683716,"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/computer-science","display_name":"Computer science","score":0.8513676524162292},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.8255091905593872},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7909930944442749},{"id":"https://openalex.org/keywords/reentrancy","display_name":"Reentrancy","score":0.7876567840576172},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7782384157180786},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7518129944801331},{"id":"https://openalex.org/keywords/nesting","display_name":"Nesting (process)","score":0.6700443029403687},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.502763032913208},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.48802676796913147},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46839022636413574},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4324706196784973},{"id":"https://openalex.org/keywords/atomicity","display_name":"Atomicity","score":0.43195152282714844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3780706524848938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3398595154285431}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8513676524162292},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.8255091905593872},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7909930944442749},{"id":"https://openalex.org/C161406801","wikidata":"https://www.wikidata.org/wiki/Q963635","display_name":"Reentrancy","level":2,"score":0.7876567840576172},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7782384157180786},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7518129944801331},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.6700443029403687},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.502763032913208},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.48802676796913147},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46839022636413574},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4324706196784973},{"id":"https://openalex.org/C188045909","wikidata":"https://www.wikidata.org/wiki/Q3306359","display_name":"Atomicity","level":3,"score":0.43195152282714844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3780706524848938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3398595154285431},{"id":"https://openalex.org/C191897082","wikidata":"https://www.wikidata.org/wiki/Q11467","display_name":"Metallurgy","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1016/j.scico.2010.03.004","is_oa":false,"landing_page_url":"https://doi.org/10.1016/j.scico.2010.03.004","pdf_url":null,"source":{"id":"https://openalex.org/S21029587","display_name":"Science of Computer Programming","issn_l":"0167-6423","issn":["0167-6423","1872-7964"],"is_oa":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Science of Computer Programming","raw_type":"journal-article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/91697","is_oa":false,"landing_page_url":"https://hdl.handle.net/2066/91697","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"},{"id":"pmh:oai:research.ou.nl:publications/08215e4f-d5ad-41f3-b13c-947b8ce89211","is_oa":false,"landing_page_url":"https://hdl.handle.net/1820/08215e4f-d5ad-41f3-b13c-947b8ce89211","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van Gastel, B, Lensink, L, Smetsers, S & van Eekelen, M 2011, 'Deadlock and starvation free reentrant readers-writers : A case study combining model checking with theorem proving', Science of Computer Programming, vol. 76, no. 2, pp. 82-99. https://doi.org/10.1016/j.scico.2010.03.004","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ou:oai:research.ou.nl:publications/08215e4f-d5ad-41f3-b13c-947b8ce89211","is_oa":false,"landing_page_url":"https://research.ou.nl/en/publications/08215e4f-d5ad-41f3-b13c-947b8ce89211","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Science of Computer Programming, 76(2), 82 - 99. ELSEVIER SCIENCE BV","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/91697","is_oa":false,"landing_page_url":"http://hdl.handle.net/2066/91697","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Science of Computer Programming, 76, 82 - 99","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W26772505","https://openalex.org/W55478891","https://openalex.org/W68069235","https://openalex.org/W125251596","https://openalex.org/W186537607","https://openalex.org/W1496007014","https://openalex.org/W1508641834","https://openalex.org/W1513642085","https://openalex.org/W1534850143","https://openalex.org/W1555745065","https://openalex.org/W1557413934","https://openalex.org/W1583645201","https://openalex.org/W1593428110","https://openalex.org/W1607393381","https://openalex.org/W1777881387","https://openalex.org/W1825148885","https://openalex.org/W1901596531","https://openalex.org/W1943502734","https://openalex.org/W1945466999","https://openalex.org/W1964064807","https://openalex.org/W2000947342","https://openalex.org/W2040060046","https://openalex.org/W2049764332","https://openalex.org/W2054554282","https://openalex.org/W2067611638","https://openalex.org/W2079680418","https://openalex.org/W2106192381","https://openalex.org/W2114800129","https://openalex.org/W2135274583","https://openalex.org/W2139398459","https://openalex.org/W2158209653","https://openalex.org/W2167699088","https://openalex.org/W2171480813","https://openalex.org/W2501364339","https://openalex.org/W2531523631","https://openalex.org/W2531818755","https://openalex.org/W2601354821","https://openalex.org/W4249839281","https://openalex.org/W4285719527","https://openalex.org/W6602259970","https://openalex.org/W6631954194","https://openalex.org/W6633166845","https://openalex.org/W6634904388","https://openalex.org/W6635435973","https://openalex.org/W6638034302","https://openalex.org/W6638752316","https://openalex.org/W6640576659","https://openalex.org/W6677210373","https://openalex.org/W6681194197","https://openalex.org/W6684686101"],"related_works":["https://openalex.org/W1591836442","https://openalex.org/W2357517130","https://openalex.org/W1990697576","https://openalex.org/W1520405624","https://openalex.org/W1582361381","https://openalex.org/W2001866549","https://openalex.org/W1600422503","https://openalex.org/W2150253789","https://openalex.org/W1607393381","https://openalex.org/W2171982732"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2016-06-24T00:00:00"}