{"id":"https://openalex.org/W2945420580","doi":"https://doi.org/10.1007/s00165-019-00483-2","title":"Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving","display_name":"Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving","publication_year":2019,"publication_date":"2019-05-14","ids":{"openalex":"https://openalex.org/W2945420580","doi":"https://doi.org/10.1007/s00165-019-00483-2","mag":"2945420580"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-019-00483-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00165-019-00483-2.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00165-019-00483-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012870378","display_name":"Pedro Antonino","orcid":"https://orcid.org/0000-0002-5627-0910"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Pedro Antonino","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012851566","display_name":"Thomas Gibson\u2212Robinson","orcid":"https://orcid.org/0000-0002-7330-6348"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Gibson-Robinson","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045639409","display_name":"A. W. Roscoe","orcid":"https://orcid.org/0000-0001-7557-3901"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. W. Roscoe","raw_affiliation_strings":["Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.33,"has_fulltext":true,"fulltext_origin":"pdf","cited_by_count":2,"citation_normalized_percentile":{"value":0.536931,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":74},"biblio":{"volume":"31","issue":"3","first_page":"375","last_page":"409"},"is_retracted":false,"is_paratext":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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9988,"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"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9979,"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/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.68474036},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.67863715}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.90874594},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.81601423},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.68474036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.67904943},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.67863715},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4625584},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3385387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33142102},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2919873},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27865785}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-019-00483-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00165-019-00483-2.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-019-00483-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00165-019-00483-2.pdf","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Peace, justice, and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.78}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":59,"referenced_works":["https://openalex.org/W104820789","https://openalex.org/W125598877","https://openalex.org/W1528441743","https://openalex.org/W1546941278","https://openalex.org/W1560567486","https://openalex.org/W1570105559","https://openalex.org/W160854871","https://openalex.org/W1702401680","https://openalex.org/W1787074469","https://openalex.org/W1811414983","https://openalex.org/W1882160752","https://openalex.org/W1890639535","https://openalex.org/W1897228115","https://openalex.org/W1934074768","https://openalex.org/W1967338579","https://openalex.org/W1968552123","https://openalex.org/W1982129592","https://openalex.org/W1983572666","https://openalex.org/W1984831616","https://openalex.org/W1995736448","https://openalex.org/W2021473546","https://openalex.org/W2032953639","https://openalex.org/W2047375390","https://openalex.org/W2061438988","https://openalex.org/W2104703296","https://openalex.org/W2105180288","https://openalex.org/W2107978495","https://openalex.org/W2118229393","https://openalex.org/W2121047005","https://openalex.org/W2123401374","https://openalex.org/W2128510433","https://openalex.org/W2129384397","https://openalex.org/W2130851407","https://openalex.org/W2132334337","https://openalex.org/W2133527541","https://openalex.org/W2136604606","https://openalex.org/W2140606557","https://openalex.org/W2147077520","https://openalex.org/W2153908731","https://openalex.org/W2158395308","https://openalex.org/W2159031014","https://openalex.org/W2168748468","https://openalex.org/W2197195447","https://openalex.org/W2294580796","https://openalex.org/W2337451582","https://openalex.org/W2345401972","https://openalex.org/W2529513861","https://openalex.org/W2530434195","https://openalex.org/W2548863071","https://openalex.org/W2600980051","https://openalex.org/W2763389838","https://openalex.org/W2767230972","https://openalex.org/W2767904835","https://openalex.org/W2782532010","https://openalex.org/W297378017","https://openalex.org/W3101694643","https://openalex.org/W3144368627","https://openalex.org/W3160274653","https://openalex.org/W78552530"],"related_works":["https://openalex.org/W4361186044","https://openalex.org/W3021535722","https://openalex.org/W2945420580","https://openalex.org/W2552031328","https://openalex.org/W2546571730","https://openalex.org/W2395244651","https://openalex.org/W2307448499","https://openalex.org/W2103672915","https://openalex.org/W2078614932","https://openalex.org/W2052041295"],"abstract_inverted_index":{"Abstract":[0],"This":[1,92,149],"work":[2],"develops":[3],"a":[4,24,41,56,115,153],"type":[5],"of":[6,23,29,33,36,47,98,155],"local":[7,26],"analysis":[8,27],"that":[9,62,87,113],"can":[10,105,131],"prove":[11],"concurrent":[12],"systems":[13,112],"deadlock":[14,64,78],"free.":[15],"As":[16],"opposed":[17],"to":[18,39,50,134],"examining":[19,30],"the":[20,31,37,96],"overall":[21],"behaviour":[22,32],"system,":[25],"consists":[28],"small":[34],"parts":[35],"system":[38,52,85],"yield":[40],"given":[42],"property.":[43],"We":[44],"analyse":[45],"pairs":[46],"interacting":[48],"components":[49],"approximate":[51,100,123],"reachability":[53,71],"and":[54,65],"propose":[55],"new":[57],"sound":[58],"but":[59],"incomplete/approximate":[60],"framework":[61],"checks":[63],"local-deadlock":[66],"freedom.":[67],"By":[68],"replacing":[69],"exact":[70],"by":[72,121,152],"this":[73],"approximation,":[74],"it":[75,104],"looks":[76],"for":[77,146],"(or":[79],"local-deadlock)":[80],"candidates,":[81],"namely,":[82,110],"blocked":[83],"(locally-blocked)":[84],"states":[86],"lie":[88],"within":[89],"our":[90,137],"approximation.":[91],"characterisation":[93],"improves":[94],"on":[95],"precision":[97],"current":[99,144],"techniques.":[101,124],"In":[102],"particular,":[103],"tackle":[106],"non-hereditary":[107],"deadlock-free":[108,111],"systems,":[109],"have":[114],"deadlocking":[116],"subsystem.":[117],"These":[118],"are":[119],"neglected":[120],"most":[122],"Furthermore,":[125],"we":[126],"demonstrate":[127],"how":[128],"SAT":[129],"checkers":[130],"be":[132],"used":[133],"efficiently":[135],"implement":[136],"framework,":[138],"which,":[139],"typically,":[140],"scales":[141],"better":[142],"than":[143],"techniques":[145],"deadlock-freedom":[147],"analysis.":[148],"is":[150],"demonstrated":[151],"series":[154],"practical":[156],"experiments.":[157]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2945420580","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2024-12-09T06:59:14.729155","created_date":"2019-05-29"}
