{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:46:23Z","timestamp":1742931983351,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174613"},{"type":"electronic","value":"9783030174620"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17462-0_17","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T01:49:28Z","timestamp":1554342568000},"page":"299-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Reachability in Parameterized Phaser Programs"],"prefix":"10.1007","author":[{"given":"Zeinab","family":"Ganjei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Rezine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Henrio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petru","family":"Eles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zebo","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"17_CR1","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. In: Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, LICS 1996, pp. 313\u2013321. IEEE (1996)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2557833.2560582","volume":"39","author":"P Anderson","year":"2014","unstructured":"Anderson, P., Chase, B., Mercer, E.: JPF verification of Habanero Java programs. SIGSOFT Softw. Eng. Notes 39(1), 1\u20137 (2014). \n                      https:\/\/doi.org\/10.1145\/2557833.2560582\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/2557833.2560582","journal-title":"SIGSOFT Softw. Eng. Notes"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-540-71316-6_22","volume-title":"Programming Languages and Systems","author":"FS Boer de","year":"2007","unstructured":"de Boer, F.S., Clarke, D., Johnsen, E.B.: A complete guide to the future. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 316\u2013330. Springer, Heidelberg (2007). \n                      https:\/\/doi.org\/10.1007\/978-3-540-71316-6_22"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Cav\u00e9, V., Zhao, J., Shirako, J., Sarkar, V.: Habanero-Java: the new adventures of old x10. In: Proceedings of the 9th International Conference on Principles and Practice of Programming in Java, pp. 51\u201361. ACM (2011)","DOI":"10.1145\/2093157.2093165"},{"issue":"10","key":"17_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1145\/1103845.1094852","volume":"40","author":"P Charles","year":"2005","unstructured":"Charles, P., et al.: X10: an object-oriented approach to non-uniform cluster computing. SIGPLAN Not. 40(10), 519\u2013538 (2005). \n                      https:\/\/doi.org\/10.1145\/1103845.1094852\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/1103845.1094852","journal-title":"SIGPLAN Not."},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Cogumbreiro, T., Hu, R., Martins, F., Yoshida, N.: Dynamic deadlock verification for general barrier synchronisation. In: 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2015, pp. 150\u2013160. ACM, New York (2015). \n                      https:\/\/doi.org\/10.1145\/2688500.2688519\n                      \n                    . \n                      http:\/\/doi.acm.org\/10.1145\/2688500.2688519","DOI":"10.1145\/2688500.2688519"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jlamp.2017.02.006","volume":"90","author":"T Cogumbreiro","year":"2017","unstructured":"Cogumbreiro, T., Shirako, J., Sarkar, V.: Formalization of Habanero phasers using Coq. J. Log. Algebraic Methods Program. 90, 50\u201360 (2017). \n                      https:\/\/doi.org\/10.1016\/j.jlamp.2017.02.006\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352220816300839","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256(1), 63\u201392 (2001). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439750000102X","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR9","unstructured":"Ganjei, Z., Rezine, A., Eles, P., Peng, Z.: Safety verification of phaser programs. In: Proceedings of the 17th Conference on Formal Methods in Computer-Aided Design, FMCAD 2017, pp. 68\u201375. FMCAD Inc., Austin (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3168451.3168471"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ganjei, Z., Rezine, A., Henrio, L., Eles, P., Peng, Z.: On reachability in parameterized phaser programs. \n                      arXiv:1811.07142\n                      \n                     (2019)","DOI":"10.1007\/978-3-030-17462-0_17"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/s100090050043","volume":"2","author":"K Havelund","year":"2000","unstructured":"Havelund, K., Pressburger, T.: Model checking Java programs using Java pathfinder. Int. J. Softw. Tools Technol. Transfer (STTT) 2(4), 366\u2013381 (2000)","journal-title":"Int. J. Softw. Tools Technol. Transfer (STTT)"},{"issue":"5\u20136","key":"17_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P Jancar","year":"1999","unstructured":"Jancar, P.: A note on well quasi-orderings for powersets. Inf. Process. Lett. 72(5\u20136), 155\u2013160 (1999). \n                      https:\/\/doi.org\/10.1016\/S0020-0190(99)00149-0","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1013952225669","volume":"18","author":"A Marcone","year":"2001","unstructured":"Marcone, A.: Fine analysis of the quasi-orderings on the power set. Order 18(4), 339\u2013347 (2001). \n                      https:\/\/doi.org\/10.1023\/A:1013952225669","journal-title":"Order"},{"key":"17_CR14","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Inc., Englewood Cliffs (1967)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Shirako, J., Peixotto, D.M., Sarkar, V., Scherer, W.N.: Phasers: a unified deadlock-free construct for collective and point-to-point synchronization. In: 22nd Annual International Conference on Supercomputing, pp. 277\u2013288. ACM (2008)","DOI":"10.1145\/1375527.1375568"},{"issue":"8","key":"17_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. CACM 33(8), 103 (1990)","journal-title":"CACM"},{"issue":"9","key":"17_CR17","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1109\/71.243526","volume":"4","author":"MH Willebeek-LeMair","year":"1993","unstructured":"Willebeek-LeMair, M.H., Reeves, A.P.: Strategies for dynamic load balancing on highly parallel computers. IEEE Trans. Parallel Distrib. Syst. 4(9), 979\u2013993 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"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-17462-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T12:07:44Z","timestamp":1570018064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-17462-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174613","9783030174620"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17462-0_17","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":"4 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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}}]}}