{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:09Z","timestamp":1742912409386,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030539559"},{"type":"electronic","value":"9783030539566"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-53956-6_36","type":"book-chapter","created":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T11:02:42Z","timestamp":1594551762000},"page":"405-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Structural Testing Model Using SDA Algorithm"],"prefix":"10.1007","author":[{"given":"Saju Sankar","family":"S","sequence":"first","affiliation":[]},{"given":"Vinod Chandra","family":"S S","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Granno, G.: A new dimension of test quality - assessing and generating higher quality unit test cases. In: ISSTA 2019, China, pp. 15\u201319. Software Evolution and Architecture Lab, University of Zurich, Zurich, Switzerland (2019)","DOI":"10.1145\/3293882.3338984"},{"key":"36_CR2","unstructured":"Wang, X., et al.: An efficient method for automatic generation of linearly independent paths in white box testing. School of Software and Engineering, University of Electronic Science and Technology of China (2015)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"McCabe, T.J.: A complexity measure. IEEE Trans. Softw. Eng. SE-2(4) (1976)","DOI":"10.1109\/TSE.1976.233837"},{"key":"36_CR4","unstructured":"Alshaheen, H.S.: Finding shortest path in routing problem by using ant colony optimization. J. Univ. Thi-Qar 8(3) (2013)"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s40031-014-0182-0","volume":"97","author":"SS Vinod Chandra","year":"2016","unstructured":"Vinod Chandra, S.S.: Smell detection agent based optimization algorithm. J. Inst. Eng. (India) Ser. B 97(4), 431\u2013436 (2016). https:\/\/doi.org\/10.1007\/s40031-014-0182-0","journal-title":"J. Inst. Eng. (India) Ser. B"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-61833-3_53","volume-title":"Advances in Swarm Intelligence","author":"R Ananthalakshmi Ammal","year":"2017","unstructured":"Ananthalakshmi Ammal, R., Sajimon, P.C., Vinodchandra, S.S.: Application of smell detection agent based algorithm for optimal path identification by SDN controllers. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds.) ICSI 2017. LNCS, vol. 10386, pp. 502\u2013510. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61833-3_53"},{"key":"36_CR7","unstructured":"Srivastava, S., Kumar, S., Verma, A.K.: Optimal path sequencing in basis path testing. Int. J. Adv. Comput. Eng. Netw. (2013)"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Yan, J., Zhang, J.: An efficient method to generate feasible paths for basis path testing. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China 2008)","DOI":"10.1016\/j.ipl.2008.01.007"},{"key":"36_CR9","unstructured":"Salawudeen, A.T., et al.: From smell phenomenon to smell agent optimization (SAO): a feasibility study. In: Proceedings of ICGET (2018)"},{"issue":"6","key":"36_CR10","first-page":"317","volume":"2","author":"S Kaur","year":"2013","unstructured":"Kaur, S.: Shortest path finding algorithm using ant colony optimization. Int. J. Eng. Res. Technol. (IJERT) 2(6), 317\u2013326 (2013). ISSN 2278-0181","journal-title":"Int. J. Eng. Res. Technol. (IJERT)"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Math. Program. 73, 129\u2013174 (1996). https:\/\/doi.org\/10.1007\/BF02592101","journal-title":"Math. Program."},{"issue":"3","key":"36_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/321765.321768","volume":"20","author":"J Donald","year":"1973","unstructured":"Donald, J.: A note on Dijikstra\u2019s shortest path algorithm. J. ACM 20(3), 385\u2013388 (1973)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53956-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,2]],"date-time":"2022-11-02T11:50:15Z","timestamp":1667389815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53956-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030539559","9783030539566"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53956-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","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":"63","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":"0","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":"50% - 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":"2","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.4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}