{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:29:37Z","timestamp":1742952577846,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031424403"},{"type":"electronic","value":"9783031424410"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42441-0_4","type":"book-chapter","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:05:28Z","timestamp":1693325128000},"page":"40-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TPGen: A Self-stabilizing GPU-Based Method for\u00a0Test and\u00a0Prime Paths Generation"],"prefix":"10.1007","author":[{"given":"Ebrahim","family":"Fazli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Ebnenasir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Ammann, P., Offutt, J.: Introduction to Software Testing. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/9781316771273"},{"key":"4_CR2","unstructured":"Ammann, P., Offutt, J., Xu, W., Li, N.: Graph coverage web applications (2008)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bang, L., Aydin, A., Bultan, T.: Automatically computing path complexity of programs. In: Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, pp. 61\u201372. ACM (2015). http:\/\/www.cs.ucsb.edu\/~vlab\/PAC\/","DOI":"10.1145\/2786805.2786863"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-68972-2_9","volume-title":"Fundamentals of Software Engineering","author":"A Monemi Bidgoli","year":"2017","unstructured":"Monemi Bidgoli, A., Haghighi, H., Zohdi Nasab, T., Sabouri, H.: Using swarm intelligence to generate test data for covering prime paths. In: Dastani, M., Sirjani, M. (eds.) FSEN 2017. LNCS, vol. 10522, pp. 132\u2013147. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68972-2_9"},{"issue":"06","key":"4_CR5","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1142\/S0218194002001074","volume":"12","author":"PMS Bueno","year":"2002","unstructured":"Bueno, P.M.S., Jino, M.: Automatic test data generation for program paths using genetic algorithms. Int. J. Software Eng. Knowl. Eng. 12(06), 691\u2013709 (2002)","journal-title":"Int. J. Software Eng. Knowl. Eng."},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-662-44857-1_5","volume-title":"Testing Software and Systems","author":"A Dwarakanath","year":"2014","unstructured":"Dwarakanath, A., Jankiti, A.: Minimum number of test paths for prime path and other structural coverage criteria. In: Merayo, M.G., de Oca, E.M. (eds.) ICTSS 2014. LNCS, vol. 8763, pp. 63\u201379. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44857-1_5"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0902019","volume":"2","author":"SC Eisenstat","year":"1981","unstructured":"Eisenstat, S.C., Schultz, M.H., Sherman, A.H.: Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sci. Stat. Comput. 2(2), 225\u2013237 (1981)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"134399","DOI":"10.1109\/ACCESS.2019.2941429","volume":"7","author":"E Fazli","year":"2019","unstructured":"Fazli, E., Afsharchi, M.: A time and space-efficient compositional method for prime and test paths generation. IEEE Access 7, 134399\u2013134410 (2019)","journal-title":"IEEE Access"},{"key":"4_CR9","unstructured":"Fazli, E., Ebnenasir, A.: TPGen: a self-stabilizing GPU-based method for prime and test paths generation. arXiv preprint arXiv:2210.16998 (2022). https:\/\/arxiv.org\/abs\/2210.16998"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Hoseini, B., Jalili, S.: Automatic test path generation from sequence diagram using genetic algorithm. In: 2014 7th International Symposium on Telecommunications (IST), pp. 106\u2013111. IEEE (2014)","DOI":"10.1109\/ISTEL.2014.7000678"},{"issue":"1\u20134","key":"4_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0255(00)00093-1","volume":"131","author":"JC Lin","year":"2001","unstructured":"Lin, J.C., Yeh, P.L.: Automatic test data generation for path testing using gas. Inf. Sci. 131(1\u20134), 47\u201364 (2001)","journal-title":"Inf. Sci."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/TSE.1976.233837","volume":"4","author":"TJ McCabe","year":"1976","unstructured":"McCabe, T.J.: A complexity measure. IEEE Trans. Softw. Eng. 4, 308\u2013320 (1976)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/42372.42379","volume":"31","author":"BA Nejmeh","year":"1988","unstructured":"Nejmeh, B.A.: NPATH: a measure of execution path complexity and its applications. Commun. ACM 31(2), 188\u2013200 (1988)","journal-title":"Commun. ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Sayyari, F., Emadi, S.: Automated generation of software testing path based on ant colony. In: 2015 International Congress on Technology, Communication and Knowledge (ICTCK), pp. 435\u2013440. IEEE (2015)","DOI":"10.1109\/ICTCK.2015.7582709"},{"issue":"2","key":"4_CR15","first-page":"14","volume":"2","author":"PR Srivastava","year":"2010","unstructured":"Srivastava, P.R., Jose, N., Barade, S., Ghosh, D.: Optimized test sequence generation from usage models using ant colony optimization. Int. J. Softw. Eng. Appl. 2(2), 14\u201328 (2010)","journal-title":"Int. J. Softw. Eng. Appl."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42441-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T16:06:02Z","timestamp":1693325162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42441-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031424403","9783031424410"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42441-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FSEN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamentals of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tehran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fsen2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fsen.ir\/2023\/Default.aspx","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":"19","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":"9","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":"2","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":"47% - 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":"2","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)"}}]}}