{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T01:00:23Z","timestamp":1700269223379},"reference-count":7,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T00:00:00Z","timestamp":1162166400000},"content-version":"vor","delay-in-days":6756,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1988,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Run\u2010time program profiling is a valuable tool in understanding software efficiency. Techniques for obtaining profiles make assumptions that may result in misleading data. In the paper we illustrate flaws in two profiling systems: the Unix \u2018Gprof\u2019 family (including the packages \u2018monitor\u2019, \u2018prof\u2019 and \u2018profil\u2019), and the TI Explorer metering package for Lisp.<\/jats:p>","DOI":"10.1002\/spe.4380180506","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T20:44:53Z","timestamp":1163796293000},"page":"459-467","source":"Crossref","is-referenced-by-count":21,"title":["Inaccuracies in program profilers"],"prefix":"10.1002","volume":"18","author":[{"given":"Carl","family":"Ponder","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"Fateman","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,30]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380130803"},{"key":"e_1_2_1_3_2","volume-title":"Explorer Programming Concepts and Tools","year":"1985"},{"key":"e_1_2_1_4_2","unstructured":"Pxp \u2014 Pascal Execution Profiler Unix Programmer's Manual UC Berkeley Computer Science Division 1984."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/356589.356590"},{"key":"e_1_2_1_6_2","volume-title":"The Art of Computer Programming, vol. 1: Fundamental Algorithms","author":"Knuth D. E.","year":"1973"},{"key":"e_1_2_1_7_2","volume-title":"Probability and Measure","author":"Billingsly P.","year":"1986"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"R. A.Brooks D. B.Posner J. L.McDonald J. L.White E.BensonandR. P.Gabriel \u2018Design of an optimizing dynamically retargetable compiler for common Lisp\u2019 Proceedings of 1986 ACM Conference on Lisp and Functional Programming Cambridge Mass. 4\u20136 August 1984pp.67\u201385.","DOI":"10.1145\/319838.319851"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380180506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380180506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T17:16:29Z","timestamp":1697908589000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380180506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["10.1002\/spe.4380180506"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380180506","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}