{"id":"https://openalex.org/W1987662616","doi":"https://doi.org/10.1017/s1471068411000299","title":"Constraint-based deadlock checking of high-level specifications","display_name":"Constraint-based deadlock checking of high-level specifications","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W1987662616","doi":"https://doi.org/10.1017/s1471068411000299","mag":"1987662616"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068411000299","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068411000299","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1109.2015","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000759525","display_name":"Stefan Hallerstede","orcid":"https://orcid.org/0000-0001-9952-0214"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"STEFAN HALLERSTEDE","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t D\u00fcsseldorf, Universit\u00e4tsstr. 1, D-40225 D\u00fcsseldorf, Germany (e-mail:","Universit\u00e4t D\u00fcsseldorf"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t D\u00fcsseldorf, Universit\u00e4tsstr. 1, D-40225 D\u00fcsseldorf, Germany (e-mail:","institution_ids":["https://openalex.org/I44260953"]},{"raw_affiliation_string":"Universit\u00e4t D\u00fcsseldorf","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058847017","display_name":"Micha\u00ebl Leuschel","orcid":"https://orcid.org/0000-0002-4595-1518"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"MICHAEL LEUSCHEL","raw_affiliation_strings":["Institut f\u00fcr Informatik, Universit\u00e4t D\u00fcsseldorf, Universit\u00e4tsstr. 1, D-40225 D\u00fcsseldorf, Germany (e-mail:","Universit\u00e4t D\u00fcsseldorf"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Universit\u00e4t D\u00fcsseldorf, Universit\u00e4tsstr. 1, D-40225 D\u00fcsseldorf, Germany (e-mail:","institution_ids":["https://openalex.org/I44260953"]},{"raw_affiliation_string":"Universit\u00e4t D\u00fcsseldorf","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000759525"],"corresponding_institution_ids":["https://openalex.org/I44260953"],"apc_list":null,"apc_paid":null,"fwci":0.3252,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5850142,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"11","issue":"4-5","first_page":"767","last_page":"782"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9987999796867371,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.7638214826583862},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.7127487063407898},{"id":"https://openalex.org/keywords/reification","display_name":"Reification (Marxism)","score":0.626940906047821},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5649968385696411},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.5365825295448303},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5054075717926025},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4993569850921631},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4447001814842224},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44088274240493774},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.42634284496307373},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34402623772621155},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31666862964630127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15041512250900269}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7638214826583862},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7127487063407898},{"id":"https://openalex.org/C201377581","wikidata":"https://www.wikidata.org/wiki/Q863448","display_name":"Reification (Marxism)","level":3,"score":0.626940906047821},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5649968385696411},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5365825295448303},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5054075717926025},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4993569850921631},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4447001814842224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44088274240493774},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.42634284496307373},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34402623772621155},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31666862964630127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15041512250900269},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s1471068411000299","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068411000299","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1109.2015","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1109.2015","pdf_url":"https://arxiv.org/pdf/1109.2015","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/6027a8ab-2192-444c-8e9f-0d5461294497","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/6027a8ab-2192-444c-8e9f-0d5461294497","pdf_url":"http://arxiv.org/pdf/1109.2015v1.pdf","source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hallerstede, S & Leuschel, M 2011, 'Constraint-based deadlock checking of high-level specifications', Theory and Practice of Logic Programming, vol. 11, no. 4-5, pp. 767-782. https://doi.org/10.1017/S1471068411000299","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:1987662616","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1109.2015","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.764.8919","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.764.8919","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1109.2015.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.1109.2015","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1109.2015","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1109.2015","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1109.2015","pdf_url":"https://arxiv.org/pdf/1109.2015","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.699999988079071}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488396078","https://openalex.org/W1518705996","https://openalex.org/W1519503479","https://openalex.org/W1559870885","https://openalex.org/W1586167239","https://openalex.org/W1794553731","https://openalex.org/W1946627845","https://openalex.org/W1971486022","https://openalex.org/W2012741612","https://openalex.org/W2027319813","https://openalex.org/W2031111226","https://openalex.org/W2060440626","https://openalex.org/W2125047630","https://openalex.org/W2132609258","https://openalex.org/W2151926351","https://openalex.org/W3142790043","https://openalex.org/W4234528212","https://openalex.org/W4244819751","https://openalex.org/W4254354208"],"related_works":["https://openalex.org/W2898242299","https://openalex.org/W2394951157","https://openalex.org/W168271757","https://openalex.org/W3151650766","https://openalex.org/W1574792064","https://openalex.org/W2337451582","https://openalex.org/W2055472132","https://openalex.org/W2407940323","https://openalex.org/W1575212675","https://openalex.org/W2007866490","https://openalex.org/W2126943265","https://openalex.org/W1463980502","https://openalex.org/W2340371952","https://openalex.org/W2167083280","https://openalex.org/W1242727906","https://openalex.org/W3137070212","https://openalex.org/W318315784","https://openalex.org/W2035446791","https://openalex.org/W2283246674","https://openalex.org/W3210042765"],"abstract_inverted_index":{"Abstract":[0],"Establishing":[1],"the":[2,40,48,114],"absence":[3],"of":[4,11,16,70,122],"deadlocks":[5,21,38],"is":[6,25],"important":[7],"in":[8,22],"many":[9],"applications":[10,121],"formal":[12,23],"methods.":[13],"The":[14],"use":[15],"model":[17],"checking":[18],"for":[19],"finding":[20,37],"models":[24],"often":[26],"limited.":[27],"In":[28,113],"this":[29,96,123],"paper,":[30,115],"we":[31,116],"propose":[32],"a":[33,85,91],"constraint-based":[34],"approach":[35],"to":[36,58,104,108],"employing":[39],"P":[41,62,99],"ro":[42,63,100],"B":[43,101],"constraint":[44],"solver.":[45],"We":[46],"present":[47,118],"general":[49],"technique,":[50],"as":[51,53,68],"well":[52],"various":[54],"improvements":[55],"that":[56],"had":[57],"be":[59],"performed":[60],"on":[61,132],"B's":[64],"Prolog":[65],"kernel,":[66],"such":[67],"reification":[69],"membership":[71],"and":[72,129],"arithmetic":[73],"constraints.":[74,112],"This":[75],"work":[76],"was":[77,89,102],"guided":[78],"by":[79],"an":[80],"industrial":[81],"case":[82,97],"study,":[83,98],"where":[84],"team":[86],"from":[87],"Bosch":[88],"modelling":[90],"cruise":[92],"control":[93],"system.":[94],"Within":[95],"able":[103],"quickly":[105],"find":[106],"counterexamples":[107],"very":[109],"large":[110],"deadlock-freedom":[111],"also":[117],"other":[119],"successful":[120],"new":[124],"technique.":[125],"Experiments":[126],"using":[127],"SAT":[128],"SMT":[130],"solvers":[131],"these":[133],"constraints":[134],"were":[135],"thus":[136],"far":[137],"unsuccessful.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}