{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,16]],"date-time":"2026-09-16T05:56:37Z","timestamp":1789538197383,"version":"build-2803163510"},"reference-count":71,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-{0524051, 0540955, 0810053, 0904371}"],"award-info":[{"award-number":["CCF-{0524051, 0540955, 0810053, 0904371}"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA8750-05-C-0179, FA8750-06-C-0249, FA9550-09-1-0279 and FA8650-10-C-7088"],"award-info":[{"award-number":["FA8750-05-C-0179, FA8750-06-C-0249, FA9550-09-1-0279 and FA8650-10-C-7088"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-{01-1-0708, 01-1-0796, 09-1-0510, 09-1-0776, 10-M-0251, 11-C-0447}"],"award-info":[{"award-number":["N00014-{01-1-0708, 01-1-0796, 09-1-0510, 09-1-0776, 10-M-0251, 11-C-0447}"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-09-1-0413"],"award-info":[{"award-number":["W911NF-09-1-0413"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:p>\n                    This paper defines a new variant of program slicing, called\n                    <jats:italic>specialization slicing<\/jats:italic>\n                    , and presents an algorithm for the specialization-slicing problem that creates an optimal output slice. An algorithm for specialization slicing is\n                    <jats:italic>polyvariant<\/jats:italic>\n                    : for a given procedure \u0440, the algorithm may create multiple specialized copies of \u0440. In creating specialized procedures, the algorithm must decide for which patterns of formal parameters a given procedure should be specialized and which program elements should be included in each specialized procedure.\n                  <\/jats:p>\n                  <jats:p>\n                    We formalize the specialization-slicing problem as a partitioning problem on the elements of the possibly\n                    <jats:italic>infinite<\/jats:italic>\n                    unrolled program. To manipulate possibly infinite sets of program elements, the algorithm makes use of automata-theoretic techniques originally developed in the model-checking community. The algorithm returns a\n                    <jats:italic>finite answer<\/jats:italic>\n                    that is optimal (with respect to a criterion defined in the article). In particular, (i) each element replicated by the specialization-slicing algorithm provides information about specialized patterns of program behavior that are intrinsic to the program, and (ii) the answer is of minimal size (i.e., among all possible answers with property (i), there is no smaller one).\n                  <\/jats:p>\n                  <jats:p>The specialization-slicing algorithm provides a new way to create executable slices. Moreover, by combining specialization slicing with forward slicing, we obtain a method for removing unwanted features from a program. While it was previously known how to solve the feature-removal problem for single-procedure programs, it was not known how to solve it for programs with procedure calls.<\/jats:p>","DOI":"10.1145\/2566620","type":"journal-article","created":{"date-parts":[[2014,6,17]],"date-time":"2014-06-17T08:38:13Z","timestamp":1402994293000},"page":"1-67","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Specialization Slicing"],"prefix":"10.1145","volume":"36","author":[{"given":"Min","family":"Aung","sequence":"first","affiliation":[{"name":"University of Wisconsin, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Susan","family":"Horwitz","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rich","family":"Joiner","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI and Gramma Tech, Inc., Ithaca, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","unstructured":"L. O. Andersen. 1993. Binding-time analysis and the taming of C pointers. In Part. Eval. and Semantics-Based Prog. Manip. 47--58. 10.1145\/154630.154636","DOI":"10.1145\/154630.154636"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","unstructured":"P. Anderson T. Reps and T. Teitelbaum. 2003. Design and implementation of a fine-grained software inspection tool. TSE 29 8 (2003). 10.1109\/TSE.2003.1223646","DOI":"10.1109\/TSE.2003.1223646"},{"key":"e_1_2_1_3_1","volume-title":"www.open-std.org\/jtc1\/sc22\/WG14\/www\/docs\/n1256.pdf","author":"ANSI","year":"2005","unstructured":"ANSI C. 2005. ISO\/IEC 9899:TC2. (2005). \u201cwww.open-std.org\/jtc1\/sc22\/WG14\/www\/docs\/n1256.pdf\u201d."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/158511.158694"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.1992.242560"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176473"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.624306"},{"key":"e_1_2_1_8_1","volume-title":"Personal Communication. (July","author":"Binkley D.","year":"2012","unstructured":"D. Binkley. 2012. Personal Communication. (July 2012)."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2004.12"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-005-0077-6"},{"key":"e_1_2_1_11_1","volume-title":"Advances in Computers","volume":"43","author":"Binkley D.","unstructured":"D. Binkley and K. Gallagher. 1996. Program slicing. In Advances in Computers, Vol. 43. Marvin V. Zelkowitz (Ed.), 1--50. Academic Press."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","unstructured":"R. F. Book and F. Otto. 1993. String-Rewriting Systems. Springer-Verlag.","DOI":"10.5555\/134467"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00055-7"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/646732.701281"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01969548"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"J. R. B\u00fcchi. 1988. Finite Automata their Algebras and Grammars. Springer-Verlag. D. Siefkes (ed.).","DOI":"10.1007\/978-1-4613-8853-1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/154630.154637"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645543.655702"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90278-N"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328460"},{"key":"e_1_2_1_21_1","volume-title":"CodeSurfer System. (2014). Retrieved","year":"2014","unstructured":"CodeSurfer. CodeSurfer System. (2014). Retrieved May 10, 2014 from www.grammatech.com\/products\/codesurfer."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","unstructured":"K. D. Cooper and K. Kennedy. 1988. Interprocedural side-effect analysis in linear time. PLDI. 57--66. 10.1145\/53990.53996","DOI":"10.1145\/53990.53996"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2004.03.034"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/525394.837853"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-005-3861-2"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.734087"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","unstructured":"J. Field G. Ramalingam and F. Tip. 1995. Parametric program slicing. In POPL. 10.1145\/199448.199534","DOI":"10.1145\/199448.199534"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"A. Finkel B. Willems and P. Wolper. 1997. A direct symbolic approach to model checking pushdown systems. ENTCS 9 (1997).","DOI":"10.1016\/S1571-0661(05)80426-8"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 9th International Conference on Software Engineering & Knowledge Engineering (SEKE 1997","author":"Forg\u00e1cs I.","year":"1997","unstructured":"I. Forg\u00e1cs and T. Gyim\u00f3thy. 1997. An efficient interprocedural slicing method for large programs. In Proceedings of the 9th International Conference on Software Engineering & Knowledge Engineering (SEKE 1997), Madrid, Spain, June 1997."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","unstructured":"C. Fox S. Danicic M. Harman and R. M. Hierons. 2004. ConSIT: A fully automated conditioned program slicer. SPE 34 1 (2004). 10.1002\/spe.556","DOI":"10.1002\/spe.556"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.83912"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025872819613"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065036"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/647766.733618"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(02)00135-8"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/523511.837885"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2005.2"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93574"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2009.66"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/65979.65980"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/123587.123588"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/143062.143156"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/257734.257766"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195281"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33125-1_17"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","unstructured":"N. D. Jones C. K. Gomard and P. Sestoft. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall International.","DOI":"10.5555\/153676"},{"key":"e_1_2_1_50_1","unstructured":"N. Kidd A. Lal and T. Reps. 2007. WALi: The Weighted Automaton Library. (2007). www.cs.wisc.edu\/wpis\/wpds\/download.php."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2004.7"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/567532.567555"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00091-3"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/21842.28894"},{"key":"e_1_2_1_55_1","volume-title":"Proceedings of the 2nd International Conference on Computers and Applications","author":"Lyle J. R.","year":"1987","unstructured":"J. R. Lyle and M. Weiser. 1987. Automatic program bug location by program slicing. In Proceedings of the 2nd International Conference on Computers and Applications, Peking, China, June 1987, 877--882."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"G. B. Mund and R. Mall. 2007. Program slicing. In The Compiler Design Handbook (2nd. ed.). Y. N. Srikant Priti Shankar (Eds.) CRC Press Chapter 14.","DOI":"10.1201\/9781420043839.ch14"},{"key":"e_1_2_1_57_1","volume-title":"www.openfst.org","author":"OpenFst Library ST.","year":"2012","unstructured":"OpenFST. 2012. OpenFst Library. (2012). www.openfst.org."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/800020.808263"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/882506.885151"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00093-7"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195287"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/222124.222138"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.5555\/647372.724044"},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the Conference on Theory and Practice of Information Technologies (ITAT 2010","author":"Sebej J.","year":"2010","unstructured":"J. Sebej. 2010. Reversal of regular languages and state complexity. In Proceedings of the Conference on Theory and Practice of Information Technologies (ITAT 2010), CEUR-WS.org, Vel'ka' Fatra, Slovak Republic, September 2010, 47--54."},{"key":"e_1_2_1_66_1","volume-title":"Retrieved","author":"Infrastructure Repository IR.","year":"2014","unstructured":"SIR. Software-artifact Infrastructure Repository. (2014). Retrieved May 10, 2014 from sir.unl.edu\/portal\/index.php."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1178625.1178628"},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the 10th International Conference on Quality Software (QSIC), IEEE Computer Society","author":"Sun C.","year":"2010","unstructured":"C. Sun, L. Tang, and Z. Chen. 2010. Enforcing reactive noninterference with reachability analysis. In Proceedings of the 10th International Conference on Quality Software (QSIC), IEEE Computer Society, Zhangjiajie, China, July 2010, 142--150."},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2011.63"},{"key":"e_1_2_1_70_1","volume-title":"A survey of program slicing techniques. JPL 3, 3","author":"Tip F.","year":"1995","unstructured":"F. Tip. 1995. A survey of program slicing techniques. JPL 3, 3 (1995)."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_2_1_72_1","volume-title":"Output-Sensitive Algorithm","year":"2014","unstructured":"Wikipedia: Output-Sensitive Algorithm 2014. Output-sensitive algorithm. (2014). en.wikipedia.org\/wiki\/Output-sensitive_algorithm, Jan. 5, 2014."},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298576"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2566620","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2566620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:01:00Z","timestamp":1750215660000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2566620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":71,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["10.1145\/2566620"],"URL":"https:\/\/doi.org\/10.1145\/2566620","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2012-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}