[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_byId_2a04166a-016e-48f6-81ea-42159ef2c685":3,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:2a04166a-016e-48f6-81ea-42159ef2c685,\"}":189},{"code":4,"data":5,"meta":20},"SUCCESS",{"id":6,"createTime":7,"updateTime":8,"relativeEntities":9,"slug":10,"properties":11,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":22,"manageAffiliations":39,"indexDatabases":64,"url":104,"thumbnailPath":20,"statistic":105,"gsStatistic":20,"type":188,"analyzePriority":20},"2a04166a-016e-48f6-81ea-42159ef2c685","2024-04-11T05:40:59.863+00:00","2025-11-21T09:57:07.863+00:00",[],"International-Journal-on-Software-Tools-for-Technology-Transfer",{"issn":12,"eissn":14,"title":16},{"VOID":13},"1433-2787",{"VOID":15},"1433-2779",{"EN":17},"International Journal on Software Tools for Technology Transfer","PUBLISHER","PENDING",null,0,[23,31],{"id":24,"createTime":25,"updateTime":26,"relativeEntities":27,"label":28,"description":30,"parentId":20,"standard":20,"scholarHubFieldId":20},"c41bb0c4-b86d-4bd6-ac06-d1efed5edcce","2023-05-29T10:24:12.280+00:00","2023-11-21T07:21:58.105+00:00",[],{"EN":29},"Information Systems",{},{"id":32,"createTime":33,"updateTime":34,"relativeEntities":35,"label":36,"description":38,"parentId":20,"standard":20,"scholarHubFieldId":20},"aae089e7-8b62-4df4-ab86-aada3693b3f8","2023-05-29T10:24:07.736+00:00","2023-11-21T07:29:12.850+00:00",[],{"EN":37},"Software",{},[40,53],{"id":41,"createTime":42,"updateTime":43,"relativeEntities":44,"slug":45,"properties":46,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":50,"url":20,"parentIds":51,"statistic":20},"6b6d67d8-1887-4ca8-86c5-a38f66f10928","2023-05-29T10:24:09.947+00:00","2025-11-21T10:07:51.595+00:00",[],"Springer-Verlag",{"title":47},{"EN":48},"Springer Verlag","AFFILIATION",12,[52],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",{"id":54,"createTime":55,"updateTime":56,"relativeEntities":57,"slug":58,"properties":59,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":62,"url":20,"parentIds":63,"statistic":20},"869fc292-62ea-48f4-960e-51fea58b02ba","2023-05-29T10:24:53.274+00:00","2024-02-20T18:47:04.755+00:00",[],"Springer-Heidelberg",{"title":60},{"EN":61},"Springer Heidelberg",9,[52],[65,84],{"id":66,"indexDatabase":67,"url":81,"indexYears":20,"academicFieldIds":82,"indexDatabaseRanking":20},"f17ba76d-d4cd-4fc7-b334-7f8b4651bdf8",{"id":68,"createTime":69,"updateTime":70,"relativeEntities":71,"label":72,"description":74,"key":77,"publicationTags":78,"standard":20},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":73,"VI":73},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":75,"EN":76},"Cơ sở dữ liệu SCIE","SCIE database","scie",[79,80],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=1433-2779",[83],"213b6fd5-fb87-42bb-b348-eda0690eebc4",{"id":85,"indexDatabase":86,"url":98,"indexYears":99,"academicFieldIds":100,"indexDatabaseRanking":103},"01e353e7-b05e-4589-b8a7-b985fa0cd78f",{"id":87,"createTime":88,"updateTime":89,"relativeEntities":90,"label":91,"description":93,"key":95,"publicationTags":96,"standard":20},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":92,"VI":92},"Scopus - Elsevier",{"EN":92,"VI":94},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[97],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F19271","1997-2025",[101,102],"499fd762-4414-45c1-b2b3-cc8d2abe204b","f8ab36fc-bc72-48f2-a425-9f3e042f2272","SCOPUS__Q1","https:\u002F\u002Flink.springer.com\u002Fjournal\u002F10009",{"impactFactor":21,"impactFactorByYear":106,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":121,"totalCitation":139,"totalCitationByYear":140,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":163,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},0.32,0.46,0.45,0.11,0.22,0.58,0.78,0.55,0.48,0.5,0.25,74,8,665,{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},15,23,25,26,28,29,33,27,30,36,40,24,16,32,31,35,10,2633,{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},82,37,44,106,495,149,51,76,210,271,175,63,259,19,81,147,87,21,98,22,1,3.96,{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},5.47,4.62,2.93,4.61,19.8,5.73,1.82,3.3,7.24,10.42,5.3,2.33,8.63,1.04,0.53,1.58,3.38,5.07,5.44,0.88,3.06,0.61,0.86,0.1,"JOURNAL",{"meta":190,"data":192},{"total":191},"667",[193,304,443,546,789,900,1031,1142,1275,1387],{"id":194,"createTime":195,"updateTime":195,"relativeEntities":196,"slug":20,"properties":197,"entityType":206,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":207,"fullTextUrl":20,"authors":208,"publicationType":266,"publisherRelationship":267,"citationCount":20,"citationInfo":20,"publishDate":301,"publishYear":302,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"82683424-af39-40e6-bdf3-02b8048f9514","2023-12-27T23:58:51.709+00:00",[],{"references":198,"abstract":200,"title":202,"doi":204},{"VOID":199},"Afek Y., Attiya H., Fekete A., Fischer M., Lynch N., Mansour Y., Wang D.-W., Zuck L.: Reliable communication over unreliable channels. J. ACM 41(6), 1267–1297 (1994)\nApt K.R., Francez N., Katz S.: Appraising fairness in languages for distributed programming. Distrib. Comput. 2, 226–241 (1988)\nBarghouti N., Nounou N., Yemini Y.: An integrated protocol development environment. In: Protocol Specification Testing and Verification VI, pp. 63–69. North-Holland, Amsterdam (1987)\nBehrmann G., David A., Larsen K.G.: A tutorial on UPPAAL. In: Proceedings of the 4th International School on Formal Methods for the Design of Computer, Communication, and Software Systems (SFM-RT’04). LNCS, vol. 3185, pp. 200–236. Springer, Berlin (2004)\nBrand D., Zafiropulo P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)\nFinkel A.: Decidability of the termination problem for completely specified protocols. Distrib. Comput. 7, 129–135 (1994)\nGray J., Reuter A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, Menlo Park (1993)\nGreenfield P., Kuo D., Nepal S., Fekete A.: Consistency for web services applications. In: VLDB ’05: proceedings of the 31st international conference on very large data bases, pp. 1199–1203. VLDB Endowment (2005)\nJohnson J.E., Langworthy D.E., Lamport L., Vogt F.H.: Formal specification of a web services protocol. J. Logic. Algebraic Program. 70(1), 34–52 (2007)\nLamport L.: Specifying Systems. Addison-Wesley, Reading (2003)\nLohmann N.: Communication models for services. In: Proceedings of ZEUS’10, vol. 563 of CEUR Workshop Proceedings, pp. 9–16. CEUR-WS.org (2010)\nMarques A.P. Jr., Ravn A.P., Srba J., Vighio S.: Tool supported analysis of web services protocols. In: Proceedings of the 5th International Workshop of Harnessing Theories for Tool Support in Software (TTSS’11), pp. 50–64 (2011)\nMarques A.P., Ravn A.P., Srba J., Vighio S.: The tool csv2uppaal. http:\u002F\u002Fcsv2uppaal.github.com\u002Fcsv2uppaal\u002F. Accessed 6 April 2012\nMathew B., Juric M., Sarang P.: Business Process Execution Language for Web Services, 2nd edn. Packt Publishing, Birmingham (2006)\nNaumovich G.N., Clarke L.A., Osterweil L.J.: Verification of communication protocols using data flow analysis. SIGSOFT Softw. Eng. Notes 21, 93–105 (1996)\nNewcomer E., Robinson I. (chairs): Web services atomic transaction (WS-atomic transaction) version 1.2 (2009). http:\u002F\u002Fdocs.oasis-open.org\u002Fws-tx\u002Fwstx-wsat-1.2-spec.html. Accessed 6 April 2012\nNewcomer E., Robinson I. (chairs): Web services business activity (WS-businessactivity) version 1.2 (2009). http:\u002F\u002Fdocs.oasis-open.org\u002Fws-tx\u002Fwstx-wsba-1.2-spec-os\u002Fwstx-wsba-1.2-spec-os.html. Accessed 6 April 2012\nNewcomer E., Robinson I. (chairs): Web services coordination (WS-coordination) version 1.2 (2009). http:\u002F\u002Fdocs.oasis-open.org\u002Fws-tx\u002Fwstx-wscoor-1.2-spec-os\u002Fwstx-wscoor-1.2-spec-os.html. Accessed 6 April 2012\nNicollin X., Sifakis J.: The algebra of timed processes, ATP: theory and application. Inf. Comput. 114(1), 131–178 (1994)\nOASIS. Discussion forum, report on error trace in BAwCC (2011). http:\u002F\u002Fmarkmail.org\u002Fmessage\u002Fxgnyonkihfif5vz2. Accessed 6 April 2012\nRavn A.P., Srba J., Vighio S.: UPPAAL model of the WS-BA protocol. http:\u002F\u002Fwww.uppaal.org. Accessed 6 April 2012\nRavn A.P., Srba J., Vighio S.: A formal analysis of the web services atomic transaction protocol with UPPAAL. In: Proceedings of the 4th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISOLA’10). LNCS, vol. 6416, pp. 579–593. Springer, Berlin (2010)\nRavn A.P., Srba J., Vighio S.: Modelling and verification of web services business activity protocol. In: Abdulla, P.A., Leino, K.R.M. (eds) Proceedings of TACAS’11. LNCS, vol. 6605, pp. 357–371. Springer, Berlin (2011)\nRobinson I.: Answer in WS-BA discussion forum, July 14th (2010). http:\u002F\u002Fmarkmail.org\u002Fmessage\u002Fwriewgkboaaxw66z. Accessed 6 April 2012\nSchnoebelen Ph.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83, 251–261 (2002)\nUPPAAL. http:\u002F\u002Fwww.uppaal.com. Accessed 6 April 2012\nVogt F.H., Zambrovski S., Gruschko B., Furniss P., Green A: Implementing web service protocols in SOA: WS-coordination and WS-businessactivity. In: Proceedings of the Seventh IEEE International Conference on E-Commerce Technology Workshops(CECW’05), pp. 21–28. IEEE Computer Society, New york (2005)\nVuong S.T., Hui D.D., Cowan D.D.: Valira—a tool for protocol validation via reachability analysis. In: Protocol Specification, Testing and Verification VI, pp. 35–41. North-Holland, Amsterdam (1987)",{"EN":201},"Web services business activity (WS-BA) specification defines two coordination protocols BAwCC (Business Agreement with Coordination Completion) and BAwPC (Business Agreement with Participant Completion) that ensure a consistent agreement on the outcome of long-running distributed applications. To verify fundamental properties of the protocols, we provide formal analyses in the model checker Uppaal. Our analyses are supported by a newly developed tool chain, where in the first step we translate tables with state-transition protocol descriptions into an intermediate XML format, and in the second step we translate this format into a network of communicating state machines directly suitable for verification in Uppaal. Our results show that the WS-BA protocols, as described in the standard specification, violate correct operation by reaching invalid states for all underlying communication media except for a perfect FIFO. Hence, we propose changes to the protocols and a further investigation of the modified protocols suggests that in case of the BAwCC protocol, messages should be received in the same order as they are sent to preserve correct behaviour, while BAwPC is now correct even for asynchronous, unordered, lossy and duplicating media. Another important property of communication protocols is that all parties always reach, under certain fairness assumptions, their final states. Based on an automatic verification with different communication models, we prove that our enhanced protocols satisfy this property whereas the original protocols do not. All verification results presented in this article were performed in a fully automatic way using our new tool csv2uppaal.",{"EN":203},"Model-checking web services business activity protocols",{"VOID":205},"10.1007\u002Fs10009-012-0231-4","PUBLICATION","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-012-0231-4",[209,226,238,251],{"id":210,"sortIndex":211,"researcher":20,"roles":212,"affiliations":214,"properties":223},"cf0d9957-7e04-495b-a97e-4667446b69cf",2,[213],"AUTHOR",[215],{"id":20,"sortIndex":21,"affiliation":216,"properties":20},{"id":217,"createTime":218,"updateTime":218,"relativeEntities":219,"slug":20,"properties":220,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"733c327e-5f46-4ba1-804b-c1d6ae4495f9","2024-02-02T11:27:24.951+00:00",[],{"title":221},{"VI":222},"Department of Computer Science, Aalborg University, Aalborg East, Denmark",{"title":224},{"VI":225},"Jiří Srba",{"id":227,"sortIndex":161,"researcher":20,"roles":228,"affiliations":229,"properties":235},"37821065-1422-4e72-999e-f0d610497fd1",[213],[230],{"id":20,"sortIndex":21,"affiliation":231,"properties":20},{"id":217,"createTime":218,"updateTime":218,"relativeEntities":232,"slug":20,"properties":233,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":234},{"VI":222},{"title":236},{"VI":237},"Anders P. Ravn",{"id":239,"sortIndex":240,"researcher":20,"roles":241,"affiliations":242,"properties":248},"a1ac7349-768f-4b0b-b04d-0b97513a7b33",3,[213],[243],{"id":20,"sortIndex":21,"affiliation":244,"properties":20},{"id":217,"createTime":218,"updateTime":218,"relativeEntities":245,"slug":20,"properties":246,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":247},{"VI":222},{"title":249},{"VI":250},"Saleem Vighio",{"id":252,"sortIndex":21,"researcher":20,"roles":253,"affiliations":254,"properties":263},"db4f5ea4-0b83-43b2-a23f-846ba84dd0ac",[213],[255],{"id":20,"sortIndex":21,"affiliation":256,"properties":20},{"id":257,"createTime":258,"updateTime":258,"relativeEntities":259,"slug":20,"properties":260,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"903f4381-5c77-4261-ac78-95864c4d4f93","2023-12-27T23:58:51.765+00:00",[],{"title":261},{"VI":262},"Brazilian Society of Health Informatics, São Paulo, Brazil",{"title":264},{"VI":265},"Abinoam P. Marques","ARTICLE",{"url":207,"publisher":268,"properties":296},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":269,"slug":10,"properties":270,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":274,"manageAffiliations":275,"indexDatabases":276,"url":104,"thumbnailPath":20,"statistic":291,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":271,"eissn":272,"title":273},{"VOID":13},{"VOID":15},{"EN":17},[],[],[277,284],{"id":66,"indexDatabase":278,"url":81,"indexYears":20,"academicFieldIds":283,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":279,"label":280,"description":281,"key":77,"publicationTags":282,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":285,"url":98,"indexYears":99,"academicFieldIds":290,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":286,"label":287,"description":288,"key":95,"publicationTags":289,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":292,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":293,"totalCitation":139,"totalCitationByYear":294,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":295,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":297,"pages":299},{"VOID":298},"15",{"VOID":300},"125-147","2012-04-13",2012,false,{"id":305,"createTime":306,"updateTime":307,"relativeEntities":308,"slug":309,"properties":310,"entityType":206,"verifyStatus":319,"verifyTime":307,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":321,"fullTextUrl":20,"authors":322,"publicationType":266,"publisherRelationship":407,"citationCount":20,"citationInfo":20,"publishDate":441,"publishYear":442,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"dea6826d-e637-46fa-b548-d58bedfe1b1a","2023-12-25T13:24:45.563+00:00","2025-02-26T23:58:44.891+00:00",[],"Verifying-a-quantitative-relaxation-of-linearizability-via-refinement",{"references":311,"abstract":313,"title":315,"doi":317},{"VOID":312},"Afek, Y., Korland, G., Yanovsky, E.: Quasi-linearizability: relaxed consistency for improved concurrency. In: International Conference on Principles of Distributed Systems, pp. 395–410 (2010)\nAspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM. 41(5), 1020–1048 (1994)\nAttiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics, 2nd edn. John Wiley and Sons Inc., Publication, New Jersey (2004)\nBurckhardt, S., Dern, C., Musuvathi, M., Tan, R.: Line-up: a complete and automatic linearizability checker. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 330–340 (2010)\nCerný, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., Alur, R.: Model checking of linearizability of concurrent list implementations. In: International Conference on Computer Aided Verification, pp. 465–479 (2010)\nFarzan, A., Madhusudan, P.: Monitoring atomicity in concurrent programs. In: International Conference on Computer Aided Verification, pp. 52–65 (2008)\nFlanagan, C., Qadeer, S.: A type and effect system for atomicity. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 338–349 (2003)\nGanai, M.K., Arora, N., Wang, C., Gupta, A., Balakrishnan, G.: BEST: A symbolic testing tool for predicting multi-threaded program failures. In: IEEE\u002FACM International Conference on Automated Software Engineering, (2011)\nHaas, A., Lippautz, M., Henzinger, T.A., Payer, H., Sokolova, A., Kirsch, C.M., Sezgin, A.: Distributed queues in shared memory: multicore performance and scalability through quantitative relaxation. In: Conference Computing Frontiers, p. 17 (2013)\nHenzinger, T.A., Sezgin, A., Kirsch, C.M., Payer, H., Sokolova, A.:. Quantitative relaxation of concurrent data structures. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 317–328 (2013)\nHerlihy, M., Shavit, N.: The art of multiprocessor programming. Morgan Kaufmann, USA (2008)\nHerlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM. Trans. Program. Lang. Syst. 12(3), 463–492 (1990)\nHoare, C.A.R.: Communicating sequential processes. Prentice Hall, Englewood Cliffs (1985)\nKirsch, C.M. Payer, H.: Incorrect systems: it’s not the problem, it’s the solution. In: Proceedings of the Design Automation Conference, pp. 913–917 (2012)\nKirsch, C.M., Payer, H., Röck, H., Sokolova, A.: Performance, scalability, and semantics of concurrent fifo queues. In: ICA3PP, pp. 273–287 (2012)\nLamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE. Trans. Comput. 28(9), 690–691 (1979)\nLiu, Y., Chen, W., Liu, Y., Zhang, S., Sun, J., Dong, J.S.: Verifying linearizability via optimized refinement checking. IEEE. Trans. Softw. Eng. (2013)\nLiu, Y., Chen, W., Liu, Y.A., Sun, J.: Model checking linearizability via refinement. In: International Symposium on Formal Methods, pp. 321–337 (2009)\nLynch, N.: Distributed algorithms. Morgan Kaufmann, USA (1997)\nMichael, M.M., Vechev, M.T., Saraswat, V.A.: Idempotent work stealing. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Raleigh, pp. 45–54 (2009)\nPayer, H., Röck, H., Kirsch, C.M., Sokolova, A.: Scalability versus semantics of concurrent fifo queues. In: ACM Symposium on Principles of Distributed Computing, pp. 331–332 (2011)\nSaid, M., Wang, C., Yang, Z., Sakallah, K.: Generating data race witnesses by an SMT-based analysis. In: NASA Formal Methods, pp. 313–327 (2011)\nSinha, A., Malik, S., Wang, C., Gupta, A.: Predicting serializability violations: SMT-based search vs. DPOR-based search. In: Haifa Verification Conference, pp. 95–114 (2011)\nSinha, A., Malik, S., Wang, C., Gupta, A.: Predictive analysis for detecting serializability violations through trace segmentation. In: Formal Methods and Models for Codesign, pp. 99–108 (2011)\nSinha, N., Wang, C.: Staged concurrent program analysis. In: ACM SIGSOFT Symposium on Foundations of Software Engineering, pp. 47–56 (2010)\nSun, J., Liu, Y., Dong, J.S., Chen, C.: Integrating specification and programs for system modeling and verification. In: International Symposium on Theoretical Aspects of Software Engineering, pp. 127–135 (2009)\nSun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: International Conference on Computer Aided Verification, pp. 709–714 (2009)\nTreiber, R.K.: Systems programming: coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (1986)\nVafeiadis, V.: Shape-value abstraction for verifying linearizability. In: International Conference on Verification, Model Checking, and Abstract Interpretation, pp. 335–348 (2009)\nVafeiadis, V., Herlihy, M., Hoare, T., Shapiro, M.: Proving correctness of highly-concurrent linearisable objects. In: ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 129–136 (2006)\nVechev, M.T., Yahav, E., Yorsh, G.: Experience with model checking linearizability. In: International SPIN Workshop on Model Checking Software, pp. 261–278 (2009)\nVogels, W.: Eventually consistent. Commun. ACM. 52(1), 40–44 (2009)\nWang, C., Ganai, M.: Predicting concurrency failures in generalized traces of x86 executables. In: International Conference on Runtime Verification (2011)\nWang, C., Hoang, K.: Precisely deciding control state reachability in concurrent traces with limited observability. In: International Conference on Verification, Model Checking, and Abstract Interpretation, pp. 376–394 (2014)\nWang, C., Kundu, S., Ganai, M., Gupta, A.: Symbolic predictive analysis for concurrent programs. In: International Symposium on Formal Methods, pp. 256–272 (2009)\nWang, C., Limaye, R., Ganai, M., Gupta, A.: Trace-based symbolic analysis for atomicity violations. In: International Conference on Tools and Algorithms for Construction and Analysis of Systems, pp. 328–342 (2010)\nWang, C., Yang, Y., Gupta, A., Gopalakrishnan, G.: Dynamic model checking with property driven pruning to detect race conditions. In: International Symposium on Automated Technology for Verification and Analysis, pp. 126–140 (2008)\nWang, L., Stoller, S.D.: Runtime analysis of atomicity for multithreaded programs. IEEE. Trans. Softw. Eng. 32(2), 93–110 (2006)\nZhang, L., Chattopadhyay, A., Wang, C.: Round-Up: Runtime checking quasi linearizability of concurrent data structures. In: IEEE\u002FACM International Conference on Automated Software Engineering, pp. 4–14 (2013)\nZhang, L., Wang, C.: Runtime prevention of concurrency related type-state violations in multithreaded applications. In: International Symposium on Software Testing and Analysis, pp. 1–12 (2014)",{"EN":314},"The recent years have seen increasingly widespread use of highly concurrent data structures in both multi-core and distributed computing environments, thereby escalating the priority for verifying their correctness. Quasi linearizability is a quantitative variation of the standard linearizability correctness condition to allow more implementation freedom for performance optimization. However, ensuring that the implementation satisfies the quantitative aspect of this new correctness condition is often an arduous task. In this paper, we propose the first automated method for formally verifying quasi linearizability of the implementation model of a concurrent data structure with respect to its sequential specification. The method is based on checking a relaxed version of the refinement relation between the implementation model and the specification model through explicit state model checking. Our method can directly handle concurrent systems where each thread or process makes infinitely many method calls. Furthermore, unlike many existing verification methods, it does not require the user to supply annotations of the linearization points. We have implemented the new method in the PAT verification framework. Our experimental evaluation shows that the method is effective in verifying the new quasi linearizability requirement and detecting violations.",{"EN":316},"Verifying a quantitative relaxation of linearizability via refinement",{"VOID":318},"10.1007\u002Fs10009-015-0373-2","VERIFIED","Auto Verify","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-015-0373-2",[323,344,359,374,391],{"id":324,"sortIndex":211,"researcher":20,"roles":325,"affiliations":326,"properties":341},"8bbf3c20-7f54-4be2-9d1a-9e28625b764a",[213],[327],{"id":328,"sortIndex":21,"affiliation":329,"properties":338},"8a3982c3-aa84-43a8-b3cf-2ab78dad434d",{"id":330,"createTime":331,"updateTime":332,"relativeEntities":333,"slug":334,"properties":335,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"43c13aaf-9459-487b-9e10-878f8a35f890","2024-09-01T11:34:20.590+00:00","2024-10-12T05:23:11.289+00:00",[],"Virginia-Tech-Blacksburg-United-States",{"title":336},{"EN":337},"Virginia Tech, Blacksburg, United States",{"title":339},{"VI":340},"Virginia Tech, Blacksburg, USA",{"title":342},{"VI":343},"Chao Wang",{"id":345,"sortIndex":161,"researcher":20,"roles":346,"affiliations":347,"properties":356},"2f3d604b-8ac5-47a7-8bc0-3332e359513f",[213],[348],{"id":349,"sortIndex":21,"affiliation":350,"properties":354},"493299e9-fde3-43f8-9943-db875af67c33",{"id":330,"createTime":331,"updateTime":332,"relativeEntities":351,"slug":334,"properties":352,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":353},{"EN":337},{"title":355},{"VI":340},{"title":357},{"VI":358},"James Street",{"id":360,"sortIndex":21,"researcher":20,"roles":361,"affiliations":362,"properties":371},"0ec96739-6c89-45b2-a75d-0559c5efdd9e",[213],[363],{"id":364,"sortIndex":21,"affiliation":365,"properties":369},"abe198e5-1da0-4955-ade1-b3871cb68b43",{"id":330,"createTime":331,"updateTime":332,"relativeEntities":366,"slug":334,"properties":367,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":368},{"EN":337},{"title":370},{"VI":340},{"title":372},{"VI":373},"Kiran Adhikari",{"id":375,"sortIndex":240,"researcher":20,"roles":376,"affiliations":377,"properties":388},"171e22cf-357c-497e-8412-2da8d5e4dd19",[213],[378],{"id":20,"sortIndex":21,"affiliation":379,"properties":20},{"id":380,"createTime":381,"updateTime":382,"relativeEntities":383,"slug":384,"properties":385,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"b60b0ff9-4b34-4c6f-814f-1f4fcc181a2c","2023-12-20T22:53:29.892+00:00","2025-02-09T15:30:06.259+00:00",[],"Nanyang-Technological-University-Singapore-Singapore",{"title":386},{"VI":387},"Nanyang Technological University, Singapore, Singapore",{"title":389},{"VI":390},"Yang Liu",{"id":392,"sortIndex":393,"researcher":20,"roles":394,"affiliations":395,"properties":404},"7dfb1361-9467-4ce1-b23f-11159e7e0dbd",4,[213],[396],{"id":20,"sortIndex":21,"affiliation":397,"properties":20},{"id":398,"createTime":399,"updateTime":399,"relativeEntities":400,"slug":20,"properties":401,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"c44e6595-c677-4edc-8735-144601e807c7","2023-12-15T00:15:57.359+00:00",[],{"title":402},{"VI":403},"Singapore University of Technology and Design, Singapore, Singapore",{"title":405},{"VI":406},"Shaojie Zhang",{"url":321,"publisher":408,"properties":436},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":409,"slug":10,"properties":410,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":414,"manageAffiliations":415,"indexDatabases":416,"url":104,"thumbnailPath":20,"statistic":431,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":411,"eissn":412,"title":413},{"VOID":13},{"VOID":15},{"EN":17},[],[],[417,424],{"id":66,"indexDatabase":418,"url":81,"indexYears":20,"academicFieldIds":423,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":419,"label":420,"description":421,"key":77,"publicationTags":422,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":425,"url":98,"indexYears":99,"academicFieldIds":430,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":426,"label":427,"description":428,"key":95,"publicationTags":429,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":432,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":433,"totalCitation":139,"totalCitationByYear":434,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":435,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":437,"pages":439},{"VOID":438},"18",{"VOID":440},"393-407","2015-03-18",2015,{"id":444,"createTime":445,"updateTime":446,"relativeEntities":447,"slug":448,"properties":449,"entityType":206,"verifyStatus":319,"verifyTime":446,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":458,"fullTextUrl":459,"authors":460,"publicationType":266,"publisherRelationship":508,"citationCount":20,"citationInfo":20,"publishDate":544,"publishYear":545,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"96ab0888-13f5-489f-825e-f376cf19f625","2024-02-02T10:33:50.892+00:00","2024-10-11T23:58:42.811+00:00",[],"History-status-and-recent-trends-of-the-testing-and-test-control-notation-version-3-TTCN-3-",{"references":450,"abstract":452,"title":454,"doi":456},{"VOID":451},"Adamis, G., Kristoffersen, F., Makedonski, P., Ulrich, A., Wendland, M.: An overview of the ETSI Test Description Language (TDL)—Results from STF 454. Presentation at the first ETSI User Conference on Advanced Automated Testing (UCAAT’13), Paris, 22–24 Oct 2013. \n                    http:\u002F\u002Fucaat.etsi.org\u002F2013\u002Fpresentations\u002FIntro%20to%20ETSI%20TDL_Andreas%20Ulrich.pdf\n                    \n                  . Accessed 06 Jan 2014\nATML Hompage: \n                    http:\u002F\u002Fgrouper.ieee.org\u002Fgroups\u002Fscc20\u002Ftii\u002F\n                    \n                  . Accessed 06 Jan 2014\ncitation_title=Model-Driven Testing—Using the UML Testing Profile; citation_publication_date=2007; citation_id=CR3; citation_author=P Baker; citation_author=Z Dai; citation_author=J Grabowski; citation_author=O Haugen; citation_author=I Schieferdecker; citation_author=C Williams; citation_publisher=Springer\nCppUnit Hompage: \n                    http:\u002F\u002Fsourceforge.net\u002Fprojects\u002Fcppunit\u002F\n                    \n                  . Accessed 06 Jan 2014\nETSI: TTCN-3 Change Request System: \n                    http:\u002F\u002Ft-ort.etsi.org\u002F\n                    \n                  . Accessed 06 Jan 2014\nETSI: TTCN-3 Web Site; \n                    http:\u002F\u002Fwww.ttcn-3.org\u002F\n                    \n                  . Accessed 06 Jan 2014\nETSI ES 201 873–1: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 1: Core Language, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–10: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 10: TTCN-3 Documentation Comment Specification, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–2: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 2: Tabular Presentation Format (TFT), v3.2.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2007)\nETSI ES 201 873–3: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 3: Graphical Presentation Format (GFT), v3.2.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2007)\nETSI ES 201 873–4: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 4: Operational Semantics, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–5: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 5: Run-Time Interface (TRI), v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–6: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 6: Control Interface (TCI), v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–7: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 7: Using ASN.1 with TTCN-3, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–8: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 8: Using IDL with TTCN-3, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 201 873–9: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3;—Part 9: Using XML with TTCN-3, v4.5.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 202 553: Methods for Testing and Specification (MTS); TPLan: A notation for expressing Test Purposes, v1.2.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2009)\nETSI ES 202 781: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Configuration and Deployment Support, v1.2.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 202 782: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Performance and Real-time Testing, v1.1.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2010)\nETSI ES 202 784: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Advanced Parametrization, v1.3.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 202 785: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Behaviour Types, v1.3.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI ES 202 786: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Support of Interfaces with Continuous Signals, v1.1.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2012)\nETSI ES 202 789: Methods for Testing and Specification (MTS); The Testing and Test Control Notation version 3; TTCN-3 Extensions: Extended TRI, v1.2.1. European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (2013)\nETSI TR 101 666: Information technology — Open Systems Interconnection Conformance Testing Methodology and Framework; The Tree and Tabular Combined Notation (TTCN) (Ed. 2++). European Telecommunications Standards Institute (ETSI), Sophia-Antipolis (1999)\nFirst ETSI User Conference on Advanced Automated Testing (UCAAT’13), Paris, 22–24 October 2013. \n                    http:\u002F\u002Fucaat.etsi.org\u002F2013\u002F\n                    \n                  . Accessed 06 Jan 2014\nFowler, M.: UML Distilled: A Brief Guide to the Standard Object Modeling Language, 3rd edn. Addison-Wesley Professional (2003)\nGrabowski, J., Kuliamin, V., Vouffo Feudjio, A., Wu-Hen-Chang, A., Zoric, M.: Towards the Usage of MBT at ETSI. In: MBT 2013: proceedings of the eighth workshop on Model-Based Testing (MBT 2013), Rome, 17th Mar 2013, electronic proceedings in theoretical computer science, vol 111, pp. 30–34. \n                    http:\u002F\u002Farxiv.org\u002Fabs\u002F1303.1007\n                    \n                  . Accessed 06 Jan 2014 (2013) \nGrossmann, J.: Testing hybrid systems with TTCN-3 embedded. Int. J. Software Tools Technol. Trans. (STTT), ISSN 1433–2779 (2013). doi:\n                    10.1007\u002Fs10009-013-0283-0\n                    \n                  \n                \nHtmlUnit Hompage: \n                    http:\u002F\u002Fhtmlunit.sourceforge.net\u002F\n                    \n                  . Accessed 23 Jan 2014\nISO\u002FIEC: Information processing systems — Open Systems Inter- connection—LOTOS—A formal description technique based on the temporal ordering of observational behaviour. International ISO\u002FIEC standard No. 8807 (1989)\nISO\u002FIEC: Information technology—Open Systems Inter- connection—Basic Reference Model: The Basic Model. International ISO\u002FIEC standard No. 7498–1 (1994)\nISO\u002FIEC: Information technology—Open Systems Inter- connection—Conformance testing methodology and framework. International ISO\u002FIEC multipart standard No. 9646 (1994– 1998)\nISO\u002FIEC: Information technology—Open Systems Inter- connection—Conformance testing methodology and framework—Part 3: The Tree and Tabular Combined Notation (TTCN). International ISO\u002FIEC standard No. 9646–3 (1998)\nITU-T: Information technology—Abstract Syntax Notation One (ASN.1): Specification of basic notation. ITU-T recommendation X.680 (11\u002F2008) (2008)\nJUnit Hompage: \n                    http:\u002F\u002Fjunit.org\u002F\n                    \n                  . Accessed 06 Jan 2014\nKroon, J., Wiles, A.: A Tutorial on TTCN. Tutorial at the 11th International IFIP WG6.1 symposium on Protocol, Specification, Testing and Verification (PSTV) (1991)\nMakedonski, P., Grabowski, J., Philipp, F.: Quantifying the evolution of TTCN-3 as a language. Int. J. Software Tools Technol. Trans. (STTT), ISSN 1433–2779 (2013). doi:\n                    10.1007\u002Fs10009-013-0282-1\n                    \n                  \n                \nMonkewich, O.: Ten Years of TTCN-3—Past, Present and Future. Presentation at the ETSI TTCN-3 User Conference 2011 (T3UC’11), Bled, Slovenia, 7–9 June 2011. \n                    http:\u002F\u002Fwww.ttcn-3.org\u002FTTCN3UC2011\u002FPres\u002F08_T3UC-Monkewich-TenYearsOfTTCN3-PastAndFuture.ppt\n                    \n                  . Accessed 06 Jan 2014\nNUnit Hompage: \n                    http:\u002F\u002Fwww.nunit.org\u002F\n                    \n                  . Accessed 06 Jan 2014\nObject Management Group (OMG): UML Testing Profile (UTP), Version 1.2. OMG Document Number: formal\u002F2013-04-03, Standard document \n                    http:\u002F\u002Fwww.omg.org\u002Fspec\u002FUTP\u002F1.2\u002F\n                    \n                   (2013)\nRings, T., Poglitsch, P., Schulz, S., Serazio, L., Vassiliou-Gioles, T.: A generic interoperability testing framework and a systematic development process for automated interoperability testing. Int. J. Software Tools Technol. Trans. (STTT), ISSN 1433–2779 (2013). doi:\n                    10.1007\u002Fs10009-013-0281-2\n                    \n                  \n                \nSchneider, M., Grossmann, J., Schieferdecker, I., Pietschker, A.: Online model-based behavioral fuzzing. ICSTW’13: proceedings of the 2013 IEEE sixth International Conference on Software Testing Verification and Validation, Workshops, pp. 469–475. IEEE Computer Society, Washington, DC (2013)\nStepien, B., Peyton, L.: Innovation and evolution in integrated web application testing with TTCN-3. Int. J. Software Tools Technol. Trans. (STTT), ISSN 1433–2779 (2013). doi:\n                    10.1007\u002Fs10009-013-0278-x\n                    \n                  \n                \nWiles, A.: The History and Future of TTCN-3. Presentation at the ETSI TTCN-3 User Conference 2007 (T3UC’07), Stockholm, 29 May–1 June 2007. \n                    http:\u002F\u002Fwww.ttcn-3.org\u002FTTCN3UC2007\u002FPresentations\u002FThu\u002FETSI%20TTCN-3%20keynote.pdf\n                    \n                  . Accessed 06 Jan 2014\nZeiss, B., Kovacs, A., Pakulin, N., Stanca-Kaposta, B.: A conformance test suite for TTCN-3 tools. Int. J. Software Tools Technol. Trans. (STTT), ISSN 1433–2779 (2013) doi:\n                    10.1007\u002Fs10009-013-0285-y\n                    \n                  \n                ",{"EN":453},"This overview article presents the Testing and Test Control Notation (TTCN-3) success story and serves as an introduction to this Special Section that contains five articles selected from the TTCN-3 user conference in 2011. The article sketches the development of TTCN-3 from its very beginning. It summarizes the current status of the language by reviewing its standardization process, available test suites, tools, and services as well as its training program. In addition, the article puts the articles selected for this Special Section into perspective, with regard to the evolution of TTCN-3 and the testing methodology in general. Last but not least, it discusses indicators for possible future developments of TTCN-3.",{"EN":455},"History, status, and recent trends of the testing and test control notation version 3 (TTCN-3)",{"VOID":457},"10.1007\u002Fs10009-014-0302-9","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-014-0302-9","https:\u002F\u002Flink.springer.com\u002Fcontent\u002Fpdf\u002F10.1007\u002Fs10009-014-0302-9.pdf",[461,476,493],{"id":462,"sortIndex":161,"researcher":20,"roles":463,"affiliations":464,"properties":473},"dcca27df-4ef9-4b84-a8f3-aa9422fe7d15",[213],[465],{"id":20,"sortIndex":21,"affiliation":466,"properties":20},{"id":467,"createTime":468,"updateTime":468,"relativeEntities":469,"slug":20,"properties":470,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"629472d8-d584-4c08-b97a-c920752a7e3e","2024-02-02T10:33:51.060+00:00",[],{"title":471},{"VI":472},"FU Berlin\u002FFraunhofer FOKUS, Berlin, Germany",{"title":474},{"VI":475},"Schieferdecker, Ina",{"id":477,"sortIndex":21,"researcher":20,"roles":478,"affiliations":479,"properties":490},"d1e8f627-db6f-44d9-8f80-009bba33703d",[213],[480],{"id":20,"sortIndex":21,"affiliation":481,"properties":20},{"id":482,"createTime":483,"updateTime":484,"relativeEntities":485,"slug":486,"properties":487,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"b5eb00b2-70d8-4e3b-afca-816efdd9246d","2023-12-12T00:01:27.560+00:00","2024-11-26T10:12:19.720+00:00",[],"University-Of-Goettingen-Goettingen-Germany",{"title":488},{"VI":489},"University Of Goettingen, Goettingen, Germany",{"title":491},{"VI":492},"Grabowski, Jens",{"id":494,"sortIndex":211,"researcher":20,"roles":495,"affiliations":496,"properties":505},"fdd35209-ce94-4f8a-a701-c69c1d4955c3",[213],[497],{"id":20,"sortIndex":21,"affiliation":498,"properties":20},{"id":499,"createTime":500,"updateTime":500,"relativeEntities":501,"slug":20,"properties":502,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"c2eac2ca-1dd6-4574-9286-5964fa63e967","2023-12-17T15:48:15.281+00:00",[],{"title":503},{"VI":504},"Corporate Technology Siemens AG, Munich, Germany",{"title":506},{"VI":507},"Ulrich, Andreas",{"url":458,"publisher":509,"properties":537},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":510,"slug":10,"properties":511,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":515,"manageAffiliations":516,"indexDatabases":517,"url":104,"thumbnailPath":20,"statistic":532,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":512,"eissn":513,"title":514},{"VOID":13},{"VOID":15},{"EN":17},[],[],[518,525],{"id":66,"indexDatabase":519,"url":81,"indexYears":20,"academicFieldIds":524,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":520,"label":521,"description":522,"key":77,"publicationTags":523,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":526,"url":98,"indexYears":99,"academicFieldIds":531,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":527,"label":528,"description":529,"key":95,"publicationTags":530,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":533,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":534,"totalCitation":139,"totalCitationByYear":535,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":536,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":538,"pages":540,"issue":542},{"VOID":539},"16",{"VOID":541},"215-225",{"VOID":543},"3","2014-06-01",2014,{"id":547,"createTime":548,"updateTime":549,"relativeEntities":550,"slug":551,"properties":552,"entityType":206,"verifyStatus":319,"verifyTime":549,"verifyNote":320,"syncStatus":19,"languages":563,"translateLanguages":20,"viewCount":21,"primaryUrl":565,"fullTextUrl":20,"authors":566,"publicationType":266,"publisherRelationship":666,"citationCount":50,"citationInfo":695,"publishDate":697,"publishYear":698,"citationAnalyzeStatus":699,"lastCitationAnalyze":700,"indexDatabases":20,"openAccess":20,"references":701,"isForceReanalyzing":303},"a97c9373-aa4e-40ee-8030-254a5e50bab0","2024-04-11T18:28:23.757+00:00","2024-05-02T23:57:13.856+00:00",[],"Modelling-defence-logistics-networks",{"mag":553,"keywords":555,"openalex":556,"abstract":558,"title":559,"doi":561},{"VOID":554},"2014691997",{},{"VOID":557},"W2014691997",{},{"EN":560},"Modelling defence logistics networks",{"VOID":562},"10.1007\u002Fs10009-007-0052-z",[564],"EN","http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10009-007-0052-z",[567,585,604,622,638,652],{"id":568,"sortIndex":21,"researcher":20,"roles":569,"affiliations":570,"properties":580},"734f1336-17df-451a-b159-7f30ce48277d",[],[571],{"id":20,"sortIndex":21,"affiliation":572,"properties":20},{"id":573,"createTime":574,"updateTime":574,"relativeEntities":575,"slug":576,"properties":577,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"c2b171a1-aa14-4477-b1ce-4117dea7cc84","2024-04-11T18:28:23.765+00:00",[],"University-of-South-Australia-Computer-Systems-Engineering-Centre-School-of-Electrical-and-Information-Engineering-Mawson-Lakes-Campus-5095-Mawson-Lakes-SA-Australia-TAB-",{"title":578},{"EN":579},"University of South Australia, Computer Systems Engineering Centre, School of Electrical and Information Engineering, Mawson Lakes Campus, 5095, Mawson Lakes, SA, Australia#TAB#",{"openalex":581,"title":583},{"VOID":582},"A5039144894",{"EN":584},"Guy Edward Gallasch",{"id":586,"sortIndex":587,"researcher":20,"roles":588,"affiliations":589,"properties":599},"9e366bbb-7757-4201-8acc-df0f449c692c",5,[],[590],{"id":20,"sortIndex":21,"affiliation":591,"properties":20},{"id":592,"createTime":593,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"5c8efa40-652d-4db5-95ed-0727fd73ea42","2024-04-11T18:28:23.874+00:00",[],"Logistics-Mission-Land-Operations-Division-Defence-Science-and-Technology-Organisation-Edinburgh-Australia",{"title":597},{"EN":598},"Logistics Mission, Land Operations Division, Defence Science and Technology Organisation, Edinburgh, Australia",{"openalex":600,"title":602},{"VOID":601},"A5067528219",{"EN":603},"Benjamin Francis",{"id":605,"sortIndex":161,"researcher":20,"roles":606,"affiliations":607,"properties":617},"80d7a68f-6eba-4ca9-a653-feae7df46ff3",[],[608],{"id":20,"sortIndex":21,"affiliation":609,"properties":20},{"id":610,"createTime":611,"updateTime":611,"relativeEntities":612,"slug":613,"properties":614,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"2667b944-7a33-4280-84cf-53711ac264b1","2024-04-11T18:28:23.774+00:00",[],"Computer-Systems-Engineering-Centre-School-of-Electrical-and-Information-Engineering-University-of-South-Australia-Mawson-Lakes-Australia",{"title":615},{"EN":616},"Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, Mawson Lakes, Australia",{"openalex":618,"title":620},{"VOID":619},"A5080027024",{"EN":621},"Nimrod Lilith",{"id":623,"sortIndex":240,"researcher":20,"roles":624,"affiliations":625,"properties":631},"c26c67d1-ce95-46bd-be65-e967fe72ea91",[],[626],{"id":20,"sortIndex":21,"affiliation":627,"properties":20},{"id":592,"createTime":593,"updateTime":593,"relativeEntities":628,"slug":595,"properties":629,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":630},{"EN":598},{"openalex":632,"orcid":634,"title":636},{"VOID":633},"A5074914691",{"VOID":635},"https:\u002F\u002Forcid.org\u002F0000-0002-6912-5392",{"EN":637},"Zhang Lin",{"id":639,"sortIndex":393,"researcher":20,"roles":640,"affiliations":641,"properties":647},"b2b87eaf-bfd7-4c12-9dbc-b443822b4b33",[],[642],{"id":20,"sortIndex":21,"affiliation":643,"properties":20},{"id":592,"createTime":593,"updateTime":593,"relativeEntities":644,"slug":595,"properties":645,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":646},{"EN":598},{"openalex":648,"title":650},{"VOID":649},"A5068465462",{"EN":651},"Axel Bender",{"id":653,"sortIndex":211,"researcher":20,"roles":654,"affiliations":655,"properties":661},"d7b83425-0859-48ed-a8e0-03bcb0875131",[],[656],{"id":20,"sortIndex":21,"affiliation":657,"properties":20},{"id":610,"createTime":611,"updateTime":611,"relativeEntities":658,"slug":613,"properties":659,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":660},{"EN":616},{"openalex":662,"title":664},{"VOID":663},"A5022705898",{"EN":665},"Jonathan Billington",{"url":20,"publisher":667,"properties":20},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":668,"slug":10,"properties":669,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":673,"manageAffiliations":674,"indexDatabases":675,"url":104,"thumbnailPath":20,"statistic":690,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":670,"eissn":671,"title":672},{"VOID":13},{"VOID":15},{"EN":17},[],[],[676,683],{"id":66,"indexDatabase":677,"url":81,"indexYears":20,"academicFieldIds":682,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":678,"label":679,"description":680,"key":77,"publicationTags":681,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":684,"url":98,"indexYears":99,"academicFieldIds":689,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":685,"label":686,"description":687,"key":95,"publicationTags":688,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":691,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":692,"totalCitation":139,"totalCitationByYear":693,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":694,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"total":50,"publishYear":20,"statisticByYear":696},{"2013":240,"2016":161,"2018":161,"2019":161,"2020":161,"2021":161},"2008-01-01",2008,"ERROR_IN_ANALYZE_CITATION","2024-04-11T21:50:26.160+00:00",[702,706,709,713,717,720,723,726,729,732,735,738,741,745,748,751,754,758,761,764,768,772,776,780,783,786],{"id":20,"text":703,"url":20,"identifiers":704},"van der Aalst, W.M.P.: Timed coloured petri nets and their application to logistics. PhD Thesis, Eindhoven University of Technology (1992)",{"doi":705},"10.1007\u002F3-540-56863-8_61",{"id":20,"text":707,"url":20,"identifiers":708},"Australian Defence Doctrine Publication 4.0—Defence Logistics. Defence Publishing Service, Department of Defence, 8 April 2003",{},{"id":20,"text":710,"url":20,"identifiers":711},"Billington, J., Diaz, M., Rozenberg, G. (eds.): Application of Petri Nets to Communication Networks. Lecture Notes in Computer Science, vol. 1605. Springer, Heidelberg (1999)",{"doi":712},"10.1007\u002FBFb0097770",{"id":20,"text":714,"url":20,"identifiers":715},"Bullinger, H.J., Steinaecker, J.V.: Petri net based modelling, planning and control of logistical processes under environmental goals and constraints. In: Proceedings of the 9th Symposium on Information Control in Manufacturing, vol. 1, pp. 433–438. Elsevier Science, Amsterdam June 1998",{"doi":716},"10.1016\u002FS1474-6670(17)40591-X",{"id":20,"text":718,"url":20,"identifiers":719},"CPN Tools. http:\u002F\u002Fwiki.daimi.au.dk\u002Fcpntools\u002Fcpntools.wiki",{},{"id":20,"text":721,"url":20,"identifiers":722},"Degano, C., Di Febbraro, A.: On using Petri nets to detect and recover from faulty behaviours in transportation facilities. In: Proceedings of the 2002 IEEE International Conference on Systems, Man and Cybernetics, vol. 1, pp. 31–36. IEEE, October 2002",{},{"id":20,"text":724,"url":20,"identifiers":725},"Design\u002FCPN Online. http:\u002F\u002Fwww.daimi.au.dk\u002FdesignCPN\u002F",{},{"id":20,"text":727,"url":20,"identifiers":728},"Eick, I., Vogelsang, D., Behrens, A.: Planning smelter logistics: a process modeling approach. In: Light Metals 2001, New Orleans, LA, pp. 393–398. Minerals, Metals and Materials Society, February 2001",{},{"id":20,"text":730,"url":20,"identifiers":731},"Gallasch, G.E., Lilith, N., Billington, J.: A coloured petri net model of a defence logistics physical network. Technical Report CSEC-25, Computer Systems Engineering Centre Report Series, University of South Australia, August 2006",{},{"id":20,"text":733,"url":20,"identifiers":734},"Han, B., Lilith, N., Billington, J.: Modelling, simulation and analysis of logistics systems using discrete event system techniques: a survey. Technical Report CSEC-24, Computer Systems Engineering Centre Report Series, University of South Australia, Draft, March 2006",{},{"id":20,"text":736,"url":20,"identifiers":737},"Hutchinson N.E. (1987). An Integrated Approach to Logistics Management. Prentice-Hall, Englewood Cliffs",{},{"id":20,"text":739,"url":20,"identifiers":740},"Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 1, Basic Concepts, 2nd edn. Monographs in Theoretical Computer Science. Springer, Heidelberg (1997)",{},{"id":20,"text":742,"url":20,"identifiers":743},"Kristensen L.M., Christensen S. and Jensen K. (1998). The Practitioner’s Guide to coloured petri nets. Int. J. Software Tools Technol. Transf. 2(2): 98–132",{"doi":744},"10.1007\u002Fs100090050021",{"id":20,"text":746,"url":20,"identifiers":747},"Kristensen, L.M., Mitchell, B., Zhang, L., Billington, J.: Modelling and initial analysis of operational planning processes using coloured petri nets. In: Formal Methods in Software Engineering and Defence Systems 2002, Proceedings of the Satellite Workshops on Software Engineering and Formal Methods and Formal Methods Applied to Defence Systems. Conferences in Research and Practice in Information Technology Series, vol. 12, pp. 105–114. Australian Computer Society Inc. (2002)",{},{"id":20,"text":749,"url":20,"identifiers":750},"Mitchell, B., Kristensen, L.M., Zhang, L.: Formal specification and state space analysis of an operational planning process. In: Proceedings of the 5th Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (CPN’04), Aarhus, Denmark, pp. 1–18 (2004)",{},{"id":20,"text":752,"url":20,"identifiers":753},"Ochmanska, E.: Object-oriented PN models with storage for transport and logistic processes. In: Proceedings of the 9th European Simulation and Symposium, Passau, Germany, pp. 483–487, San Diego, CA, USA, October 1997 (SCS)",{},{"id":20,"text":755,"url":20,"identifiers":756},"Piera M.A., Narciso M., Guasch A. and Riera D. (2004). Optimization of logistic and manufacturing systems through simulation: a coloured Petri net-based methodology. Simulation 80(3): 121–129",{"doi":757},"10.1177\u002F0037549704045045",{"id":20,"text":759,"url":20,"identifiers":760},"The Technical Cooperation Program (TCCP). Guide for Understanding and Implementing Defence Experimentation (Guidex). Version 1.1, February 2006",{},{"id":20,"text":762,"url":20,"identifiers":763},"US Department of Defense. Logistics Transformation Strategy—Achieving Knowledge-Enabled Logistics. 10th December 2006",{},{"id":20,"text":765,"url":20,"identifiers":766},"van der Vorst J.G.A.J., Beulens A.J.M. and van Beek P. (2000). Modelling and simulating multi-echelon food systems. Eur. J. Oper. Res. 122(2): 354–366",{"doi":767},"10.1016\u002FS0377-2217(99)00238-6",{"id":20,"text":769,"url":20,"identifiers":770},"Viswanadham N. and Raghavan N.R.S. (2000). Performance analysis and design of supply chains: a petri net approach. J. Oper. Res. Soc. 51(10): 1158–1169",{"doi":771},"10.1057\u002Fpalgrave.jors.2600063",{"id":20,"text":773,"url":20,"identifiers":774},"von Mevius, M., Pibernik, R.: Process management in supply chains—a new Petri-net based approach. In: Proceedings of the 37th Annual Hawaii International Conference on System Sciences, vol. 37, pp. 1153–1162. IEEE Computer Society, January 2004",{"doi":775},"10.1109\u002FHICSS.2004.1265208",{"id":20,"text":777,"url":20,"identifiers":778},"Wang Z., Zhang J. and Chan F.T.S. (2005). A hybrid petri nets model of networked manufacturing systems and its control system architecture. J. Manufact. Technol. Manage. 16(1): 36–52",{"doi":779},"10.1108\u002F17410380510574077",{"id":20,"text":781,"url":20,"identifiers":782},"Websters dictionary",{},{"id":20,"text":784,"url":20,"identifiers":785},"Zhang, L., Kristensen, L.M., Janczura, C., Gallasch, G.E., Billington, J.: A coloured petri net based tool for course of action development and analysis. In: Formal Methods in Software Engineering and Defence Systems 2002, Proceedings of the Satellite Workshops on Software Engineering and Formal Methods and Formal Methods Applied to Defence Systems. Conferences in Research and Practice in Information Technology Series, vol. 12, pp. 125–134. Australian Computer Society Inc. (2002)",{},{"id":20,"text":787,"url":20,"identifiers":788},"Zhang, L., Kristensen, L.M., Mitchell, B., Gallasch, G.E., Mechlenborg, P., Janczura, C.: COAST—An operational planning tool for course of action development and analysis. In: Proceedings of the 9th International Command and Control Research and Technology Symposium (ICCRTS), Copenhagen, Denmark (2004)",{},{"id":790,"createTime":791,"updateTime":792,"relativeEntities":793,"slug":794,"properties":795,"entityType":206,"verifyStatus":319,"verifyTime":792,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":804,"fullTextUrl":20,"authors":805,"publicationType":266,"publisherRelationship":864,"citationCount":20,"citationInfo":20,"publishDate":898,"publishYear":899,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"305280ad-7455-47f2-acc4-dec5bd204332","2023-12-11T16:31:36.482+00:00","2025-02-12T23:53:01.875+00:00",[],"Verification-of-randomized-consensus-algorithms-under-round-rigid-adversaries",{"references":796,"abstract":798,"title":800,"doi":802},{"VOID":797},"Aguilera, M., Toueg, S.: The correctness proof of Ben-Or’s randomized consensus algorithm. Distrib. Comput. 25(5), 1–11 (2012). Online first\nApt, K., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. IPL 15, 307–309 (1986)\nBaier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)\nBen-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In: PODC, pp. 27–30 (1983)\nBerkovits, I., Lazic, M., Losa, G., Padon, O., Shoham, S.: Verification of threshold-based distributed algorithms by decomposition to decidable logics. In: CAV Part II, pp. 245–266 (2019)\nBertrand, N., Fournier, P.: Parameterized verification of many identical probabilistic timed processes. In: FSTTCS, volume 24 of LIPIcs, pp. 501–513 (2013)\nBertrand, N., Konnov, I., Lazic, M., Widder, J.: Verification of randomized consensus algorithms under round-rigid adversaries. In: CONCUR, volume 140 of LIPIcs, pp. 33:1–33:15. Schloss Dagstuhl (2019)\nBertrand, N., Lazić, M., Widder, J.: A reduction theorem for randomized distributed algorithms under weak adversaries. In: VMCAI (2021) (to appear)\nBloem, R., Jacobs, S., Khalimov, A., Konnov, I., Rubin, S., Veith, H., Widder, J.: Decidability of Parameterized Verification Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2015)\nBouajjani, A., Enea, C., Ji, K., Qadeer, S.: On the completeness of verifying message passing programs under bounded asynchrony. In: CAV, pp. 372–391 (2018)\nBracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130–143 (1987)\nChaouch-Saad, M., Charron-Bost, B., Merz, S.: A reduction theorem for the verification of round-based distributed algorithms. In: RP, volume 5797 of LNCS, pp. 93–106 (2009)\nCharron-Bost, B., Merz, S.: Formal verification of a consensus algorithm in the heard-of model. IJSI 3(2–3), 273–303 (2009)\nClarke, E.M., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Springer, Heidelberg (2018)\nDamian, A., Drăgoi, C., Militaru, A., Widder, J.: Communication-closed asynchronous protocols. In: CAV (2), volume 11562 of Lecture Notes in Computer Science, pp. 344–363. Springer (2019)\nDrăgoi, C., Henzinger, T.A., Veith, H., Widder, J., Zufferey, D.: A logic-based framework for verifying consensus algorithms. In: VMCAI, volume 8318 of LNCS, pp. 161–181 (2014)\nElrad, T., Francez, N.: Decomposition of distributed programs into communication-closed layers. Sci. Comput. Program. 2(3), 155–173 (1982)\nEmerson, E.A., Namjoshi, K.S.: Reasoning about rings. In: POPL, pp. 85–94 (1995)\nFischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)\nGrimmet, G.R., Strizaker, D.: Probability and Random Processes, 2nd edn. Oxford Science Publications, Oxford (1992)\nHawblitzel, C., Howell, J., Kapritsos, M., Lorch, J.R., Parno, B., Roberts, M.L., Setty, S., Zill, B.: Ironfleet: proving safety and liveness of practical distributed systems. Commun. ACM 60(7), 83–92 (2017)\nJohn, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Towards modeling and model checking fault-tolerant distributed algorithms. In: SPIN, volume 7976 of LNCS, pp. 209–226 (2013)\nKonnov, I., Lazic, M., Veith, H., Widder, J.: Para\\(^2\\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms. Formal Methods Syst. Des. 51(2), 270–307 (2017)\nKonnov, I., Lazić, M., Veith, H., Widder, J.: A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. In: POPL, pp. 719–734 (2017)\nKonnov, I., Veith, H., Widder, J.: On the completeness of bounded model checking for threshold-based distributed algorithms: reachability. Inf. Comput. 252, 95–109 (2017)\nKonnov, I., Widder, J.: ByMC: byzantine model checker. In: ISoLA (3), volume 11246 of LNCS, pp. 327–342. Springer (2018)\nKragl, B., Qadeer, S., Henzinger, T.A.: Synchronizing the asynchronous. In: CONCUR, pp. 21:1–21:17 (2018)\nKukovec, J., Konnov, I., Widder, J.: Reachability in parameterized systems: all flavors of threshold automata. In: CONCUR, pp. 19:1–19:17 (2018)\nKwiatkowska, M.Z., Norman, G.: Verifying randomized byzantine agreement. In: FORTE, pp. 194–209 (2002)\nKwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: CAV, pp. 585–591 (2011)\nKwiatkowska, M.Z., Norman, G., Segala, R.: Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In: CAV, pp. 194–206 (2001)\nLamport, L.: Specifying systems: the TLA\\(+\\) language and tools for hardware and software engineers. Addison-Wesley, Boston (2002)\nLehmann, Daniel J., Rabin, Michael O.: On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. In: POPL, pp. 133–138 (1981)\nLengál, O., Lin, A.W., Majumdar, R., Rümmer, P.: Fair termination for parameterized probabilistic concurrent systems. In: TACAS, volume 10205 of LNCS, pp. 499–517 (2017). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-662-54577-5_29\nLin, A.W., Rümmer, P.: Liveness of randomised parameterised systems under arbitrary schedulers. In CAV, volume 9780 of LNCS, pp. 112–133. Springer (2016). https:\u002F\u002Fdoi.org\u002F10.1007\u002F978-3-319-41540-6_7\nMaric, O., Sprenger, C., Basin, D.A.: Cutoff bounds for consensus algorithms. In: CAV, volume 10427 of LNCS, pp. 217–237 (2017)\nMcIver, A., Morgan, C.: Abstraction, refinement and proof for probabilistic systems. In: Monographs in Computer Science. Springer (2005). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fb138392\nMostéfaoui, A., Moumen, H., Raynal, M.: Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709, 80–97 (2018)\nNestmann, U., Fuzzati, R., Merro, M.: Modeling consensus in a process calculus. In: CONCUR, volume 2761 of LNCS, pp. 393–407 (2003)\nPadon, O., Losa, G., Sagiv, M., Shoham, S.: Paxos made EPR: decidable reasoning about distributed protocols. PACMPL 1(OOPSLA), 108:1–108:31 (2017)\nPnueli, A., Zuck, L.D.: Verification of multiprocess probabilistic protocols. Distrib. Comput. 1(1), 53–72 (1986). https:\u002F\u002Fdoi.org\u002F10.1007\u002FBF01843570\nSong, Y.J., van Renesse, R.: Bosco: one-step Byzantine asynchronous consensus. In: DISC, volume 5218 of LNCS, pp. 438–450 (2008)\nSteiner, W., Rushby, J.M., Sorea, M., Pfeifer, H.: Model checking a fault-tolerant startup algorithm: from design exploration to exhaustive fault simulation. In: DSN, pp. 189–198 (2004)\nStoilkovska, I., Konnov, I., Widder, J., Zuleger, F.: Verifying safety of synchronous fault-tolerant algorithms bounded model checking. In: TACAS, Part II, volume 11428 of LNCS, pp. 357–374 (2019)\nSuzuki, I.: Proving properties of a ring of finite-state machines. Inf. Process. Lett. 28(4), 213–214 (1988)\nSwaminathan, M., Katoen, J.-P., Olderog, E.-R.: Layered reasoning for randomized distributed algorithms. Formal Asp. Comput. 24(4–6), 477–496 (2012). https:\u002F\u002Fdoi.org\u002F10.1007\u002Fs00165-012-0231-x\nTLA\\(+\\) proof system. https:\u002F\u002Ftla.msr-inria.inria.fr\u002Ftlaps\u002Fcontent\u002FHome.html\nTsuchiya, T., Schiper, A.: Using bounded model checking to verify consensus algorithms. In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22–24, 2008, Proceedings, pp. 466–480 (2008)\nTsuchiya, T., Schiper, A.: Verification of consensus algorithms using satisfiability solving. Distrub. Comput. 23(5–6), 341–358 (2011)\nGleissenthall, K.V., Kici, R.G., Bakst, A.L., Stefan, D.E., Jhala, R.A.: Pretend synchrony. PACMPL 3(POPL), 59:1–59:30 (2019)\nWoos, D., Wilcox, J.R., Anton, S., Tatlock, Z., Ernst, M.D., Anderson, T.E.: Planning for change in a formal verification of the RAFT consensus protocol. In: CPP, pp. 154–165 (2016)\nZuck, L.D., McMillan, K.L., Torf, J.: \\(P^5\\): planner-less proofs of probabilistic parameterized protocols. In: VMCAI, pp. 336–357 (2018)",{"EN":799},"Randomized fault-tolerant distributed algorithms pose a number of challenges for automated verification: (i) parameterization in the number of processes and faults, (ii) randomized choices and probabilistic properties, and (iii) an unbounded number of asynchronous rounds. This combination makes verification hard. Challenge (i) was recently addressed in the framework of threshold automata. We extend threshold automata to model randomized consensus algorithms that perform an unbounded number of asynchronous rounds. For non-probabilistic properties, we show that it is necessary and sufficient to verify these properties under round-rigid schedules, that is, schedules where processes enter round r only after all processes finished round \n                \n                  \n                \n                $$r-1$$\n                \n              . For almost-sure termination, we analyze these algorithms under round-rigid adversaries, that is, fair adversaries that only generate round-rigid schedules. This allows us to do compositional and inductive reasoning that reduces verification of the asynchronous multi-round algorithms to model checking of a one-round threshold automaton. We apply this framework and automatically verify the following classic algorithms: Ben-Or’s and Bracha’s seminal consensus algorithms for crashes and Byzantine faults, 2-set agreement for crash faults, and RS-Bosco for the Byzantine case.\n",{"EN":801},"Verification of randomized consensus algorithms under round-rigid adversaries",{"VOID":803},"10.1007\u002Fs10009-020-00603-x","https:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10009-020-00603-x",[806,822,837,849],{"id":807,"sortIndex":161,"researcher":20,"roles":808,"affiliations":809,"properties":819},"a1ed1744-c36c-434c-b143-7d02b9393c76",[213],[810],{"id":20,"sortIndex":21,"affiliation":811,"properties":20},{"id":812,"createTime":813,"updateTime":813,"relativeEntities":814,"slug":815,"properties":816,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"85faca45-5702-4657-8aa6-767987a332a6","2023-11-29T15:13:25.568+00:00",[],"Informal-Systems-Vienna-Austria",{"title":817},{"VI":818},"Informal Systems, Vienna, Austria",{"title":820},{"VI":821},"Igor Konnov",{"id":823,"sortIndex":211,"researcher":20,"roles":824,"affiliations":825,"properties":834},"b08626b7-1a5c-4dd8-9aca-706057faf857",[213],[826],{"id":20,"sortIndex":21,"affiliation":827,"properties":20},{"id":828,"createTime":829,"updateTime":829,"relativeEntities":830,"slug":20,"properties":831,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"c414f857-b659-4c39-8698-ad5d3088ac0a","2023-12-19T22:26:28.066+00:00",[],{"title":832},{"VI":833},"TU München, Munich, Germany",{"title":835},{"VI":836},"Marijana Lazić",{"id":838,"sortIndex":240,"researcher":20,"roles":839,"affiliations":840,"properties":846},"476e0a8f-4fd6-41e5-9046-9104f0615fad",[213],[841],{"id":20,"sortIndex":21,"affiliation":842,"properties":20},{"id":812,"createTime":813,"updateTime":813,"relativeEntities":843,"slug":815,"properties":844,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":845},{"VI":818},{"title":847},{"VI":848},"Josef Widder",{"id":850,"sortIndex":21,"researcher":20,"roles":851,"affiliations":852,"properties":861},"eeddb162-77c5-420f-bec0-2e928816251b",[213],[853],{"id":20,"sortIndex":21,"affiliation":854,"properties":20},{"id":855,"createTime":856,"updateTime":856,"relativeEntities":857,"slug":20,"properties":858,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"9603c77b-5611-4e12-a544-a9bdac661aa1","2024-01-19T17:52:35.373+00:00",[],{"title":859},{"VI":860},"University Rennes, Inria, CNRS, IRISA, Rennes, France",{"title":862},{"VI":863},"Nathalie Bertrand",{"url":804,"publisher":865,"properties":893},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":866,"slug":10,"properties":867,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":871,"manageAffiliations":872,"indexDatabases":873,"url":104,"thumbnailPath":20,"statistic":888,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":868,"eissn":869,"title":870},{"VOID":13},{"VOID":15},{"EN":17},[],[],[874,881],{"id":66,"indexDatabase":875,"url":81,"indexYears":20,"academicFieldIds":880,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":876,"label":877,"description":878,"key":77,"publicationTags":879,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":882,"url":98,"indexYears":99,"academicFieldIds":887,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":883,"label":884,"description":885,"key":95,"publicationTags":886,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":889,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":890,"totalCitation":139,"totalCitationByYear":891,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":892,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":894,"pages":896},{"VOID":895},"23",{"VOID":897},"797-821","2021-02-02",2021,{"id":901,"createTime":902,"updateTime":903,"relativeEntities":904,"slug":905,"properties":906,"entityType":206,"verifyStatus":319,"verifyTime":915,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":916,"fullTextUrl":20,"authors":917,"publicationType":266,"publisherRelationship":997,"citationCount":20,"citationInfo":20,"publishDate":1030,"publishYear":899,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"f370dee1-89ce-48d6-8711-a1787fd94d07","2024-02-13T01:17:32.561+00:00","2024-12-11T23:50:20.436+00:00",[],"Neural-predictive-monitoring-and-a-comparison-of-frequentist-and-Bayesian-approaches",{"references":907,"abstract":909,"title":911,"doi":913},{"VOID":908},"Alur, R.: Formal verification of hybrid systems. In Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT), pages 273–278, Oct (2011)\nHenzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57(1), 94–124 (1998)\nChen, X. and Sankaranarayanan, S.: Model predictive real-time monitoring of linear systems. In Real-Time Systems Symposium (RTSS), 2017 IEEE, pages 297–306. IEEE, (2017)\nSha, L.: Using simplicity to control complexity. IEEE Softw. 18(4), 20–28 (2001)\nBartocci, E., Deshmukh, J., Donze, A., Fainekos, G., Maler, O., Nickovic, D. and Sankaranarayanan, S.: Specification-based monitoring of cyber-physical systems: a survey on theory, tools and applications. In Lectures on Runtime Verification, pages 135–175. Springer, (2018)\nPhan, D., Paoletti, N., Zhang, T., Grosu, R., Smolka, S.A. and Stoller, S.D.: Neural state classification for hybrid systems. In Automated Technology for Verification and Analysis, volume 11138 of Lecture Notes in Computer Science, pages 422–440, (2018)\nVovk, V., Gammerman, A., Shafer G.: Algorithmic learning in a random world. Springer Science & Business Media, Glenn (2005)\nNeal, Radford M et al.: MCMC using Hamiltonian dynamics. Handbook of markov chain monte carlo, 2(11):2, (2011)\nJordan, M.I., Ghahramani, Z., Jaakkola, T.S., Saul, L.K.: An introduction to variational methods for graphical models. Mach. Learn. 37(2), 183–233 (1999)\nBortolussi, L., Cairoli, F., Paoletti, N., Smolka, S.A. and Stoller, S.D.: Neural predictive monitoring. In International Conference on Runtime Verification, pages 129–147. Springer, (2019)\nBak, S., Beg, O.A., Bogomolov, S., Johnson, T.T., Nguyen, L.V., Schilling, C.: Hybrid automata: from verification to implementation. Int. J. Softw. Tools Technol. Transf. 21(1), 87–104 (2019)\nGao, S., Kong, S. and Clarke, E.M.: dreal: An smt solver for nonlinear theories over the reals. In International conference on automated deduction, pages 208–214. Springer, (2013)\nChen, Xin, Ábrahám, Erika, Sankaranarayanan, Sriram: Flow*: An analyzer for non-linear hybrid systems. In International Conference on Computer Aided Verification, pages 258–263. Springer, (2013)\nAlthoff M.: An introduction to CORA 2015. In Proc. of the Workshop on Applied Verification for Continuous and Hybrid Systems, (2015)\nBogomolov, S., Forets, M., Frehse, G., Potomkin, K. and Schilling, C,: Juliareach: a toolbox for set-based reachability. In Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pages 39–44, (2019)\nHornik, K., Stinchcombe, M., White, H., et al.: Multilayer feedforward networks are universal approximators. Neural Netw. 2(5), 359–366 (1989)\nRumelhart, D.E., Hinton, G.E. and Williams, R.J.: Learning internal representations by error propagation. Technical report, California Univ San Diego La Jolla Inst for Cognitive Science, (1985)\nPapadopoulos, H.: Inductive conformal prediction: Theory and application to neural networks. In Tools in artificial intelligence, InTech (2008)\nVineeth B., Shen-Shyang H., Vladimir V.: Conformal prediction for reliable machine learning: theory, adaptations and applications. Newnes (2014)\nChristopher M Bishop. Pattern recognition and machine learning. Springer, 2006\nGal, Y.: Uncertainty in deep learning. PhD thesis, University of Cambridge, (2016)\nMacKay, D.J.C.: A practical bayesian framework for backpropagation networks. Neural Comput. 4(3), 448–472 (1992)\nVan der Vaart, A.W.: Asymptotic statistics. Cambridge University Press, Cambridge (2000)\nRasch, D., Pilz, J., Verdooren L.R., and Gebhardt A.: Chapman and Hall\u002FCRC, Optimal experimental design with R (2011)\nMassart, P.: The tight constant in the dvoretzky-kiefer-wolfowitz inequality. The annals of Probability, pages 1269–1283, (1990)\nDeodato, G., Ball, C. and Zhang, X.: Bayesian neural networks for cellular image classification and uncertainty analysis. bioRxiv, page 824862, 2019\nJordaney, R., Sharad, K., Dash, S.K., Wang, Z., Papini, D., Nouretdinov, I. and Cavallaro, L.: Transcend: Detecting concept drift in malware classification models. In 26th USENIX Security Symposium (USENIX Security 17), pages 625–642, (2017)\nGuo, C., Pleiss, G., Sun, Y. and Weinberger, K.Q: On calibration of modern neural networks. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pages 1321–1330. JMLR. org, (2017)\nBortolussi, L., Cairoli, F., Paoletti, N. and Stoller, S.D.: Conformal predictions for hybrid system state classification. In From Reactive Systems to Cyber-Physical Systems, pages 225–241. Springer, (2019)\nBrefeld, U., Geibel, P. and Wysotzki, F.: Support vector machines with example dependent costs. In European Conference on Machine Learning, pages 23–34. Springer, (2003)\nBatuwita, R., Palade, V.: Class imbalance learning methods for support vector machines, chapter 5, pages 83–99. John Wiley & Sons, Ltd, (2013)\nRasmussen, C.E., Williams, C.K.I: Gaussian processes for machine learning, volume 1. MIT press Cambridge, (2006)\nBoughorbel, S., Jarray, F., El-Anbari, M.: Optimal classifier for imbalanced data using matthews correlation coefficient metric. PloS one 12(6), e0177678 (2017)\nPaoletti, N., Liu, K.S., Smolka, S.A. and Lin, S.: Data-driven robust control for type 1 diabetes under meal and exercise uncertainties. In International Conference on Computational Methods in Systems Biology, pages 214–232. Springer, (2017)\nAbadi M., Barham P., Chen J., Chen Z., Davis A., Dean J., Devin M., Ghemawat S., Irving G., Isard M., et al.: Tensorflow: A system for large-scale machine learning. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16), pages 265–283, (2016)\nPaszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L. and Desmaison, A. et al.: Pytorch: An imperative style, high-performance deep learning library. In Advances in Neural Information Processing Systems, pages 8024–8035, (2019)\nChollet, F. et al.: Keras: The Python deep learning library. Astrophysics Source Code Library, (2018)\nTran, D., Kucukelbir, A., Dieng, A.B., Rudolph, M., Liang, D. and Blei, D.M.: Edward: A library for probabilistic modeling, inference, and criticism. arXiv preprint arXiv:1610.09787, (2016)\nBingham, E., Chen, J.P., Jankowiak, M., Obermeyer, F., Pradhan, N., Karaletsos, T., Singh, R., Szerlip, P., Horsfall, P., Goodman, N.D.: Pyro: deep universal probabilistic programming. J. Mach. Learn. Res. 20(1), 973–978 (2019)\nYoon, H., Chou, Y., Chen, X., Frew, E. and Sankaranarayanan, S.: Predictive runtime monitoring for linear stochastic systems and applications to geofence enforcement for uavs. In International Conference on Runtime Verification, pages 349–367. Springer, (2019)\nStanley B., Taylor J.T., Marco C., Lui S.: Real-time reachability for verified simplex design. In Real-Time Systems Symposium (RTSS), 2014 IEEE, pages 138–148. IEEE, (2014)\nSauter, G., Dierks, H., Franzle, M. and Hansen, M.R.: Lightweight hybrid model checking facilitating online prediction of temporal properties. In Proceedings of the 21st Nordic Workshop on Programming Theory, pages 20–22, 2009\nDjeridane, B. and Lygeros, J.: Neural approximation of PDE solutions: An application to reachability computations. In Proceedings of the 45th IEEE Conference on Decision and Control, pages 3034–3039. IEEE, (2006)\nRoyo, V.R., Fridovich-Keil, D., Herbert, S. and Tomlin, C.J.: Classification-based approximate reachability with guarantees applied to safe trajectory tracking. arXiv preprint arXiv:1803.03237, (2018)\nYel, E., Carpenter, T.J., Di Franco, C., Ivanov, R., Kantaros, Y., Lee, I., Weimer, J., Bezzo, N.: Assured runtime monitoring and planning: toward verification of neural networks for safe autonomous operations. IEEE Robotics Automation Magazine 27(2), 102–116 (2020)\nIvanov, R., Weimer, J., Alur, R., Pappas, G.J. and Lee, I.: Verisig: verifying safety properties of hybrid systems with neural network controllers. In Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pages 169–178, (2019)\nBabaee R., Gurfinkel A., Fischmeister S.: Predictive run-time verification of discrete-time reachability properties in black-box systems using trace-level abstraction and statistical learning. In International Conference on Runtime Verification, pages 187–204. Springer, (2018)\nBabaee R., Ganesh V., Sedwards S.: Accelerated learning of predictive runtime monitors for rare failure. In International Conference on Runtime Verification, pages 111–128. Springer, (2019)\nQin, X. and Deshmukh, J.V.: Predictive monitoring for signal temporal logic with probabilistic guarantees. In Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pages 266–267. ACM, (2019)\nDokhanchi, A., Hoxha, B. and Fainekos, G.: On-line monitoring for temporal logic robustness. In International Conference on Runtime Verification, pages 231–246. Springer, (2014)\nDeshmukh J.V., Donze A., Ghosh S., Jin X., Juniwal G., Seshia S.A. (2017) Robust online monitoring of signal temporal logic. Formal Methods in System Design 51(1), 5–30\nBortolussi, L., Milios, D., Sanguinetti, G.: Smoothed model checking for uncertain continuous-time Markov chains. Inf. Comput. 247, 235–253 (2016)\nPop, R. and Fulop, P.: Deep ensemble bayesian active learning: Addressing the mode collapse issue in monte carlo dropout via ensembles. arXiv preprint arXiv:1811.03897, (2018)\nGal, Y., Islam, R. and Ghahramani, Z.: Deep bayesian active learning with image data. In Proceedings of the 34th International Conference on Machine Learning-Volume 70, pages 1183–1192. JMLR. org, (2017)\nDayoub, F., Sunderhauf, N. and Corke, P.I.: Episode-based active learning with bayesian neural networks. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, pages 26–28, (2017)\nMakili, Lázaro Emílio., Vega Sánchez, Jesús A., Dormido-Canto, Sebastián: Active learning using conformal predictors: application to image classification. Fusion Science and Technology 62(2), 347–355 (2012)\nToccaceli, P., Gammerman, A.: Combination of inductive mondrian conformal predictors. Mach. Learn. 108(3), 489–510 (2019)\nGammerman, A., Vovk, V.: Hedging predictions in machine learning. Comput. J. 50(2), 151–163 (2007)\nShafer, G., Vovk, V.: A tutorial on conformal prediction. J. Mach. Learn. Res. 9, 371–421 (2008)\nBalasubramanian, V.N., Gouripeddi, R., Panchanathan, S., Vermillion, J., Bhaskaran, A., & Siegel, R. M.: Support vector machine based conformal predictors for risk of complications following a coronary drug eluting stent procedure. In 2009 36th Annual Computers in Cardiology Conference (CinC), pages 5–8. IEEE, (2009)\nPhan, D., Paoletti, N., Zhang, T., Grosu, R., Smolka, S. A., Stoller, S. D.: Neural state classification for hybrid systems. ArXiv e-prints, July (2018)",{"EN":910},"Neural state classification (NSC) is a recently proposed method for runtime predictive monitoring of hybrid automata (HA) using deep neural networks (DNNs). NSC trains a DNN as an approximate reachability predictor that labels an HA state x as positive if an unsafe state is reachable from x within a given time bound, and labels x as negative otherwise. NSC predictors have very high accuracy, yet are prone to prediction errors that can negatively impact reliability. To overcome this limitation, we present neural predictive monitoring (NPM), a technique that complements NSC predictions with estimates of the predictive uncertainty. These measures yield principled criteria for the rejection of predictions likely to be incorrect, without knowing the true reachability values. We also present an active learning method that significantly reduces the NSC predictor’s error rate and the percentage of rejected predictions. We develop two versions of NPM based, respectively, on the use of frequentist and Bayesian techniques to learn the predictor and the rejection rule. Both versions are highly efficient, with computation times on the order of milliseconds, and effective, managing in our experimental evaluation to successfully reject almost all incorrect predictions. In our experiments on a benchmark suite of six hybrid systems, we found that the frequentist approach consistently outperforms the Bayesian one. We also observed that the Bayesian approach is less practical, requiring a careful and problem-specific choice of hyperparameters.",{"EN":912},"Neural predictive monitoring and a comparison of frequentist and Bayesian approaches",{"VOID":914},"10.1007\u002Fs10009-021-00623-1","2024-12-11T23:50:20.435+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-021-00623-1",[918,933,945,970,985],{"id":919,"sortIndex":240,"researcher":20,"roles":920,"affiliations":921,"properties":930},"67ea2010-988b-4302-944a-93a05596cfdf",[213],[922],{"id":20,"sortIndex":21,"affiliation":923,"properties":20},{"id":924,"createTime":925,"updateTime":925,"relativeEntities":926,"slug":20,"properties":927,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"9d9bd630-30da-42cb-95db-2eb60279486a","2024-02-13T01:17:32.641+00:00",[],{"title":928},{"VI":929},"Department of Computer Science, Stony Brook University, New York, USA",{"title":931},{"VI":932},"Scott A. Smolka",{"id":934,"sortIndex":393,"researcher":20,"roles":935,"affiliations":936,"properties":942},"e0e62ffd-7141-4831-8447-5a8bb205e369",[213],[937],{"id":20,"sortIndex":21,"affiliation":938,"properties":20},{"id":924,"createTime":925,"updateTime":925,"relativeEntities":939,"slug":20,"properties":940,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":941},{"VI":929},{"title":943},{"VI":944},"Scott D. Stoller",{"id":946,"sortIndex":21,"researcher":20,"roles":947,"affiliations":948,"properties":967},"a471c4a6-062b-4918-af1a-2b1e427704b2",[213],[949,957],{"id":20,"sortIndex":21,"affiliation":950,"properties":20},{"id":951,"createTime":952,"updateTime":952,"relativeEntities":953,"slug":20,"properties":954,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"131972f4-5c98-47d5-9531-54dd24639bb3","2024-02-13T01:17:32.604+00:00",[],{"title":955},{"VI":956},"Department of Mathematics and Geosciences, Università di Trieste, Trieste, Italy",{"id":958,"sortIndex":161,"affiliation":959,"properties":966},"f038df57-3021-400f-87af-212b9cde868e",{"id":960,"createTime":961,"updateTime":961,"relativeEntities":962,"slug":20,"properties":963,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"8aa690e4-f972-4ad1-ad37-d615dbf019d7","2024-02-13T01:17:32.589+00:00",[],{"title":964},{"VI":965},"Modelling and Simulation Group, Saarland University, Saarbrücken, Germany",{},{"title":968},{"VI":969},"Luca Bortolussi",{"id":971,"sortIndex":211,"researcher":20,"roles":972,"affiliations":973,"properties":982},"fa3a73bb-dec5-44ba-a863-9f3f28d5269b",[213],[974],{"id":20,"sortIndex":21,"affiliation":975,"properties":20},{"id":976,"createTime":977,"updateTime":977,"relativeEntities":978,"slug":20,"properties":979,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"6a71aad6-419c-4000-b291-61bbe2c21386","2024-01-05T20:09:57.548+00:00",[],{"title":980},{"VI":981},"Department of Computer Science, Royal Holloway, University of London, London, UK",{"title":983},{"VI":984},"Nicola Paoletti",{"id":986,"sortIndex":161,"researcher":20,"roles":987,"affiliations":988,"properties":994},"5a407834-cc03-471d-9e6c-ef7abf6c7e3e",[213],[989],{"id":20,"sortIndex":21,"affiliation":990,"properties":20},{"id":951,"createTime":952,"updateTime":952,"relativeEntities":991,"slug":20,"properties":992,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":993},{"VI":956},{"title":995},{"VI":996},"Francesca Cairoli",{"url":916,"publisher":998,"properties":1026},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":999,"slug":10,"properties":1000,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1004,"manageAffiliations":1005,"indexDatabases":1006,"url":104,"thumbnailPath":20,"statistic":1021,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":1001,"eissn":1002,"title":1003},{"VOID":13},{"VOID":15},{"EN":17},[],[],[1007,1014],{"id":66,"indexDatabase":1008,"url":81,"indexYears":20,"academicFieldIds":1013,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1009,"label":1010,"description":1011,"key":77,"publicationTags":1012,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":1015,"url":98,"indexYears":99,"academicFieldIds":1020,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":1016,"label":1017,"description":1018,"key":95,"publicationTags":1019,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":1022,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":1023,"totalCitation":139,"totalCitationByYear":1024,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":1025,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":1027,"pages":1028},{"VOID":895},{"VOID":1029},"615-640","2021-05-24",{"id":1032,"createTime":1033,"updateTime":1034,"relativeEntities":1035,"slug":1036,"properties":1037,"entityType":206,"verifyStatus":319,"verifyTime":1034,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":1046,"fullTextUrl":20,"authors":1047,"publicationType":266,"publisherRelationship":1107,"citationCount":20,"citationInfo":20,"publishDate":1140,"publishYear":1141,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"ff8178c1-0dd9-43df-8542-f0b2f5ddb80b","2024-01-29T09:26:19.421+00:00","2024-12-08T23:46:05.606+00:00",[],"LearnLib-a-framework-for-extrapolating-behavioral-models",{"references":1038,"abstract":1040,"title":1042,"doi":1044},{"VOID":1039},"Alur, R., Cerny, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: POPL ’05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 98–109. ACM Press, New York, NY, USA (2005)\nAngluin D.: Learning regular sets from queries and counterexamples. Inf. Comput. 2(75), 87–106 (1987)\nBerg T., Grinchtein O., Jonsson B., Leucker M., Raffelt H., Steffen B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (eds) Proceedings of 8th International Conference on Fundamental Approaches to Software Engineering (FASE’05), LNCS, vol. 3442, pp. 175–189. Springer, New York (2005)\nBroy M., Jonsson B., Katoen J.P., Leucker M., Pretschner A.: Model-based Testing of Reactive Systems, LNCS, vol. 3472. Springer, New York (2005)\nBrun, Y., Ernst, M.D.: Finding latent code errors via machine learning over program executions. In: Proceedings of the 26th International Conference on Software Engineering (ICSE’04), pp. 480–490. Edinburgh, Scotland (2004)\nChow T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Softw. Eng. 4(3), 178–187 (1978)\nCobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Proceedings of the 9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), LNCS, vol. 2619, pp. 331–346. Springer, Berlin\u002FHeidelberg (2003)\nCook J.E., Wolf A.L.: Discovering models of software processes from event-based data. (TOSEM) ACM Trans. Softw. Eng. Methodol. 7(3), 215–249 (1998)\nCook, J.E., Du, Z., Liu, C., Wolf, A.L.: Discovering models of behavior for concurrent systems. Technical Report, New Mexico State University, Deppartment of Computer Science. NMSU-CS-2002-010 (2002)\nde la Higuera C.: A bibliographical study of grammatical inference. Pattern Recognit. 38, 1332–1348 (2005)\nErnst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering 27(2), 1–25 (2001). A previous version appeared in ICSE ’99, Proceedings of the 21st International Conference on Software Engineering, pp. 213–224. Los Angeles, CA, USA, May 19–21 (1999)\nErnst, M.D., Czeisler, A., Griswold, W.G., Notkin, D.: Quickly detecting relevant program invariants. In: Proceedings of 22nd International Conference on Software Engineering (ICSE’00), pp. 449–458 (2000)\nFujiwara S., von Bochmann G., Khendek F., Amalou M., Ghedamsi A.: Test selection based on finite state models. IEEE Trans. Softw. Eng. 17(6), 591–603 (1991)\nGaravel H.: Open\u002Fcaesar: an open software architecture for verification, simulation, and testing. In: Steffen, B. (eds) Proceedings of the 1st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), LNCS, vol. 1384, pp. 68–84. Springer, New York (1998)\nGroce A., Peled D., Yannakakis M.: Adaptive model checking. In: Katoen, J.P., Stevens, P. (eds) Proceedings of the 8th Internation Conference on Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 2280, pp. 357–370. Springer, New York (2002)\nHabermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. In: Proceedings of 6th International Workshop on Verification of Infinite State Systems (INFINITY 2004), Electronic Notes in Theoretical Computer Science, vol. 138, pp. 21–36. Elsevier Science (2005)\nHagerer A., Margaria T., Niese O., Steffen B., Brune G., Ide H.D.: Efficient regression testing of cti-systems: Testing a complex call-center solution. Annu. Rev. Commun. Int. Eng. Consort. (IEC), Chicago (USA) 55, 1033–1040 (2001)\nHagerer A., Hungar H., Niese O., Steffen B.: Model generation by moderated regular extrapolation. In: Kutsche, H.W.R. (eds) Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering (FASE’02), LNCS, vol. 2306, pp. 80–95. Springer, Heidelberg, Germany (2002)\nhttp:\u002F\u002Fdblp.uni-trier.de\u002Frec\u002Fbibtex\u002Fconf\u002Ficeccs\u002FMargariaRSL07\nHungar H., Steffen B.: Behavior-based model construction. Int. J. Softw. Tools Technol. Transf. (STTT) 6(1), 4–14 (2004)\nHungar, H., Margaria, T., Steffen, B.: Test-based model generation for legacy systems. In: Proceedings of 2003 International Test Conference (ITC 2003), pp. 971–980. IEEE Computer Society, Charlotte, NC (2003)\nJörges, S., Kubczak, C., Nagel, R., Margaria, T., Steffen, B.: Model-driven development with the jabc. In: Proceedings of Haifa verification conference 2006 (HVC 2006), LNCS, vol. 4383, pp. 92–108. Springer, Berlin\u002FHeidelberg (2007)\nKubczak, C., Margaria, T., Nagel, R., Steffen, B.: Plug and play with FMICS-jETI: beyond scripting and coding. ERCIM News N. 73, April 2008, pp. 41–42. http:\u002F\u002Fercim-news.ercim.org\u002Fcontent\u002Fview\u002F346\u002F539\u002F\nLee D., Yannakakis M.: Principles and methods of testing finite state machines—a survey. Proc. IEEE 84(8), 1090–1126 (1996)\nMargaria, T., Niese, O., Steffen, B., Erochok, A.: System level testing of virtual switch (re-)configuration over ip. In: Proceedings of the IEEE European Test Workshop (ETW’02), pp. 67–74. IEEE Computer Society Press (2002). ETW2002\nMargaria, T., Nagel, R., Steffen, B.: Remote integration and coordination of verification tools in JETI. In: Proceedings of the 12th IEEE International Conference on the Engineering of Computer-Based Systems (ECBS 2005), pp. 431–436. IEEE Computer Society (2005)\nMargaria, T., Raffelt, H., Steffen, B.: Analyzing second-order effects between optimizations for system-level test-based model generation. In: Proceedings of IEEE International Test Conference (ITC’05), pp. 7, 467. IEEE Computer Society (2005)\nMargaria, T., Hinchey, M.G., Raffelt, H., Rash, J., Rouff, C.A., Steffen, B.: Completing and adapting models of biological processes. In: Proceedings of IFIP Conference on Biologically Inspired Cooperative Computing (BiCC 2006), Santiago (Chile), pp. 43–54. Springer (2006)\nMariani, L., Pezzè, M.: A technique for verifying component-based software. In: Proceedings of Interantional Workshop on Test and Analysis of Component Based Systems (TACoS’04), pp. 17–30 (2004)\nMüller-Olm M., Schmidt D., Steffen B.: Model-checking: a tutorial introduction. In: Cortesi, G.F.A. (eds) Proceedings of Static Analysis Symposium (SAS’99), Venice, Italy, LNCS, vol. 1694, pp. 330–354. Springer, Heidelberg, Germany (1999)\nNiese, O., Steffen, B., Margaria, T., Hagerer, A., Brune, G., Ide, H.D.: Library-based design and consistency checking of system-level industrial test cases. In: Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering (FASE ’01), LNCS, vol. 2029, pp. 233–248. Springer, London, UK (2001)\nNimmer, J.W., Ernst, M.D.: Automatic generation of program specifications. In: Proceedings of the 2002 International Symposium on Software Testing and Analysis (ISSTA’02), pp. 229–239. Rome, Italy (2002)\nPeled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Proceedings of the Joint International Conference on Formal Description Techniques for Distributed System and Communication\u002FProtocols and Protocol Specification, Testing and Verification FORTE\u002FPSTV ’99: pp. 225–240. Kluwer Academic Publishers (1999)\nRaffelt, H., Steffen, B.: Learnlib: A library for automata learning and experimentation. In: Baresi, L., Heckel, R. (eds.) Proceedings of 9th International Conference on Fundamental Approaches to Software Engineering (FASE 2006), LNCS, vol. 3922, pp. 377–380. Springer (2006)\nRaffelt, H., Steffen, B., Margaria, T.: Dynamic testing via automata learning. In: Proceedings of the Haifa Verification Conference 2007 (HVC ’07), LNCS, vol. 4899, pp. 136–152. Springer, Berlin, Heidelberg (2008)\nSabnani K., Dahbura A.: A protocol test generation procedure. Comput. Netw. ISDN Syst. 15(4), 285–297 (1988)\nShen, Y.N., Lombardi, F., Dahbura, A.T.: Protocol conformance testing using multiple uio sequences. In: Proceedings of the 9th International Symposium on Protocol Specification, Testing and Verification, pp. 131–143. North-Holland (1990)\nSteffen, B., Hungar, H.: Behavior-based model construction. In: Mukhopadhyay, S., Zuck, L. (eds.) Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI’03), LNCS, vol. 2575, pp. 5–19. Springer (2003)\nSteffen, B., Margaria, T., Raffelt, H., Niese, O.: Efficient test-based model generation of legacy systems. In: Proceedings of the 9th IEEE International Workshop on High Level Design Validation and Test (HLDVT’04), pp. 95–100. IEEE Computer Society Press, Sonoma, CA, USA (2004)\nSteffen B., Margaria T., Nagel R.: jETI: A tool for remote tool integration. In: Halbwachs, N., Zuck, L.D. (eds) Proceedings of 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’05):, LNCS, vol. 3440, Springer, Edinburgh, UK (2005)\nVuong, S., Chan, W., Ito, M.: The UIOv-method for protocol test sequence generation. In: de Meer, J., Machert, L., Effelsberg, W. (eds.) Proceedings of 2nd International Workshop on Protocol Testing Systems (IWPTS’89), pp. 161–175. North-Holland (1990)\nXie, T., Notkin, D.: Mutually enhancing test generation and specification inference. In: Petrenko, A., Ulrich, A. (eds.) Proceedings of 3rd International Workshop on Formal Approaches to Testing of Software (FATES’03), LNCS, vol. 2931, pp. 60–69. Springer (2004)",{"EN":1041},"In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of their envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios.",{"EN":1043},"LearnLib: a framework for extrapolating behavioral models",{"VOID":1045},"10.1007\u002Fs10009-009-0111-8","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-009-0111-8",[1048,1063,1080,1095],{"id":1049,"sortIndex":240,"researcher":20,"roles":1050,"affiliations":1051,"properties":1060},"a81eae15-6dcb-45a8-ad68-5d32404589c4",[213],[1052],{"id":20,"sortIndex":21,"affiliation":1053,"properties":20},{"id":1054,"createTime":1055,"updateTime":1055,"relativeEntities":1056,"slug":20,"properties":1057,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"1a3f8341-d2e7-4431-8a81-652418be53e9","2024-01-29T09:26:19.467+00:00",[],{"title":1058},{"VI":1059},"Chair of Services and Software Engineering, Universität Potsdam, Potsdam, Germany",{"title":1061},{"VI":1062},"Tiziana Margaria",{"id":1064,"sortIndex":211,"researcher":20,"roles":1065,"affiliations":1066,"properties":1077},"ea1d426f-cebc-465a-94a2-93b3138d60c7",[213],[1067],{"id":20,"sortIndex":21,"affiliation":1068,"properties":20},{"id":1069,"createTime":1070,"updateTime":1071,"relativeEntities":1072,"slug":1073,"properties":1074,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"b32365c4-8753-4f6f-840a-c9760e273b1e","2023-12-13T20:27:43.054+00:00","2024-12-30T09:18:17.200+00:00",[],"Department-of-Information-Technology-Uppsala-University-Uppsala-Sweden",{"title":1075},{"VI":1076},"Department of Information Technology, Uppsala University, Uppsala, Sweden",{"title":1078},{"VI":1079},"Therese Berg",{"id":1081,"sortIndex":161,"researcher":20,"roles":1082,"affiliations":1083,"properties":1092},"800b5333-2aaa-4dee-b306-e71fb9560968",[213],[1084],{"id":20,"sortIndex":21,"affiliation":1085,"properties":20},{"id":1086,"createTime":1087,"updateTime":1087,"relativeEntities":1088,"slug":20,"properties":1089,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"69439fdb-3aa3-4e5d-8926-1e18409f47f7","2023-12-08T02:46:23.606+00:00",[],{"title":1090},{"VI":1091},"Chair of Programming Systems, TU Dortmund, Dortmund, Germany",{"title":1093},{"VI":1094},"Bernhard Steffen",{"id":1096,"sortIndex":21,"researcher":20,"roles":1097,"affiliations":1098,"properties":1104},"1fbf06de-10f7-4d8f-b922-cce29cc2c65d",[213],[1099],{"id":20,"sortIndex":21,"affiliation":1100,"properties":20},{"id":1086,"createTime":1087,"updateTime":1087,"relativeEntities":1101,"slug":20,"properties":1102,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1103},{"VI":1091},{"title":1105},{"VI":1106},"Harald Raffelt",{"url":1046,"publisher":1108,"properties":1136},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1109,"slug":10,"properties":1110,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1114,"manageAffiliations":1115,"indexDatabases":1116,"url":104,"thumbnailPath":20,"statistic":1131,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":1111,"eissn":1112,"title":1113},{"VOID":13},{"VOID":15},{"EN":17},[],[],[1117,1124],{"id":66,"indexDatabase":1118,"url":81,"indexYears":20,"academicFieldIds":1123,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1119,"label":1120,"description":1121,"key":77,"publicationTags":1122,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":1125,"url":98,"indexYears":99,"academicFieldIds":1130,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":1126,"label":1127,"description":1128,"key":95,"publicationTags":1129,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":1132,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":1133,"totalCitation":139,"totalCitationByYear":1134,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":1135,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":1137,"pages":1139},{"VOID":1138},"11",{"VOID":440},"2009-04-10",2009,{"id":1143,"createTime":1144,"updateTime":1145,"relativeEntities":1146,"slug":1147,"properties":1148,"entityType":206,"verifyStatus":319,"verifyTime":1145,"verifyNote":320,"syncStatus":19,"languages":1159,"translateLanguages":20,"viewCount":21,"primaryUrl":1160,"fullTextUrl":20,"authors":1161,"publicationType":266,"publisherRelationship":1240,"citationCount":1269,"citationInfo":1270,"publishDate":1272,"publishYear":1273,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":1274,"isForceReanalyzing":303},"fb3b95d5-d4f3-481e-afe1-a8abe8910dbb","2024-04-15T00:06:54.195+00:00","2025-02-17T23:39:49.652+00:00",[],"Efficient-debugging-in-a-formal-verification-environment",{"mag":1149,"keywords":1151,"openalex":1152,"abstract":1154,"title":1155,"doi":1157},{"VOID":1150},"1988316905",{},{"VOID":1153},"W1988316905",{},{"EN":1156},"Efficient debugging in a formal verification environment",{"VOID":1158},"10.1007\u002Fs10009-002-0097-y",[564],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10009-002-0097-y",[1162,1180,1194,1208,1222],{"id":1163,"sortIndex":211,"researcher":20,"roles":1164,"affiliations":1165,"properties":1175},"32b2fb99-02b0-4fc2-9656-6a0895dfd99c",[],[1166],{"id":20,"sortIndex":21,"affiliation":1167,"properties":20},{"id":1168,"createTime":1169,"updateTime":1169,"relativeEntities":1170,"slug":1171,"properties":1172,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"f4791b50-8065-44db-9fd3-c3b4843570c3","2024-04-15T00:06:54.281+00:00",[],"Logic-and-Validation-Technology-Intel-Corporation-Haifa-Israel",{"title":1173},{"EN":1174},"Logic and Validation Technology, Intel Corporation, Haifa, Israel",{"openalex":1176,"title":1178},{"VOID":1177},"A5085576248",{"EN":1179},"Osnat Weissberg",{"id":1181,"sortIndex":393,"researcher":20,"roles":1182,"affiliations":1183,"properties":1189},"72663151-d55c-42c2-8df9-195b8cfac964",[],[1184],{"id":20,"sortIndex":21,"affiliation":1185,"properties":20},{"id":1168,"createTime":1169,"updateTime":1169,"relativeEntities":1186,"slug":1171,"properties":1187,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1188},{"EN":1174},{"openalex":1190,"title":1192},{"VOID":1191},"A5032288384",{"EN":1193},"Gila Kamhi",{"id":1195,"sortIndex":21,"researcher":20,"roles":1196,"affiliations":1197,"properties":1203},"146ec993-27ea-45ec-8ef6-55880b92d2e8",[],[1198],{"id":20,"sortIndex":21,"affiliation":1199,"properties":20},{"id":1168,"createTime":1169,"updateTime":1169,"relativeEntities":1200,"slug":1171,"properties":1201,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1202},{"EN":1174},{"openalex":1204,"title":1206},{"VOID":1205},"A5084006835",{"EN":1207},"Fady Copty",{"id":1209,"sortIndex":161,"researcher":20,"roles":1210,"affiliations":1211,"properties":1217},"5a69bd01-7ada-4cf7-bb69-0162f784a92a",[],[1212],{"id":20,"sortIndex":21,"affiliation":1213,"properties":20},{"id":1168,"createTime":1169,"updateTime":1169,"relativeEntities":1214,"slug":1171,"properties":1215,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1216},{"EN":1174},{"openalex":1218,"title":1220},{"VOID":1219},"A5088775149",{"EN":1221},"Amitai Irron",{"id":1223,"sortIndex":240,"researcher":20,"roles":1224,"affiliations":1225,"properties":1235},"6032c5ba-a8d4-4229-88b4-ba5458b8ac6e",[],[1226],{"id":20,"sortIndex":21,"affiliation":1227,"properties":20},{"id":1228,"createTime":1229,"updateTime":1229,"relativeEntities":1230,"slug":1231,"properties":1232,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"ba9f14ec-2fcb-4bc6-8603-22934addf4c8","2024-04-15T00:06:54.294+00:00",[],"Microprocessor-Group-Intel-Corporation-USA-US",{"title":1233},{"EN":1234},"Microprocessor Group, Intel Corporation, USA, , US",{"openalex":1236,"title":1238},{"VOID":1237},"A5076416389",{"EN":1239},"Nathan P. Kropp",{"url":20,"publisher":1241,"properties":20},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1242,"slug":10,"properties":1243,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1247,"manageAffiliations":1248,"indexDatabases":1249,"url":104,"thumbnailPath":20,"statistic":1264,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":1244,"eissn":1245,"title":1246},{"VOID":13},{"VOID":15},{"EN":17},[],[],[1250,1257],{"id":66,"indexDatabase":1251,"url":81,"indexYears":20,"academicFieldIds":1256,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1252,"label":1253,"description":1254,"key":77,"publicationTags":1255,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":1258,"url":98,"indexYears":99,"academicFieldIds":1263,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":1259,"label":1260,"description":1261,"key":95,"publicationTags":1262,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":1265,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":1266,"totalCitation":139,"totalCitationByYear":1267,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":1268,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},17,{"total":1269,"publishYear":20,"statisticByYear":1271},{"2012":161,"2014":161,"2015":161,"2022":211},"2003-05-01",2003,[],{"id":1276,"createTime":1277,"updateTime":1277,"relativeEntities":1278,"slug":1279,"properties":1280,"entityType":206,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":1291,"translateLanguages":20,"viewCount":21,"primaryUrl":1292,"fullTextUrl":20,"authors":1293,"publicationType":266,"publisherRelationship":1349,"citationCount":240,"citationInfo":1384,"publishDate":1272,"publishYear":1273,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":1386,"isForceReanalyzing":303},"14687201-3fc4-4ce6-b59d-97c7ce12e98f","2024-04-19T23:38:11.425+00:00",[],"Refinement-based-formal-verification-with-heterogeneous-timing",{"mag":1281,"keywords":1283,"openalex":1284,"abstract":1286,"title":1287,"doi":1289},{"VOID":1282},"2058806531",{},{"VOID":1285},"W2058806531",{},{"EN":1288},"Refinement-based formal verification with heterogeneous timing",{"VOID":1290},"10.1007\u002Fs10009-002-0096-z",[564],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10009-002-0096-z",[1294,1314,1329],{"id":1295,"sortIndex":161,"researcher":20,"roles":1296,"affiliations":1297,"properties":1309},"fd6246f1-f1a1-4f60-9b24-28eb1748a5e8",[],[1298],{"id":1299,"sortIndex":21,"affiliation":1300,"properties":20},"9c84787e-b3ae-4b0f-9074-ee1e2cc35689",{"id":1301,"createTime":1302,"updateTime":1303,"relativeEntities":1304,"slug":1305,"properties":1306,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"186fbefd-d14a-436d-a16c-8c1512ccab68","2024-04-19T23:38:11.436+00:00","2024-10-21T08:58:51.100+00:00",[],"Dept-of-ECE-McGill-University-Montreal-Quebec-Canada-H3A-2A7-E-mail-kong-radu-macs-ece-mcgill-ca-CA",{"title":1307},{"EN":1308},"Dept. of ECE, McGill University, Montreal, Quebec, Canada, H3A 2A7; E-mail: {kong,radu}@macs.ece.mcgill.ca, CA",{"openalex":1310,"title":1312},{"VOID":1311},"A5048089245",{"EN":1313},"R. Negulescu",{"id":1315,"sortIndex":21,"researcher":20,"roles":1316,"affiliations":1317,"properties":1324},"40cc7037-b03c-481a-b90d-baeff4d30338",[],[1318],{"id":1319,"sortIndex":21,"affiliation":1320,"properties":20},"b4f904e4-e400-4f03-9243-4bbaf3497caf",{"id":1301,"createTime":1302,"updateTime":1303,"relativeEntities":1321,"slug":1305,"properties":1322,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1323},{"EN":1308},{"openalex":1325,"title":1327},{"VOID":1326},"A5055310909",{"EN":1328},"Xiaohua Kong",{"id":1330,"sortIndex":211,"researcher":20,"roles":1331,"affiliations":1332,"properties":1344},"b33ca7d1-9171-48db-830a-589d02c60dca",[],[1333],{"id":1334,"sortIndex":21,"affiliation":1335,"properties":20},"9166ff36-83dd-4c4f-8288-a30a24ebd978",{"id":1336,"createTime":1337,"updateTime":1338,"relativeEntities":1339,"slug":1340,"properties":1341,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"356cb5b7-69f0-4462-bf2d-c05a9446f495","2024-04-19T23:38:11.468+00:00","2024-10-16T01:25:06.085+00:00",[],"Qualcomm-Incorporated-San-Diego-CA-92121-USA-E-mail-ying-qualcomm-com-US",{"title":1342},{"EN":1343},"Qualcomm Incorporated, San Diego, CA 92121, USA; E-mail: ying@qualcomm.com, US",{"openalex":1345,"title":1347},{"VOID":1346},"A5006698597",{"EN":1348},"Larry Weidong Ying",{"url":20,"publisher":1350,"properties":1378},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1351,"slug":10,"properties":1352,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1356,"manageAffiliations":1357,"indexDatabases":1358,"url":104,"thumbnailPath":20,"statistic":1373,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":1353,"eissn":1354,"title":1355},{"VOID":13},{"VOID":15},{"EN":17},[],[],[1359,1366],{"id":66,"indexDatabase":1360,"url":81,"indexYears":20,"academicFieldIds":1365,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1361,"label":1362,"description":1363,"key":77,"publicationTags":1364,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":1367,"url":98,"indexYears":99,"academicFieldIds":1372,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":1368,"label":1369,"description":1370,"key":95,"publicationTags":1371,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":1374,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":1375,"totalCitation":139,"totalCitationByYear":1376,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":1377,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":1379,"pages":1381,"issue":1383},{"VOID":1380},"4",{"VOID":1382},"359-370",{"VOID":543},{"total":240,"publishYear":20,"statisticByYear":1385},{},[],{"id":1388,"createTime":1389,"updateTime":1390,"relativeEntities":1391,"slug":1392,"properties":1393,"entityType":206,"verifyStatus":319,"verifyTime":1402,"verifyNote":320,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"primaryUrl":1403,"fullTextUrl":20,"authors":1404,"publicationType":266,"publisherRelationship":1462,"citationCount":20,"citationInfo":20,"publishDate":1496,"publishYear":1141,"citationAnalyzeStatus":19,"lastCitationAnalyze":20,"indexDatabases":20,"openAccess":20,"references":20,"isForceReanalyzing":303},"3e60b9a3-0fd6-44f2-a2b6-6277615e4c9e","2024-01-03T11:18:14.268+00:00","2025-01-26T23:36:55.404+00:00",[],"Don-t-care-in-SMT-building-flexible-yet-efficient-abstraction-refinement-solvers",{"references":1394,"abstract":1396,"title":1398,"doi":1400},{"VOID":1395},"Ball, T., Lahiri, S.K., Musuvathi, M.: Zap: Automated theorem proving for software analysis. In: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), pp 2–22 (2005)\nBarrett, C., Berezin, S.: CVC Lite: A new implementation of the cooperating validity checker. In: Computer Aided Verification (CAV), pp 515–518 (2004)\nBauer, A.: Simplifying diagnosis using LSAT: a propositional approach to reasoning from first principles. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR), pp 49–63 (2005)\nBauer, A., Leucker, M., Schallhart, C., Tautschnig, M.: Don’t care in SMT—building flexible yet efficient abstraction\u002Frefinement solvers. In: Proceedings of the 2007 ISoLA Workshop On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA’07), France, RNTI, Revue des Nouvelles Technologies de l’Information (2007a)\nBauer, A., Pister, M., Tautschnig, M.: Tool-support for the analysis of hybrid systems and models. In: Design, Automation and Test in Europe (DATE), pp 924–929 (2007b)\nBelov, A., Stachniak, Z.: Substitutional definition of satisfiability in classical propositional logic. In: Theory and Applications of Satisfiability Testing (SAT), pp 31–45 (2005)\nBozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T., van Rossum, P., Schulz, S., Sebastiani, R.: An incremental and layered procedure for the satisfiability of linear arithmetic logic. In: Tools and Algorithms for Construction and Analysis of Systems (TACAS), pp 317–333 (2005)\nDelgrande J.P., Gupta A.: The complexity of minimum partial truth assignments and implication in negation-free formulae. Ann. Math. Artif. Intell. 18(1), 51–67 (1996)\nDIMACS: Satisfiability: Suggested format. Tech. rep. (1993)\nDutertre, B., de Moura, L.M.: A fast linear-arithmetic solver for DPLL(T). In: Computer Aided Verification (CAV), pp 81–94 (2006)\nEen, N., Sörensson, N.: An extensible sat-solver. In: Theory and Application of Satisfiability Testing (SAT), pp 502–518 (2003)\nGanzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast decision procedures. In: Computer Aided Verification (CAV), pp 175–188 (2004)\nHalbwachs N., Caspi P., Raymond P., Pilaud D.: The synchronous dataflow programming language. Lustre 79(9), 1305–1320 (1991)\nJones, R.B., Dill, D.L.: Automatic verification of pipelined microprocessors control. In: Computer Aided Verification (CAV), pp 68–80 (1994)\nKirousis L.M., Kolaitis P.G.: The complexity of minimal satisfiability problems. Inf. Comput. 187(1), 20–39 (2003)\nLahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT techniques for fast predicate abstraction. In: Computer Aided Verification (CAV), pp 424–437 (2006)\nLougee-Heimer R.: The common optimization interface for operations research: promoting open-source software in the operations research community. IBM. J. Res. Dev. 47(1), 57–66 (2003)\nLynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics (2006)\nMarques-Silva, J.P., Sakallah, K.A.: GRASP—a new search algorithm for satisfiability. In: International Conference on Computer-Aided Design (ICCAD), pp 220–227 (1996)\nMoskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Design Automation Conference (DAC), pp 530–535 (2001)\nPrasad M.R., Biere A., Gupta A.: A survey of recent advances in sat-based formal verification. Softw. Tools Technol. Transf. 7(2), 156–173 (2005)\nRanise, S., Tinelli, C.: The SMT-LIB Standard: Version 1.2. Techical report, Department of Computer Science, University of Iowa, http:\u002F\u002Fwww.SMT-LIB.org (2006)\nRodeh Y., Strichman O.: Building small equality graphs for deciding equailty logic with uninterpreted functions. Inf. Comput. 204(1), 26–59 (2006)\nRoorda, J.W., Claessen, K.: SAT-based assistance in abstraction refinement for symbolic trajectory evaluation. In: Computer Aided Verification (CAV), pp 175–189 (2006)\nRushby, J: Harnessing disruptive innovation in formal verification. In: Softw. Eng. Formal Methods, pp 21–30 (2006a)\nRushby, J.: Tutorial: automated formal methods with PVS, SAL, and Yices. In: Software Engineering and Formal Methods (SEFM), p 262 (2006b)\nSheini, H., Sakallah, K.: From propositional satisfiability to satisfiability modulo theories. In: Theory and Applications of Satisfiability Testing (SAT), pp 1–9 (2006)\nSheini, H.M., Sakallah, K.A.: A scalable method for solving satisfiability of integer linear arithmetic logic. In: Theory and Application of Satisfiability Testing (SAT), pp 241–256 (2005)\nShostak R.: Deciding linear inequalities by computing loop residues. J. ACM 28(4), 769–779 (1981)\nWächter A., Biegler L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optim. 16(1), 1–31 (2005)\nWeber, T.: A SAT-based Sudoku solver. In: Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), Short Paper Proceedings, pp 11–15 (2005)\nZantema, H., Groote, J.F.: Transforming equality logic to propositional logic. Electr. Notes. Theor. Comput. Sci. 86(1) (2003)",{"EN":1397},"This paper describes a method for combining “off-the-shelf” SAT and constraint solvers for building an efficient Satisfiability Modulo Theories (SMT) solver for a wide range of theories. Our method follows the abstraction\u002Frefinement approach to simplify the implementation of custom SMT solvers. The expected performance penalty by not using an interweaved combination of SAT and theory solvers is reduced by generalising a Boolean solution of an SMT problem first via assigning don’t care to as many variables as possible. We then use the generalised solution to determine a thereby smaller constraint set to be handed over to the constraint solver for a background theory. We show that for many benchmarks and real-world problems, this optimisation results in considerably smaller and less complex constraint problems. The presented approach is particularly useful for assembling a practically viable SMT solver quickly, when neither a suitable SMT solver nor a corresponding incremental theory solver is available. We have implemented our approach in the ABsolver framework and applied the resulting solver successfully to an industrial case-study: the verification problems arising in verifying an electronic car steering control system impose non-linear arithmetic constraints, which do not fall into the domain of any other available solver.",{"EN":1399},"Don’t care in SMT: building flexible yet efficient abstraction\u002Frefinement solvers",{"VOID":1401},"10.1007\u002Fs10009-009-0133-2","2025-01-26T23:36:55.403+00:00","https:\u002F\u002Flink.springer.com\u002Farticle\u002F10.1007\u002Fs10009-009-0133-2",[1405,1420,1435,1450],{"id":1406,"sortIndex":211,"researcher":20,"roles":1407,"affiliations":1408,"properties":1417},"e65f24f0-6831-4075-9c5e-31a818b8de2a",[213],[1409],{"id":20,"sortIndex":21,"affiliation":1410,"properties":20},{"id":1411,"createTime":1412,"updateTime":1412,"relativeEntities":1413,"slug":20,"properties":1414,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"57956a0b-ae69-4475-b039-58acae3f3e06","2024-01-03T11:18:14.368+00:00",[],{"title":1415},{"VI":1416},"FB Informatik, Technische Universität Darmstadt, Darmstadt, Germany",{"title":1418},{"VI":1419},"Christian Schallhart",{"id":1421,"sortIndex":21,"researcher":20,"roles":1422,"affiliations":1423,"properties":1432},"9b8dcdd9-93a7-4889-9252-4342333de618",[213],[1424],{"id":20,"sortIndex":21,"affiliation":1425,"properties":20},{"id":1426,"createTime":1427,"updateTime":1427,"relativeEntities":1428,"slug":20,"properties":1429,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"d4bcadd8-8c76-41ba-99c4-851d3e4a0be8","2024-01-03T11:18:14.279+00:00",[],{"title":1430},{"VI":1431},"Australian National University and National ICT Australia (NICTA), Canberra, Australia",{"title":1433},{"VI":1434},"Andreas Bauer",{"id":1436,"sortIndex":161,"researcher":20,"roles":1437,"affiliations":1438,"properties":1447},"73a5fb8a-32eb-4a5e-9962-69df7922da78",[213],[1439],{"id":20,"sortIndex":21,"affiliation":1440,"properties":20},{"id":1441,"createTime":1442,"updateTime":1442,"relativeEntities":1443,"slug":20,"properties":1444,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},"b4ba48e9-4f7f-4f19-87df-83df75f526e8","2024-01-18T18:08:27.519+00:00",[],{"title":1445},{"VI":1446},"Institut für Informatik, Technische Universität München, Munich, Germany",{"title":1448},{"VI":1449},"Martin Leucker",{"id":1451,"sortIndex":240,"researcher":20,"roles":1452,"affiliations":1453,"properties":1459},"66cd9176-ab0a-422c-8785-6b006b8a442b",[213],[1454],{"id":20,"sortIndex":21,"affiliation":1455,"properties":20},{"id":1411,"createTime":1412,"updateTime":1412,"relativeEntities":1456,"slug":20,"properties":1457,"entityType":49,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21},[],{"title":1458},{"VI":1416},{"title":1460},{"VI":1461},"Michael Tautschnig",{"url":1403,"publisher":1463,"properties":1491},{"id":6,"createTime":7,"updateTime":8,"relativeEntities":1464,"slug":10,"properties":1465,"entityType":18,"verifyStatus":19,"verifyTime":20,"verifyNote":20,"syncStatus":19,"languages":20,"translateLanguages":20,"viewCount":21,"subjectFields":1469,"manageAffiliations":1470,"indexDatabases":1471,"url":104,"thumbnailPath":20,"statistic":1486,"gsStatistic":20,"type":188,"analyzePriority":20},[],{"issn":1466,"eissn":1467,"title":1468},{"VOID":13},{"VOID":15},{"EN":17},[],[],[1472,1479],{"id":66,"indexDatabase":1473,"url":81,"indexYears":20,"academicFieldIds":1478,"indexDatabaseRanking":20},{"id":68,"createTime":69,"updateTime":70,"relativeEntities":1474,"label":1475,"description":1476,"key":77,"publicationTags":1477,"standard":20},[],{"EN":73,"VI":73},{"VI":75,"EN":76},[79,80],[83],{"id":85,"indexDatabase":1480,"url":98,"indexYears":99,"academicFieldIds":1485,"indexDatabaseRanking":103},{"id":87,"createTime":88,"updateTime":89,"relativeEntities":1481,"label":1482,"description":1483,"key":95,"publicationTags":1484,"standard":20},[],{"EN":92,"VI":92},{"EN":92,"VI":94},[97],[101,102],{"impactFactor":21,"impactFactorByYear":1487,"i10Index":118,"i10IndexLast5Year":119,"totalPublication":120,"totalPublicationByYear":1488,"totalCitation":139,"totalCitationByYear":1489,"totalCitationPerPublication":162,"totalCitationPerPublicationByYear":1490,"hindexLast5Year":124,"hindex":124},{"2012":107,"2013":108,"2014":109,"2015":110,"2016":110,"2017":111,"2018":112,"2019":113,"2020":114,"2021":115,"2022":116,"2023":117},{"1998":122,"1999":119,"2000":119,"2001":122,"2002":62,"2003":123,"2004":124,"2005":125,"2006":126,"2007":123,"2008":127,"2009":125,"2010":128,"2011":129,"2012":130,"2013":125,"2014":131,"2015":132,"2016":133,"2017":127,"2018":134,"2019":133,"2020":135,"2021":131,"2022":136,"2023":137,"2024":138},{"1998":141,"2000":142,"2001":143,"2003":144,"2004":145,"2005":146,"2006":147,"2007":148,"2008":149,"2009":150,"2010":151,"2011":152,"2012":153,"2013":129,"2014":154,"2015":152,"2016":155,"2017":156,"2018":157,"2019":158,"2020":159,"2021":160,"2022":154,"2023":130,"2024":161},{"1998":164,"2000":165,"2001":166,"2003":167,"2004":168,"2005":169,"2006":170,"2007":171,"2008":172,"2009":173,"2010":174,"2011":175,"2012":176,"2013":177,"2014":178,"2015":179,"2016":180,"2017":181,"2018":182,"2019":183,"2020":184,"2021":185,"2022":185,"2023":186,"2024":187},{"volume":1492,"pages":1494},{"VOID":1493},"12",{"VOID":1495},"23-37","2009-11-10"]