{"id":"https://openalex.org/W4312770902","doi":"https://doi.org/10.2298/csis210908058p","title":"Complete formal verification of the PSTM transaction Scheduler","display_name":"Complete formal verification of the PSTM transaction Scheduler","publication_year":2022,"publication_date":"2022-12-23","ids":{"openalex":"https://openalex.org/W4312770902","doi":"https://doi.org/10.2298/csis210908058p"},"language":"en","primary_location":{"id":"doi:10.2298/csis210908058p","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis210908058p","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02142200058P","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"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":"Computer Science and Information Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02142200058P","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074956004","display_name":"Miroslav Popovi\u0107","orcid":"https://orcid.org/0000-0001-8385-149X"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Miroslav Popovic","raw_affiliation_strings":["University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102991154","display_name":"Marko Popovi\u0107","orcid":"https://orcid.org/0000-0002-1957-0092"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Marko Popovic","raw_affiliation_strings":["University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069129540","display_name":"Branislav Kordic","orcid":null},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Branislav Kordic","raw_affiliation_strings":["University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Faculty of Technical Sciences, Trg D. Obradovica 6, 21000 Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102937444","display_name":"Huibiao Zhu","orcid":"https://orcid.org/0000-0002-0214-8565"},"institutions":[{"id":"https://openalex.org/I4210139618","display_name":"Shanghai Key Laboratory of Trustworthy Computing","ror":"https://ror.org/030qbr085","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210139618"]},{"id":"https://openalex.org/I66867065","display_name":"East China Normal University","ror":"https://ror.org/02n96ep67","country_code":"CN","type":"education","lineage":["https://openalex.org/I66867065"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huibiao Zhu","raw_affiliation_strings":["East China Normal University, Shanghai Key Laboratory of Trustworthy Computing, Shanghai, China","East China Normal University, Shanghai Key Laboratory of Trustworthy Computing, Shanghai 200062, China"],"affiliations":[{"raw_affiliation_string":"East China Normal University, Shanghai Key Laboratory of Trustworthy Computing, Shanghai, China","institution_ids":["https://openalex.org/I4210139618","https://openalex.org/I66867065"]},{"raw_affiliation_string":"East China Normal University, Shanghai Key Laboratory of Trustworthy Computing, Shanghai 200062, China","institution_ids":["https://openalex.org/I4210139618","https://openalex.org/I66867065"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074956004"],"corresponding_institution_ids":["https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":0.1509,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53084309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"20","issue":"1","first_page":"307","last_page":"327"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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.9973000288009644,"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9772999882698059,"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.9033068418502808},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7569351196289062},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.6399720907211304},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.5627679228782654},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5148969888687134},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4883958697319031},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48267558217048645},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.4610961675643921},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.45506900548934937},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4278087019920349},{"id":"https://openalex.org/keywords/two-phase-locking","display_name":"Two-phase locking","score":0.4226917326450348},{"id":"https://openalex.org/keywords/abstract-state-machines","display_name":"Abstract state machines","score":0.41376838088035583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3595336675643921},{"id":"https://openalex.org/keywords/transaction-processing","display_name":"Transaction processing","score":0.2703116536140442},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2481740415096283},{"id":"https://openalex.org/keywords/distributed-transaction","display_name":"Distributed transaction","score":0.17857453227043152},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.16212064027786255},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.0914556086063385}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9033068418502808},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7569351196289062},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.6399720907211304},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.5627679228782654},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5148969888687134},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4883958697319031},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48267558217048645},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.4610961675643921},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.45506900548934937},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4278087019920349},{"id":"https://openalex.org/C131346163","wikidata":"https://www.wikidata.org/wiki/Q2290484","display_name":"Two-phase locking","level":5,"score":0.4226917326450348},{"id":"https://openalex.org/C145243422","wikidata":"https://www.wikidata.org/wiki/Q333385","display_name":"Abstract state machines","level":3,"score":0.41376838088035583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3595336675643921},{"id":"https://openalex.org/C72108876","wikidata":"https://www.wikidata.org/wiki/Q844565","display_name":"Transaction processing","level":3,"score":0.2703116536140442},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2481740415096283},{"id":"https://openalex.org/C25185021","wikidata":"https://www.wikidata.org/wiki/Q4053284","display_name":"Distributed transaction","level":4,"score":0.17857453227043152},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.16212064027786255},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0914556086063385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.2298/csis210908058p","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis210908058p","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02142200058P","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"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":"Computer Science and Information Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.2298/csis210908058p","is_oa":true,"landing_page_url":"https://doi.org/10.2298/csis210908058p","pdf_url":"http://www.doiserbia.nb.rs/ft.aspx?id=1820-02142200058P","source":{"id":"https://openalex.org/S206939107","display_name":"Computer Science and Information Systems","issn_l":"1820-0214","issn":["1820-0214","2406-1018"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310321031","host_organization_name":"ComSIS Consortium","host_organization_lineage":["https://openalex.org/P4310321031"],"host_organization_lineage_names":["ComSIS Consortium"],"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":"Computer Science and Information Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7793660444","display_name":null,"funder_award_id":"451-03-68/2020-14/200156","funder_id":"https://openalex.org/F4320322349","funder_display_name":"Ministry of Education, Science and Technology"},{"id":"https://openalex.org/G832876765","display_name":null,"funder_award_id":"451-03-68/2020-14/200156","funder_id":"https://openalex.org/F4320322729","funder_display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja"}],"funders":[{"id":"https://openalex.org/F4320322349","display_name":"Ministry of Education, Science and Technology","ror":"https://ror.org/01p262204"},{"id":"https://openalex.org/F4320322729","display_name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","ror":"https://ror.org/01znas443"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4312770902.pdf","grobid_xml":"https://content.openalex.org/works/W4312770902.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1962072139","https://openalex.org/W1966697570","https://openalex.org/W1996474245","https://openalex.org/W2089949269","https://openalex.org/W2092911542","https://openalex.org/W2095935151","https://openalex.org/W2101508170","https://openalex.org/W2165791323","https://openalex.org/W2171901032","https://openalex.org/W2940339287","https://openalex.org/W2968880850","https://openalex.org/W2990020358","https://openalex.org/W2990717276","https://openalex.org/W2991395850","https://openalex.org/W3006825821","https://openalex.org/W3165073743","https://openalex.org/W4244083566","https://openalex.org/W4298077439","https://openalex.org/W4366707295"],"related_works":["https://openalex.org/W2006962382","https://openalex.org/W2151814790","https://openalex.org/W106083450","https://openalex.org/W2139310586","https://openalex.org/W3091728393","https://openalex.org/W3087808993","https://openalex.org/W2982469106","https://openalex.org/W2741430969","https://openalex.org/W3166613042","https://openalex.org/W2128968331"],"abstract_inverted_index":{"State":[0],"of":[1,57,79,106,129,139],"the":[2,75,85,91,97,104,113,121,127,130,137,140],"art":[3],"formal":[4,9,42,55,63,66],"verification":[5,56,64],"is":[6,14,44],"based":[7],"on":[8],"methods":[10,43],"and":[11,33,65,111],"its":[12],"goal":[13],"proving":[15],"given":[16,98],"correctness":[17],"properties.":[18],"For":[19],"example,":[20,71],"a":[21,53],"PSTM":[22,80,131],"scheduler":[23,82],"was":[24],"modeled":[25],"in":[26,28,48],"CSP":[27,77,114,123],"order":[29],"to":[30,103],"prove":[31],"deadlock-freeness":[32],"starvation-freeness.":[34],"However,":[35],"as":[36],"this":[37,49,107],"paper":[38,50],"shows,":[39],"using":[40,117],"solely":[41],"not":[45],"sufficient.":[46],"Therefore,":[47],"we":[51,72,109,125],"propose":[52],"complete":[54],"trustworthy":[58],"software,":[59],"which":[60],"jointly":[61],"uses":[62],"model":[67,78,86],"testing.":[68],"As":[69],"an":[70],"first":[73],"test":[74,99],"previous":[76],"transaction":[81,133],"by":[83],"comparing":[84],"checker":[87],"PAT":[88,118],"results":[89,105,119],"with":[90],"manually":[92],"derived":[93],"expected":[94],"results,":[95],"for":[96,120],"workloads.":[100],"Next,":[101],"according":[102],"testing,":[108],"correct":[110],"extend":[112],"model.":[115],"Finally,":[116],"new":[122],"model,":[124],"analyze":[126],"performance":[128],"online":[132],"scheduling":[134],"algorithms":[135],"from":[136],"perspective":[138],"relative":[141],"speedup.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}