{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:46:43Z","timestamp":1770281203418,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T00:00:00Z","timestamp":1499644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,10]]},"DOI":"10.1145\/3092703.3092719","type":"proceedings-article","created":{"date-parts":[[2017,7,11]],"date-time":"2017-07-11T20:17:18Z","timestamp":1499804238000},"page":"318-328","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Refining interprocedural change-impact analysis using equivalence relations"],"prefix":"10.1145","author":[{"given":"Alex","family":"Gyori","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, USA"}]},{"given":"Shuvendu K.","family":"Lahiri","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}]},{"given":"Nimrod","family":"Partush","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]}],"member":"320","published-online":{"date-parts":[[2017,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025115.1025202"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062534"},{"key":"e_1_3_2_1_3_1","first-page":"116","volume-title":"Model Checking Software","author":"Backes J.","unstructured":"J. Backes , S. Person , N. Rungta , and O. Tkachuk . Regression verification using impact summaries . In Model Checking Software , pages 99\u2013 116 . Springer, 2013. J. Backes, S. Person, N. Rungta, and O. Tkachuk. Regression verification using impact summaries. In Model Checking Software, pages 99\u2013116. Springer, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11804192_17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30569-9_3"},{"key":"e_1_3_2_1_6_1","volume-title":"International Workshop on Satisfiability Modulo Theories (SMT)","author":"Barrett C.","year":"2010","unstructured":"C. Barrett , A. Stump , and C. Tinelli . The SMT-LIB standard: Version 2.0 . In International Workshop on Satisfiability Modulo Theories (SMT) , 2010 . C. Barrett, A. Stump, and C. Tinelli. The SMT-LIB standard: Version 2.0. In International Workshop on Satisfiability Modulo Theories (SMT), 2010."},{"key":"e_1_3_2_1_7_1","first-page":"214","volume-title":"FM 2011: Formal Methods","author":"Barthe G.","unstructured":"G. Barthe , J. M. Crespo , and C. Kunz . Relational verification using product programs . In FM 2011: Formal Methods , pages 200\u2013 214 . Springer, 2011. G. Barthe, J. M. Crespo, and C. Kunz. Relational verification using product programs. In FM 2011: Formal Methods, pages 200\u2013214. Springer, 2011."},{"key":"e_1_3_2_1_8_1","first-page":"43","volume-title":"Logical Foundations of Computer Science","author":"Barthe G.","unstructured":"G. Barthe , J. M. Crespo , and C. Kunz . Beyond 2-safety: Asymmetric product programs for relational program verification . In Logical Foundations of Computer Science , pages 29\u2013 43 . Springer, 2013. G. Barthe, J. M. Crespo, and C. Kunz. Beyond 2-safety: Asymmetric product programs for relational program verification. In Logical Foundations of Computer Science, pages 29\u201343. Springer, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/982962.964003"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.02.018"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254086"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480921"},{"key":"e_1_3_2_1_13_1","unstructured":"Coreutils paste.c commit. https:\/\/github.com\/coreutils\/coreutils\/commit\/ 8297568ec60103d95a56cf142d534f215086fe2b.  Coreutils paste.c commit. https:\/\/github.com\/coreutils\/coreutils\/commit\/ 8297568ec60103d95a56cf142d534f215086fe2b."},{"key":"e_1_3_2_1_14_1","unstructured":"Coreutils sort.c commit. https:\/\/github.com\/coreutils\/coreutils\/commit\/ 611e7e02bff8898e622d6ad582a92f2de746b614.  Coreutils sort.c commit. https:\/\/github.com\/coreutils\/coreutils\/commit\/ 611e7e02bff8898e622d6ad582a92f2de746b614."},{"key":"e_1_3_2_1_15_1","first-page":"54","volume-title":"AAAI","volume":"88","author":"Dean T. L.","year":"1988","unstructured":"T. L. Dean and M. S. Boddy . An analysis of time-dependent planning . In AAAI , volume 88 , pages 49\u2013 54 , 1988 . T. L. Dean and M. S. Boddy. An analysis of time-dependent planning. In AAAI, volume 88, pages 49\u201354, 1988."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642982"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771783.2771784"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630034"},{"key":"e_1_3_2_1_21_1","volume-title":"Semigroups: an introduction to the structure theory","author":"Grillet P. A.","year":"1995","unstructured":"P. A. Grillet . Semigroups: an introduction to the structure theory , volume 193 . CRC Press , 1995 . P. A. Grillet. Semigroups: an introduction to the structure theory, volume 193. CRC Press, 1995."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38574-2_20"},{"key":"e_1_3_2_1_24_1","first-page":"200","volume-title":"Proceedings of the 16th international conference on Software engineering","author":"Hutchins M.","unstructured":"M. Hutchins , H. Foster , T. Goradia , and T. Ostrand . Experiments of the effectiveness of dataflow-and controlflow-based test adequacy criteria . In Proceedings of the 16th international conference on Software engineering , pages 191\u2013 200 . IEEE Computer Society Press, 1994. M. Hutchins, H. Foster, T. Goradia, and T. Ostrand. Experiments of the effectiveness of dataflow-and controlflow-based test adequacy criteria. In Proceedings of the 16th international conference on Software engineering, pages 191\u2013200. IEEE Computer Society Press, 1994."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.562936"},{"key":"e_1_3_2_1_26_1","volume-title":"Microsoft Research","author":"Kawaguchi M.","year":"2010","unstructured":"M. Kawaguchi , S. Lahiri , and H. Rebelo . Conditional equivalence. Technical report , Microsoft Research , October 2010 . M. Kawaguchi, S. Lahiri, and H. Rebelo. Conditional equivalence. Technical report, Microsoft Research, October 2010."},{"key":"e_1_3_2_1_27_1","first-page":"309","volume-title":"Reverse Engineering, 2001. Proceedings. Eighth Working Conference on","author":"Krinke J.","unstructured":"J. Krinke . Identifying similar code with program dependence graphs . In Reverse Engineering, 2001. Proceedings. Eighth Working Conference on , pages 301\u2013 309 . IEEE, 2001. J. Krinke. Identifying similar code with program dependence graphs. In Reverse Engineering, 2001. Proceedings. Eighth Working Conference on, pages 301\u2013309. IEEE, 2001."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_54"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491452"},{"key":"e_1_3_2_1_30_1","first-page":"318","volume-title":"Software Engineering, 2003. Proceedings. 25th International Conference on","author":"Law J.","unstructured":"J. Law and G. Rothermel . Whole program path-based dynamic impact analysis . In Software Engineering, 2003. Proceedings. 25th International Conference on , pages 308\u2013 318 . IEEE, 2003. J. Law and G. Rothermel. Whole program path-based dynamic impact analysis. In Software Engineering, 2003. Proceedings. 25th International Conference on, pages 308\u2013318. IEEE, 2003."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568304"},{"key":"e_1_3_2_1_32_1","volume-title":"A review of software change impact analysis","author":"Lehnert S.","year":"2011","unstructured":"S. Lehnert . A review of software change impact analysis . Ilmenau University of Technology , Tech . Rep, 2011 . S. Lehnert. A review of software change impact analysis. Ilmenau University of Technology, Tech. Rep, 2011."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594326"},{"key":"e_1_3_2_1_34_1","first-page":"726","volume-title":"Proceedings of the 34th International Conference on Software Engineering","author":"Marinescu P. D.","unstructured":"P. D. Marinescu and C. Cadar . make test-zesti: A symbolic execution solution for improving regression testing . In Proceedings of the 34th International Conference on Software Engineering , pages 716\u2013 726 . IEEE Press, 2012. P. D. Marinescu and C. Cadar. make test-zesti: A symbolic execution solution for improving regression testing. In Proceedings of the 34th International Conference on Software Engineering, pages 716\u2013726. IEEE Press, 2012."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2597073.2597076"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/949952.940089"},{"key":"e_1_3_2_1_37_1","first-page":"258","volume-title":"SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings","author":"Partush N.","year":"2013","unstructured":"N. Partush and E. Yahav . Abstract semantic differencing for numerical programs. In Static Analysis - 20th International Symposium , SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings , pages 238\u2013 258 , 2013 . N. Partush and E. Yahav. Abstract semantic differencing for numerical programs. In Static Analysis - 20th International Symposium, SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings, pages 238\u2013258, 2013."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2610384.2610387"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453131"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993558"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_7"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1035292.1029012"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/248233.248262"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/379605.379661"},{"key":"e_1_3_2_1_46_1","unstructured":"Wikipedia. Anytime algorithm. https:\/\/en.wikipedia.org\/wiki\/Anytime_ algorithm.  Wikipedia. Anytime algorithm. https:\/\/en.wikipedia.org\/wiki\/Anytime_ algorithm."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210706"},{"key":"e_1_3_2_1_48_1","first-page":"43","volume-title":"Approximate reasoning using anytime algorithms","author":"Zilberstein S.","year":"1995","unstructured":"S. Zilberstein and S. Russell . Approximate reasoning using anytime algorithms . Kluwer International Series in Engineering and Computer Science, pages 43\u2013 43 , 1995 . S. Zilberstein and S. Russell. Approximate reasoning using anytime algorithms. Kluwer International Series in Engineering and Computer Science, pages 43\u201343, 1995."}],"event":{"name":"ISSTA '17: International Symposium on Software Testing and Analysis","location":"Santa Barbara CA USA","acronym":"ISSTA '17","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092703.3092719","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3092703.3092719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:26Z","timestamp":1750217846000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3092703.3092719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,10]]},"references-count":47,"alternative-id":["10.1145\/3092703.3092719","10.1145\/3092703"],"URL":"https:\/\/doi.org\/10.1145\/3092703.3092719","relation":{},"subject":[],"published":{"date-parts":[[2017,7,10]]},"assertion":[{"value":"2017-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}