{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T16:10:07Z","timestamp":1748794207137,"version":"3.41.0"},"reference-count":28,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7121","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T22:11:07Z","timestamp":1456783867000},"page":"641-649","source":"Crossref","is-referenced-by-count":0,"title":["Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Hongda","family":"WANG","sequence":"first","affiliation":[{"name":"College of Defense Engineering, PLA University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianchun","family":"XING","sequence":"additional","affiliation":[{"name":"College of Defense Engineering, PLA University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juelong","family":"LI","sequence":"additional","affiliation":[{"name":"Technical Management Office of Naval Defense Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiliang","family":"YANG","sequence":"additional","affiliation":[{"name":"College of Defense Engineering, PLA University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuewei","family":"ZHANG","sequence":"additional","affiliation":[{"name":"College of Defense Engineering, PLA University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deshuai","family":"HAN","sequence":"additional","affiliation":[{"name":"College of Defense Engineering, PLA University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"LI","sequence":"additional","affiliation":[{"name":"State Grid Xinjiang Information and Telecommunication Company"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] \u201cWS-BPEL 2.0 Specification\u201d 2007. Available http:\/\/www.casisopen.orgdownload.php\/2046\/BPELprocess%20V1-1%20Ma%y%205%202003%20Final.pdf."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M.N. Ngo and H.B.K. Tan, \u201cHeuristics-based path feasibility detection for dynamic test data generation,\u201d Information and Software Technology, vol.50, no.7-8, pp.641-655, 2008.","DOI":"10.1016\/j.infsof.2007.06.006"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] J.C. King, \u201cSymbolic execution and program testing,\u201d Commun. ACM, vol.19, no.7, pp.385-394, 1976.","DOI":"10.1145\/360248.360252"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] J. Zhang and X. Wang, \u201cA constraint solver and its application to path feasibility analysis,\u201d Int. J. Softw. Eng. Knowl. Eng., vol.11, no.2, pp.139-156, 2001.","DOI":"10.1142\/S0218194001000487"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] A. Santone and G. Vaglini, \u201cFormula-based abstractions and symbolic execution for model checking programs,\u201d Microprocessors and Microsystems, vol.28, no.2, pp.69-76, 2004.","DOI":"10.1016\/S0141-9331(03)00127-3"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] B. Pourvatan, M. Sirjani, H. Hojjat, and F. Arbab, \u201cAutomated analysis of Reo circuits using symbolic execution,\u201d Electronic Notes in Theoretical Computer Science, vol.255, pp.137-158, 2009.","DOI":"10.1016\/j.entcs.2009.10.029"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Bozkurt, M. Harman, and Y. Hassoun, \u201cTesting and verification in service-oriented architecture: A survey,\u201d Software Testing, Verification and Reliability, vol.23, no.4, pp.261-313, 2013.","DOI":"10.1002\/stvr.1470"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] L.J. White and E.I. Cohen, \u201cA domain strategy for computer program testing,\u201d IEEE Trans. Softw. Eng., vol.6, no.3, pp.247-257, 1980.","DOI":"10.1109\/TSE.1980.234486"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] C. Cadar, V. Ganesh, P.M. Pawlowski, D.L. Dill, and D.R. Engler, \u201cEXE: Automatically generating inputs of death,\u201d ACM Trans. Information and System Security, vol.12, no.2, pp.1-38, 2008.","DOI":"10.1145\/1455518.1455522"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] B. Beckert, T. Hoare, R. Hahnle, D. Smith, C. Green, S. Ranise, C. Tinelli, T. Ball, and S. Rajamani, \u201cIntelligent systems and formal methods in software engineering,\u201d IEEE Intell. Syst., vol.21, no.6, pp.71-81, 2006.","DOI":"10.1109\/MIS.2006.117"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] G. Nelson and D.C. Oppen, \u201cSimplification by cooperating decision procedures,\u201d ACM Trans. Programming Languages and Systems, vol.1, no.2, pp.245-257, 1979.","DOI":"10.1145\/357073.357079"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, and F.K. Zadeck, \u201cEfficiently computing static single assignment form and the control dependence graph,\u201d ACM Trans. Programming Languages and Systems, vol.13, no.4, pp.451-490, 1991.","DOI":"10.1145\/115372.115320"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] B.K. Rosen, M.N. Wegman, and F.K. Zadeck, \u201cGlobal value numbers and redundant computations,\u201d Proc. 15th Symposium on Principles of Programming Languages, pp.12-17, 1988.","DOI":"10.1145\/73560.73562"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] J. Lee, S.P. Midkiff, and D.A. Padua, \u201cA constant propagation algorithm for explicitly parallel programs,\u201d International Journal of Parallel Programming, vol.26, no.5, pp.563-589, 1998.","DOI":"10.1023\/A:1018772514882"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] Y. Yuan, Z. Li, and W. Sun, \u201cA graph-search based approach to BPEL4WS test generation,\u201d International Conference on Software Engineering Advances, pp.1-14, 2006.","DOI":"10.1109\/ICSEA.2006.261270"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] J.Q. Li, Y.S. Fan, and M.C. Zhou, \u201cPerformance modeling and analysis of workflow,\u201d IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol.34, no.2, pp.229-242, 2004.","DOI":"10.1109\/TSMCA.2003.819490"},{"key":"17","unstructured":"[17] V. Ganesh and D.L. Dill, \u201cA decision procedure for bit-vectors and arrays,\u201d Proc. 19th International Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol.4590, pp.519-531, Springer Berlin Heidelberg, 2007."},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] R. Bodik, R. Gupta, and M.L. Soffa, \u201cRefining data flow information using infeasible paths,\u201d Foundations of Software Engineering, Proc. 6th European Conference Held Jointly with the 5th ACM SIGSOFT International Symposium on Foundations of Software Engineering, pp.361-377, 1997.","DOI":"10.1145\/267896.267921"},{"key":"19","unstructured":"[19] T. Chen, T. Mitra, A. Roychoudhury, and V. Suhendra, \u201cExploiting branch constraints without exhaustive path enumeration,\u201d Proc. 5th International Workshop on Worst-Case Execution Time Analysis, pp.46-47, 2005."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] N. Malevris, \u201cA path generation method for testing LCSAJs that restrains infeasible paths,\u201d Information and Software Technology, vol.37, no.8, pp.435-441, 1995.","DOI":"10.1016\/0950-5849(95)98039-I"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[21] P.M.S. Bueno and M. Jino, \u201cAutomatic test data generation for program paths using genetic algorithms,\u201d Int. J. Softw. Eng. Knowl. Eng., vol.12, no.6, pp.691-709, 2002.","DOI":"10.1142\/S0218194002001074"},{"key":"22","unstructured":"[22] G. Balakrishnan, S. Sankaranarayanan, F. Ivancic, O. Wei, and A. Gupta, \u201cSLR: Path-sensitive analysis through infeasible-path detection and syntactic language refinement,\u201d Proc. International Symposium on Static Analysis, Lecture Notes in Computer Science, vol.5079, pp.238-254, Springer Berlin Heidelberg, 2008."},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] J. Yan, Z. Li, Y. Yuan, et al., \u201cBPEL4WS unit testing: Test case generation using a concurrent path analysis approach,\u201d IEEE International Symposium on Software Reliability Engineering, pp.75-84, 2006.","DOI":"10.1109\/ISSRE.2006.16"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] C.-H. Liu, S.-L. Chen, and X.-Y. Li, \u201cA WS-BPEL based structural testing technique for Web service compositions,\u201d Proc. International Symposium on Service-Oriented System Engineering, pp.135-141, 2008.","DOI":"10.1109\/SOSE.2008.30"},{"key":"25","unstructured":"[25] C. Wang, R. Limaye, M. Ganai, and A. Gupta, \u201cTrace-based symbolic analysis for atomicity violations,\u201d Proc. 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, vol.6015, pp.328-342, Springer Berlin Heidelberg, 2010."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] W.-L. Dong, H. Yu, and Y.-B. Zhang, \u201cTesting BPEL-based Web service composition using high-level petri nets,\u201d Proc. 10th International Conference on Enterprise Distributed Object Computing, pp.441-444, 2006.","DOI":"10.1109\/EDOC.2006.59"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[27] W. Hummer, O. Raz, O. Shehory, P. Leitner, and S. Dustdar, \u201cTesting of data-centric and event-based dynamic service compositions,\u201d Software Testing, Verification and Reliability, vol.23, no.6, pp.465-497, 2012.","DOI":"10.1002\/stvr.1493"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[28] H. Huang, W.-T. Tsai, R. Paul, and Y. Chen, \u201cAutomated model checking and testing for composite Web services,\u201d Proc. 8th International Symposium on Object-Oriented Real-Time Distributed Computing, pp.300-307, 2005.","DOI":"10.1109\/ISORC.2005.16"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDP7121\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T15:35:35Z","timestamp":1748792135000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/3\/E99.D_2015EDP7121\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7121","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2016]]}}}