{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:36Z","timestamp":1750307496706,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T00:00:00Z","timestamp":1287964800000},"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":[[2010,10,25]]},"DOI":"10.1145\/1879211.1879228","type":"proceedings-article","created":{"date-parts":[[2010,11,9]],"date-time":"2010-11-09T15:01:31Z","timestamp":1289314891000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Towards anomaly comprehension"],"prefix":"10.1145","author":[{"given":"Shen","family":"Lin","sequence":"first","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Fran\u00e7ois","family":"Ta\u00efani","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Thomas C.","family":"Ormerod","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]},{"given":"Linden J.","family":"Ball","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2010,10,25]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"http:\/\/www.eclipse.org\/tptp\/index.php (accessed","author":"Eclipse","year":"2010","unstructured":"Eclipse test & performance tools platform project. http:\/\/www.eclipse.org\/tptp\/index.php (accessed 8 April 2010 ). Eclipse test & performance tools platform project. http:\/\/www.eclipse.org\/tptp\/index.php (accessed 8 April 2010)."},{"volume-title":"http:\/\/processing.org\/ (accessed","year":"2010","key":"e_1_3_2_2_2_1","unstructured":"Processing. http:\/\/processing.org\/ (accessed 6 May 2010 ). Processing. http:\/\/processing.org\/ (accessed 6 May 2010)."},{"key":"e_1_3_2_2_3_1","volume-title":"Technical Report HP Part Number: 5992--5899","author":"Hp","year":"2009","unstructured":"Hp jmeter 4.0 user's guide. Technical Report HP Part Number: 5992--5899 , May 2009 . Hp jmeter 4.0 user's guide. Technical Report HP Part Number: 5992--5899, May 2009."},{"key":"e_1_3_2_2_4_1","volume-title":"Processing Symp. (IPDPS 2007)","author":"Arnold D.","year":"2007","unstructured":"D. Arnold , D. H. Ahn , B. R. de Supinski , G. Lee , B. P. Miller , and M. Schulz . Stack trace analysis for large scale debugging. In 21st Int. Paral lel and Dist . Processing Symp. (IPDPS 2007) Long Beach, CA , Mar. 2007 . D. Arnold, D. H. Ahn, B. R. de Supinski, G. Lee, B. P. Miller, and M. Schulz. Stack trace analysis for large scale debugging. In 21st Int. Paral lel and Dist. Processing Symp. (IPDPS 2007) Long Beach, CA, Mar. 2007."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2008.02.068"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646156.679713"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380130803"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2005.46"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028976.1028998"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.147"},{"key":"e_1_3_2_2_11_1","unstructured":"M. Paulding J. Dane. A hierarchical size counting mechanism for software estimation and planning. http:\/\/csdl.ics.hawaii.edu\/Plone\/research\/locc\/ (accessed 20 April 2010).  M. Paulding J. Dane. A hierarchical size counting mechanism for software estimation and planning. http:\/\/csdl.ics.hawaii.edu\/Plone\/research\/locc\/ (accessed 20 April 2010)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/253228.253356"},{"key":"e_1_3_2_2_14_1","unstructured":"K. O'Hair. Use hprof to tune performance. http:\/\/java.sun.com\/developer\/technicalArticles-\/Programming\/HPROF.html (accessed 8 April 2010) Nov. 2004.  K. O'Hair. Use hprof to tune performance. http:\/\/java.sun.com\/developer\/technicalArticles-\/Programming\/HPROF.html (accessed 8 April 2010) Nov. 2004."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2008.23"},{"key":"e_1_3_2_2_16_1","volume-title":"Software Visualization - From Theory to Practice","author":"Reiss S. P.","year":"2003","unstructured":"S. P. Reiss and M. Renieris . Software Visualization - From Theory to Practice , chapter The BLOOM Software Visualization System. MIT Press , 2003 . S. P. Reiss and M. Renieris. Software Visualization - From Theory to Practice, chapter The BLOOM Software Visualization System. MIT Press, 2003."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081730"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.386"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2005.1520929"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.v39:18"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/286942.286966"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1124772.1124891"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27866-5_7"}],"event":{"name":"SOFTVIS '10: International Symposium on Software Visualization","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGPLAN ACM Special Interest Group on Programming Languages","SIGSOFT ACM Special Interest Group on Software Engineering","SIGCHI ACM Special Interest Group on Computer-Human Interaction","SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Salt Lake City Utah USA","acronym":"SOFTVIS '10"},"container-title":["Proceedings of the 5th international symposium on Software visualization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1879211.1879228","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1879211.1879228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:40Z","timestamp":1750249060000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1879211.1879228"}},"subtitle":["using structural compression to navigate profiling call-trees"],"short-title":[],"issued":{"date-parts":[[2010,10,25]]},"references-count":22,"alternative-id":["10.1145\/1879211.1879228","10.1145\/1879211"],"URL":"https:\/\/doi.org\/10.1145\/1879211.1879228","relation":{},"subject":[],"published":{"date-parts":[[2010,10,25]]},"assertion":[{"value":"2010-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}