{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,8]],"date-time":"2025-06-08T22:28:14Z","timestamp":1749421694880,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174644"},{"type":"electronic","value":"9783030174651"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17465-1_21","type":"book-chapter","created":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T22:50:37Z","timestamp":1554331837000},"page":"375-392","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Measuring Masking Fault-Tolerance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5835-4333","authenticated-orcid":false,"given":"Pablo F.","family":"Castro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-9215","authenticated-orcid":false,"given":"Pedro R.","family":"D\u2019Argenio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1651-624X","authenticated-orcid":false,"given":"Ramiro","family":"Demasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luciano","family":"Putruele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,3]]},"reference":[{"key":"21_CR1","unstructured":"MaskD: Masking distance tool. \n                      https:\/\/github.com\/lputruele\/MaskD"},{"key":"21_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973468","volume-title":"Lectures in Game Theory for Computer Scientists","author":"KR Apt","year":"2011","unstructured":"Apt, K.R., Gr\u00e4del, E.: Lectures in Game Theory for Computer Scientists, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"issue":"11","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/32.256850","volume":"19","author":"A Arora","year":"1993","unstructured":"Arora, A., Gouda, M.: Closure and convergence: a foundation of fault-tolerant computing. IEEE Trans. Softw. Eng. 19(11), 1015\u20131027 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/2629686","volume":"15","author":"U Boker","year":"2014","unstructured":"Boker, U., Chatterjee, K., Henzinger, T.A., Kupferman, O.: Temporal specifications with accumulative values. ACM Trans. Comput. Log. 15(4), 27:1\u201327:25 (2014)","journal-title":"ACM Trans. Comput. Log."},{"key":"21_CR5","unstructured":"Castro, P.F., D\u2019Argenio, P.R., Demasi, R., Putruele, L.: Measuring masking fault-tolerance. CoRR, abs\/1811.05548 (2018)"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2011.08.002","volume":"413","author":"P Cern\u00fd","year":"2012","unstructured":"Cern\u00fd, P., Henzinger, T.A., Radhakrishna, A.: Simulation distances. Theor. Comput. Sci. 413(1), 21\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Charikar, M., Makarychev, K., Makarychev, Y.: Directed metrics and directed graph partitioning problems. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22\u201326 January 2006, pp. 51\u201360 (2006)","DOI":"10.1145\/1109557.1109564"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1109\/TSE.2008.106","volume":"35","author":"L Alfaro de","year":"2009","unstructured":"de Alfaro, L., Faella, M., Stoelinga, M.: Linear and branching system metrics. IEEE Trans. Softw. Eng. 35(2), 258\u2013273 (2009)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L Alfaro de","year":"2007","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci. 386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L., Majumdar, R., Raman, V., Stoelinga, M.: Game refinement relations and metrics. Log. Methods Comput. Sci. 4(3:7) (2008)","DOI":"10.2168\/LMCS-4(3:7)2008"},{"issue":"6","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s00165-017-0426-2","volume":"29","author":"R Demasi","year":"2017","unstructured":"Demasi, R., Castro, P.F., Maibaum, T.S.E., Aguirre, N.: Simulation relations for fault-tolerance. Formal Aspects Comput. 29(6), 1013\u20131050 (2017)","journal-title":"Formal Aspects Comput."},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"EW Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-55179-4_18","volume-title":"Computer Aided Verification","author":"J-C Fernandez","year":"1992","unstructured":"Fernandez, J.-C., Mounier, L.: \u201cOn the fly\u201d verification of behavioural equivalences and preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 181\u2013191. Springer, Heidelberg (1992). \n                      https:\/\/doi.org\/10.1007\/3-540-55179-4_18"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"FC G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv. 31, 1\u201326 (1999)","journal-title":"ACM Comput. Surv."},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BFb0014338","volume-title":"Algebraic Methodology and Software Technology","author":"JF Groote","year":"1996","unstructured":"Groote, J.F., van de Pol, J.: A bounded retransmission protocol for large data packets. In: Wirsing, M., Nivat, M. (eds.) AMAST 1996. LNCS, vol. 1101, pp. 536\u2013550. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/BFb0014338"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A.: From Boolean to quantitative notions of correctness. In: Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2010, Madrid, Spain, 17\u201323 January 2010, pp. 157\u2013158 (2010)","DOI":"10.1145\/1706299.1706319"},{"issue":"4","key":"21_CR18","first-page":"331","volume":"28","author":"TA Henzinger","year":"2013","unstructured":"Henzinger, T.A.: Quantitative reactive modeling and verification. Comput. Sci. - R&D 28(4), 331\u2013344 (2013)","journal-title":"Comput. Sci. - R&D"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11603009_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"TA Henzinger","year":"2005","unstructured":"Henzinger, T.A., Majumdar, R., Prabhu, V.S.: Quantifying similarities between timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 226\u2013241. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11603009_18"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/2.585157","volume":"30","author":"M-C Hsueh","year":"1997","unstructured":"Hsueh, M.-C., Tsai, T.K., Iyer, R.K.: Fault injection techniques and tools. Computer 30(4), 75\u201382 (1997)","journal-title":"Computer"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Iyer, R.K., Nakka, N., Gu, W., Kalbarczyk, Z.: Fault injection. In: Encyclopedia of Software Engineering, pp. 287\u2013299 (2010)","DOI":"10.1081\/E-ESE-120044235"},{"issue":"3","key":"21_CR22","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"28","key":"21_CR23","doi-asserted-by":"publisher","first-page":"3358","DOI":"10.1016\/j.tcs.2011.04.003","volume":"412","author":"KG Larsen","year":"2011","unstructured":"Larsen, K.G., Fahrenberg, U., Thrane, C.R.: Metrics for weighted transition systems: axiomatization and complexity. Theor. Comput. Sci. 412(28), 3358\u20133369 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"DA Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of blackwell games. J. Symb. Log. 63(4), 1565\u20131581 (1998)","journal-title":"J. Symb. Log."},{"key":"21_CR25","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, M.: Algorithms for solving parity games. In: Apt, K.R., Gr\u00e4del, E. (eds.) Lectures in Game Theory for Computer Scientist, chap. 3, pp. 74\u201395. Cambridge University Press, New York (2011)","DOI":"10.1017\/CBO9780511973468.004"},{"key":"21_CR27","doi-asserted-by":"publisher","DOI":"10.1002\/047122460X","volume-title":"Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design","author":"ML Shooman","year":"2002","unstructured":"Shooman, M.L.: Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design. Wiley, Hoboken (2002)"},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1093\/jigpal\/7.1.103","volume":"7","author":"C Stirling","year":"1999","unstructured":"Stirling, C.: Bisimulation, modal logic and model checking games. Log. J. IGPL 7(1), 103\u2013124 (1999)","journal-title":"Log. J. IGPL"},{"issue":"7","key":"21_CR29","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.jlap.2010.07.010","volume":"79","author":"CR Thrane","year":"2010","unstructured":"Thrane, C.R., Fahrenberg, U., Larsen, K.G.: Quantitative analysis of weighted transition systems. J. Log. Algebraic Program. 79(7), 689\u2013703 (2010)","journal-title":"J. Log. Algebraic Program."},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than Coppersmith-Winograd. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, 19\u201322 May 2012 (2012)","DOI":"10.1145\/2213977.2214056"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17465-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:53:17Z","timestamp":1558345997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17465-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174644","9783030174651"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17465-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"164","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12 full papers and 11 short papers accepted for TOOLympics and SV-COMP (avg. 4 reviewers\/paper, selected from 43 submissions)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}