{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:13:37Z","timestamp":1742940817413,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030890506"},{"type":"electronic","value":"9783030890513"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89051-3_12","type":"book-chapter","created":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:30:38Z","timestamp":1634031038000},"page":"202-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptable Traces for Program Explanations"],"prefix":"10.1007","author":[{"given":"Divya","family":"Bajaj","sequence":"first","affiliation":[]},{"given":"Martin","family":"Erwig","sequence":"additional","affiliation":[]},{"given":"Danila","family":"Fedorin","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Gay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-28641-4_22","volume-title":"Principles of Security and Trust","author":"UA Acar","year":"2012","unstructured":"Acar, U.A., Ahmed, A., Cheney, J., Perera, R.: A core calculus for provenance. In: Degano, P., Guttman, J.D. (eds.) POST 2012. LNCS, vol. 7215, pp. 410\u2013429. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28641-4_22"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bajaj, D., Erwig, M., Fedorin, D., Gay, K.: A visual notation for succinct program traces. In: IEEE International Symposium on Visual Languages and Human-Centric Computing (2021, to appear)","DOI":"10.1109\/VL\/HCC51201.2021.9576441"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.118.1","volume":"118","author":"C Dunchev","year":"2013","unstructured":"Dunchev, C., et al.: PROOFTOOL: a GUI for the GAPT framework. Electron. Proc. Theor. Comput. Sci. 118, 1\u201314 (2013)","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"e10","DOI":"10.1017\/S0956796821000083","volume":"31","author":"M Erwig","year":"2021","unstructured":"Erwig, M., Kumar, P.: Explainable dynamic programming. J. Funct. Program. 31, e10 (2021)","journal-title":"J. Funct. Program."},{"key":"12_CR5","first-page":"105","volume":"25","author":"G Ferrand","year":"2006","unstructured":"Ferrand, G., Lesaint, W., Tessier, A.: Explanations and proof trees. Comput. Inform. 25, 105\u2013125 (2006)","journal-title":"Comput. Inform."},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(05)80538-9","volume":"41","author":"A Gill","year":"2001","unstructured":"Gill, A.: Debugging Haskell by observing intermediate data structures. Electron. Notes Theor. Comput. Sci. 41(1), 1 (2001)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Khoo, Y.P., Foster, J.S., Hicks, M.: Expositor: scriptable time-travel debugging with first-class traces. In: International Conference on Software Engineering, pp. 352\u2013361 (2013)","DOI":"10.1109\/ICSE.2013.6606581"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ko, A.J., Myers, B.A.: Finding causes of program output with the Java Whyline. In: SIGCHI Conference on Human Factors in Computing Systems, pp. 1569\u20131578 (2009)","DOI":"10.1145\/1518701.1518942"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10515-006-0003-z","volume":"14","author":"G Marceau","year":"2007","unstructured":"Marceau, G., Cooper, G.H., Spiro, J.P., Krishnamurthi, S., Reiss, S.P.: The design and implementation of a dataflow language for scriptable debugging. Autom. Softw. Eng. 14(1), 59\u201386 (2007). https:\/\/doi.org\/10.1007\/s10515-006-0003-z","journal-title":"Autom. Softw. Eng."},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S095679680000109X","volume":"4","author":"H Nilsson","year":"1994","unstructured":"Nilsson, H., Fritzson, P.: Algorithmic debugging for lazy functional languages. J. Funct. Program. 4(3), 337\u2013369 (1994)","journal-title":"J. Funct. Program."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Parnin, C., Orso, A.: Are automated debugging techniques actually helping programmers? In: International Symposium on Software Testing and Analysis, pp. 199\u2013209 (2011)","DOI":"10.1145\/2001420.2001445"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Perera, R., Acar, U.A., Cheney, J., Levy, P.B.: Functional programs that explain their work. In: ACM International Conference on Functional Programming, pp. 365\u2013376 (2012)","DOI":"10.1145\/2398856.2364579"},{"issue":"ICFP","key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3110258","volume":"1","author":"W Ricciotti","year":"2017","unstructured":"Ricciotti, W., Stolarek, J., Perera, R., Cheney, J.: Imperative functional programs that explain their work. Proc. ACM Program. Lang. 1(ICFP), 1\u201328 (2017)","journal-title":"Proc. ACM Program. Lang."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Roehm, T., Tiarks, R., Koschke, R., Maalej, W.: How do professional developers comprehend software? In: International Conference on Software Engineering, pp. 255\u2013265 (2012)","DOI":"10.1109\/ICSE.2012.6227188"},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1109\/TSMC.1986.289308","volume":"16","author":"I Vessey","year":"1986","unstructured":"Vessey, I.: Expertise in debugging computer programs: an analysis of the content of verbal protocols. IEEE Trans. Syst. Man Cybern. 16(5), 621\u2013637 (1986)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Visser, E., Benaissa, Z., Tolmach, A.: Building program optimizers with rewriting strategies. In: ACM International Conference on Functional Programming, pp. 13\u201326 (1998)","DOI":"10.1145\/291251.289425"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89051-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T21:03:53Z","timestamp":1725915833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89051-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030890506","9783030890513"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89051-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}