乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T00:16:19Z","timestamp":1721002579952},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T00:00:00Z","timestamp":1290124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Software Qual J"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s11219-010-9114-7","type":"journal-article","created":{"date-parts":[[2010,11,18]],"date-time":"2010-11-18T08:25:20Z","timestamp":1290068720000},"page":"239-294","source":"Crossref","is-referenced-by-count":4,"title":["Advanced chopping of sequential and concurrent programs"],"prefix":"10.1007","volume":"19","author":[{"given":"Dennis","family":"Giffhorn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,19]]},"reference":[{"issue":"8","key":"9114_CR1","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TSE.2003.1223646","volume":"29","author":"P. Anderson","year":"2003","unstructured":"Anderson, P., Reps, T., & Teitelbaum, T. (2003). Design and implementation of a fine-grained software inspection tool. IEEE Transactions on Software Engineering 29(8), 721\u2013733.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9114_CR2","unstructured":"Barik, R. (2005). Efficient computation of May-Happen-in-Parallel information for concurrent Java programs. In Proceeding of 18th international workshop on languages and compilers for parallel computing (LCPC\u201905), pp. 152\u2013169."},{"issue":"1","key":"9114_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1290520.1290523","volume":"30","author":"D. Binkley","year":"2007","unstructured":"Binkley, D., Harman M., & Krinke, J. (2007). Empirical study of optimization techniques for massive slicing. ACM Transactions on Program Language Systems 30(1), 3.","journal-title":"ACM Transactions on Program Language Systems"},{"key":"9114_CR6","doi-asserted-by":"crossref","unstructured":"Brumley, D., Newsome, J., Song, D., Wang, H., & Jha, S. (2006). Towards automatic generation of vulnerability-based signatures. In Proc. SP\u201906, pp. 2\u201316.","DOI":"10.1109\/SP.2006.41"},{"issue":"4","key":"9114_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/375431.375420","volume":"36","author":"Z. Chen","year":"2001","unstructured":"Chen, Z., & Xu, B. (2001). Slicing concurrent Java programs. ACM SIGPLAN Notices, 36(4), 41\u201347.","journal-title":"ACM SIGPLAN Notices"},{"key":"9114_CR8","unstructured":"Chen, Z., Xu, B., Yang, H., Liu, K., & Zhang, J. (2000). An approach to analyzing dependency of concurrent programs. In APAQS \u201900: Proceedings of the first Asia-pacific conference on quality software, pp. 39\u201343."},{"key":"9114_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, J. (1993). Slicing concurrent programs. Automated and Algorithmic Debugging, LNCS, 749, 223\u2013240, Springer.","DOI":"10.1007\/BFb0019411"},{"key":"9114_CR10","unstructured":"Cheng, J. (1997). Dependence analysis of parallel and distributed programs and its applications. International conference on advances in parallel and distributed computing, pp. 395\u2013404."},{"key":"9114_CR11","doi-asserted-by":"crossref","unstructured":"Giffhorn, D. (2009). Chopping concurrent programs. In 9th IEEE International workshop conference on source code analysis and manipulation, pp. 13\u201322.","DOI":"10.1109\/SCAM.2009.11"},{"issue":"2","key":"9114_CR12","first-page":"197","volume":"16","author":"D. Giffhorn","year":"2009","unstructured":"Giffhorn, D., & Hammer, C. (2009). Precise slicing of concurrent programs - An evaluation of static slicing algorithms for concurrent programs. Springer JASE, 16(2), 197\u2013234.","journal-title":"Springer JASE"},{"key":"9114_CR14","unstructured":"Graf, J. (2009). Improving and evaluating the scalability of precise system dependence graphs for objectoriented languages. Tech. Rep., Universit\u00e4t Karlsruhe (TH), Germany."},{"key":"9114_CR15","unstructured":"Hammer, C. (2009). Information flow control for Java\u2013a comprehensive approach based on path conditions in dependence graphs. PhD thesis, Universit\u00e4t Karlsruhe (TH)."},{"key":"9114_CR16","doi-asserted-by":"crossref","unstructured":"Hammer, C., & Snelting, G. (2004). An improved slicer for Java. Workshop on program analysis for software tools and engineering (PASTE\u201904), pp. 17\u201322.","DOI":"10.1145\/996821.996830"},{"issue":"6","key":"9114_CR17","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10207-009-0086-1","volume":"8","author":"C. Hammer","year":"2009","unstructured":"Hammer, C., & Snelting, G. (2009). Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs. Springer IJIS, 8(6), 399\u2013422.","journal-title":"Springer IJIS"},{"key":"9114_CR18","doi-asserted-by":"crossref","unstructured":"Hatcliff, J., Corbett, J. C., Dwyer, M. B., Sokolowski, S., & Zheng, H. (1999). A formal study of slicing for multi-threaded programs with JVM concurrency primitives. Static Analysis Symposium, LNCS, 1694, pp. 1\u201318, Springer.","DOI":"10.1007\/3-540-48294-6_1"},{"issue":"1","key":"9114_CR19","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S. B. Horwitz","year":"1990","unstructured":"Horwitz, S. B., Reps, T. W., & Binkley, D. (1990). Interprocedural slicing using dependence graphs. ACM Transactions on Program Language Systems 12(1), 26\u201360.","journal-title":"ACM Transactions on Program Language Systems"},{"key":"9114_CR20","doi-asserted-by":"crossref","unstructured":"Jackson, D., & Rollins, E. J. (1994). A new model of program dependences for reverse engineering. In Proc. FSE, pp. 2\u201310.","DOI":"10.1145\/193173.195281"},{"key":"9114_CR22","doi-asserted-by":"crossref","unstructured":"Krinke, J. (1998). Static slicing of threaded programs. PASTE \u201998, pp. 35\u201342.","DOI":"10.1145\/277631.277638"},{"key":"9114_CR23","doi-asserted-by":"crossref","unstructured":"Krinke, J. (2002). Evaluating context-sensitive slicing and chopping. International conference on software maintenance, pp. 22\u201331.","DOI":"10.1109\/ICSM.2002.1167744"},{"key":"9114_CR24","unstructured":"Krinke, J. (2003a). Barrier slicing and chopping. In IEEE Workshop on Source Code Analysis and Manipulation (SCAM)."},{"key":"9114_CR25","doi-asserted-by":"crossref","unstructured":"Krinke, J. (2003b). Context-sensitive slicing of concurrent programs. Proc. ESEC\/FSE\u201903, pp. 178\u2013187.","DOI":"10.1145\/940095.940096"},{"key":"9114_CR26","unstructured":"Krinke, J. (2003c). Advanced slicing of sequential and concurrent programs. PhD thesis, Universit\u00e4t Passau."},{"issue":"5","key":"9114_CR28","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.infsof.2007.05.004","volume":"50","author":"H. Liu","year":"2008","unstructured":"Liu, H., & Kuan Tan, H. B. (2008). An approach for the maintenance of input validation. Information Software Technology, 50(5), 449\u2013461.","journal-title":"Information Software Technology"},{"key":"9114_CR29","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., & Seidl, H. (2001). On optimal slicing of parallel programs. STOC 2001 (33th ACM symposium on theory of computing), pp. 647\u2013656.","DOI":"10.1145\/380752.380864"},{"key":"9114_CR30","doi-asserted-by":"crossref","unstructured":"Nanda, M. G., & Ramesh, S. (2000). Slicing concurrent programs. ISSTA 2000, pp. 180\u2013190.","DOI":"10.1145\/347324.349121"},{"issue":"6","key":"9114_CR31","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1145\/1186632.1186636","volume":"28","author":"M. G. Nanda","year":"2006","unstructured":"Nanda, M. G., & Ramesh, S. (2006). Interprocedural slicing of multithreaded programs with applications to Java. ACM TOPLAS., 28(6), 1088\u20131144.","journal-title":"ACM TOPLAS."},{"key":"9114_CR32","doi-asserted-by":"crossref","unstructured":"Naumovich, G., Avrunin, G. S., & Clarke, L. A. (1999). An efficient algorithm for computing MHP information for concurrent Java programs. In Proc. ESEC\/FSE \u201999, pp. 338\u2013354. Springer.","DOI":"10.1007\/3-540-48166-4_21"},{"issue":"1","key":"9114_CR34","first-page":"29","volume":"6","author":"X. Qi","year":"2005","unstructured":"Qi, X., & Xu, B. (2005). An approach to slicing concurrent Ada programs based on program reachability graphs. IJCSNS, 6(1), 29\u201337.","journal-title":"IJCSNS"},{"issue":"2","key":"9114_CR35","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G. Ramalingam","year":"2000","unstructured":"Ramalingam, G. (2000). Context-sensitive synchronization-sensitive analysis is undecidable. ACM Transactions on Program Language Systems, 22(2), 416\u2013430.","journal-title":"ACM Transactions on Program Language Systems"},{"key":"9114_CR37","unstructured":"Reps, T., & Rosay, G. (1995). Precise interprocedural chopping. In Proceedings of FSE\u201995 (pp. 41\u201352). New York: ACM Press."},{"key":"9114_CR38","doi-asserted-by":"crossref","unstructured":"Ruf, E. (2000). Effective synchronization removal for Java. Programming Language Design and Implementation (PLDI), pp. 208\u2013218.","DOI":"10.1145\/349299.349327"},{"issue":"5","key":"9114_CR39","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.jpdc.2007.01.006","volume":"67","author":"O. Shacham","year":"2007","unstructured":"Shacham, O., Sagiv, M., & Schuster, A. (2007). Scaling model checking of dataraces using dynamic information. Journal of Parallel and Distributed Computing 67(5), 536\u2013550.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"4","key":"9114_CR41","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1145\/1178625.1178628","volume":"15","author":"G. Snelting","year":"2006","unstructured":"Snelting, G., Robschink, T., & Krinke, J. (2006). Efficient path conditions in dependence graphs for software safety analysis. ACM TOSEM, 15(4), 410\u2013457.","journal-title":"ACM TOSEM"},{"key":"9114_CR45","doi-asserted-by":"crossref","unstructured":"Zhao, J. (1999). Slicing concurrent Java programs. Proceedings of the 7th IEEE International Workshop on Program Comprehension, pp. 126\u2013133.","DOI":"10.1109\/WPC.1999.777751"}],"container-title":["Software Quality Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11219-010-9114-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11219-010-9114-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11219-010-9114-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T10:31:41Z","timestamp":1559817101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11219-010-9114-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9114"],"URL":"https:\/\/doi.org\/10.1007\/s11219-010-9114-7","relation":{},"ISSN":["0963-9314","1573-1367"],"issn-type":[{"value":"0963-9314","type":"print"},{"value":"1573-1367","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,19]]}}}