{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:04Z","timestamp":1750306684070,"version":"3.41.0"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T00:00:00Z","timestamp":1412640000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100007780","name":"Indian Institute of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2014,10,14]]},"abstract":"<jats:p>Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance.<\/jats:p>\n          <jats:p>\n            The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            , combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version.\n          <\/jats:p>\n          <jats:p>\n            We perform extensive evaluation of M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            (1) for\n            <jats:italic>API discovery<\/jats:italic>\n            , where math algorithms are to be implemented from scratch and (2) for\n            <jats:italic>API migration<\/jats:italic>\n            , where client programs utilizing a math API are to be migrated to\n            <jats:italic>another<\/jats:italic>\n            API. We evaluated the precision and recall of M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            for API discovery, the programmers who used M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            to migrate Weka, a popular machine learning library. Overall, our evaluation shows that M\n            <jats:sc>ath<\/jats:sc>\n            F\n            <jats:sc>inder<\/jats:sc>\n            is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.\n          <\/jats:p>","DOI":"10.1145\/2629506","type":"journal-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T12:29:11Z","timestamp":1413289751000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Mining Unit Tests for Discovery and Migration of Math APIs"],"prefix":"10.1145","volume":"24","author":[{"given":"Anirudh","family":"Santhiar","sequence":"first","affiliation":[{"name":"Indian Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omesh","family":"Pandita","sequence":"additional","affiliation":[{"name":"Indian Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Kanade","sequence":"additional","affiliation":[{"name":"Indian Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,10,7]]},"reference":[{"volume-title":"Java Matrix Benchmark","author":"Abeles P.","key":"e_1_2_1_1_1","unstructured":"P. Abeles . 2010. Java Matrix Benchmark . http:\/\/code.google.com\/p\/java-matrix-benchmark\/. (2010). Accessed: 2012-07-30. P. Abeles. 2010. Java Matrix Benchmark. http:\/\/code.google.com\/p\/java-matrix-benchmark\/. (2010). Accessed: 2012-07-30."},{"key":"e_1_2_1_2_1","unstructured":"P. J. Acklam. 2003. MATLAB array manipulation tips and tricks. http:\/\/home.online.no\/&sim;pjacklam\/matlab\/doc\/mtt\/doc\/mtt.pdf. (Oct. 2003).  P. J. Acklam. 2003. MATLAB array manipulation tips and tricks. http:\/\/home.online.no\/&sim;pjacklam\/matlab\/doc\/mtt\/doc\/mtt.pdf. (Oct. 2003)."},{"key":"e_1_2_1_3_1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho A. V.","year":"2006","unstructured":"A. V. Aho , M. Lam , R. Sethi , and J. D. Ullman . 2006 . Compilers: Principles, Techniques, and Tools . Prentice Hall . A. V. Aho, M. Lam, R. Sethi, and J. D. Ullman. 2006. Compilers: Principles, Techniques, and Tools. Prentice Hall."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094832"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2010.5610429"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12107-4_5"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Workshop on Human-Computer Interaction and Information Retrieval.","author":"Begel A.","year":"2007","unstructured":"A. Begel . 2007 . Codifier: A programmer-centric search user interface . In Proceedings of the Workshop on Human-Computer Interaction and Information Retrieval. A. Begel. 2007. Codifier: A programmer-centric search user interface. In Proceedings of the Workshop on Human-Computer Interaction and Information Retrieval."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00593-0_26"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393596.2393661"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070565"},{"volume-title":"Numerical Methods for Linear Control Systems","author":"Datta B. N.","key":"e_1_2_1_11_1","unstructured":"B. N. Datta . 2004. Numerical Methods for Linear Control Systems . Elsevier, Inc. B. N. Datta. 2004. Numerical Methods for Linear Control Systems. Elsevier, Inc."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785477_24"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.v18:2"},{"key":"e_1_2_1_15_1","first-page":"1","article-title":"Basic linear algebra subprograms technical (blast) forum standard (1)","volume":"16","author":"Dongarra J.","year":"2002","unstructured":"J. Dongarra . 2002 . Basic linear algebra subprograms technical (blast) forum standard (1) . IJHPCA 16 , 1, 1 -- 111 . J. Dongarra. 2002. Basic linear algebra subprograms technical (blast) forum standard (1). IJHPCA 16, 1, 1--111.","journal-title":"IJHPCA"},{"volume-title":"Proceedings of the European Conference on Object-Oriented programming. 79--104","author":"Duala-Ekoko E.","key":"e_1_2_1_16_1","unstructured":"E. Duala-Ekoko and M. P. Robillard . 2011. Using structure-based recommendations to facilitate discoverability in APIs . In Proceedings of the European Conference on Object-Oriented programming. 79--104 . E. Duala-Ekoko and M. P. Robillard. 2011. Using structure-based recommendations to facilitate discoverability in APIs. In Proceedings of the European Conference on Object-Oriented programming. 79--104."},{"volume-title":"Proceedings of the International Conference on Software Engineering. 82--91","author":"Gokhale A.","key":"e_1_2_1_17_1","unstructured":"A. Gokhale , V. Ganapathy , and Y. Padmanaban . 2013. Inferring likely mappings between APIs . In Proceedings of the International Conference on Software Engineering. 82--91 . A. Gokhale, V. Ganapathy, and Y. Padmanaban. 2013. Inferring likely mappings between APIs. In Proceedings of the International Conference on Software Engineering. 82--91."},{"volume-title":"Proceedings of the International Conference on Computer Aided Verification. 418--423","author":"Gvero T.","key":"e_1_2_1_18_1","unstructured":"T. Gvero , V. Kuncak , and R. Piskac . 2011. Interactive synthesis of code snippets . In Proceedings of the International Conference on Computer Aided Verification. 418--423 . T. Gvero, V. Kuncak, and R. Piskac. 2011. Interactive synthesis of code snippets. In Proceedings of the International Conference on Computer Aided Verification. 418--423."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the International Conference on Software Engineering. 371--380","author":"Hall R. J.","year":"1993","unstructured":"R. J. Hall . 1993 . Generalized behavior-based retrieval . In Proceedings of the International Conference on Software Engineering. 371--380 . R. J. Hall. 1993. Generalized behavior-based retrieval. In Proceedings of the International Conference on Software Engineering. 371--380."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062512"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294211.1294216"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062455.1062491"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377656.2377657"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2008.110"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869518"},{"volume-title":"Proceedings of the International Conference on Software Engineering, Companion. 183--186","author":"Kawrykow D.","key":"e_1_2_1_27_1","unstructured":"D. Kawrykow and M. P. Robillard . 2009a. Detecting inefficient API usage . In Proceedings of the International Conference on Software Engineering, Companion. 183--186 . D. Kawrykow and M. P. Robillard. 2009a. Detecting inefficient API usage. In Proceedings of the International Conference on Software Engineering, Companion. 183--186."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.62"},{"key":"e_1_2_1_29_1","volume-title":"JML: A notation for detailed design. In Behav. Spec. Businesses Syst. 175--188.","author":"Leavens G. T.","year":"1999","unstructured":"G. T. Leavens , A. L. Baker , and C. Ruby . 1999 . JML: A notation for detailed design. In Behav. Spec. Businesses Syst. 175--188. G. T. Leavens, A. L. Baker, and C. Ruby. 1999. JML: A notation for detailed design. In Behav. Spec. Businesses Syst. 175--188."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2010.11.009"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0118-x"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321646"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065018"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"C. D. Manning P. Raghavan and H. Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press. I--XXI 1--482 pages.   C. D. Manning P. Raghavan and H. Sch\u00fctze. 2008. Introduction to Information Retrieval. Cambridge University Press. I--XXI 1--482 pages.","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985809"},{"volume-title":"Proceedings of the International Conference on Software Engineering. 353--363","author":"Meng S.","key":"e_1_2_1_36_1","unstructured":"S. Meng , X. Wang , L. Zhang , and H. Mei . 2012. A history-based matching approach to identification of framework evolution . In Proceedings of the International Conference on Software Engineering. 353--363 . S. Meng, X. Wang, L. Zhang, and H. Mei. 2012. A history-based matching approach to identification of framework evolution. In Proceedings of the International Conference on Software Engineering. 353--363."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384689"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869486"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806832"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254098"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108818"},{"key":"e_1_2_1_42_1","volume-title":"Introduction to Numerical Methods (Fall","author":"Persson P.","year":"2007","unstructured":"P. Persson . 2007. MIT 18.335 : Introduction to Numerical Methods (Fall 2007 ). http:\/\/persson.berkeley. edu\/18.335\/. (2007). Accessed : 2012-07-30. P. Persson. 2007. MIT 18.335: Introduction to Numerical Methods (Fall 2007). http:\/\/persson.berkeley. edu\/18.335\/. (2007). Accessed: 2012-07-30."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/143062.143152"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070525"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/648229.752450"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2012.63"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167473.1167508"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37057-1_24"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368153"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453101.1453117"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2012.38"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321631.1321663"},{"volume-title":"Proceedings of the Matlab DSP Conference. 35--40","author":"Vesanto J.","key":"e_1_2_1_53_1","unstructured":"J. Vesanto , J. Himberg , E. Alhoniemi , and J. Parhankangas . 2000. Self-organizing map in Matlab: The SOM toolbox . In Proceedings of the Matlab DSP Conference. 35--40 . J. Vesanto, J. Himberg, E. Alhoniemi, and J. Parhankangas. 2000. Self-organizing map in Matlab: The SOM toolbox. In Proceedings of the Matlab DSP Conference. 35--40."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2006.41"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806848"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/581339.581402"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2048066.2048075"},{"volume-title":"Bayesian Methods for Structural Dynamics and Civil Engineering","author":"Yuen K.","key":"e_1_2_1_58_1","unstructured":"K. Yuen . 2010. Bayesian Methods for Structural Dynamics and Civil Engineering . John Wiley & Sons . K. Yuen. 2010. Bayesian Methods for Structural Dynamics and Civil Engineering. John Wiley & Sons."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/256428.167077"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/261640.261641"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806831"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:18Z","timestamp":1750230078000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,7]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,10,14]]}},"alternative-id":["10.1145\/2629506"],"URL":"https:\/\/doi.org\/10.1145\/2629506","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"type":"print","value":"1049-331X"},{"type":"electronic","value":"1557-7392"}],"subject":[],"published":{"date-parts":[[2014,10,7]]},"assertion":[{"value":"2013-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-10-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}