{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:08:36Z","timestamp":1725674916062},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642363146"},{"type":"electronic","value":"9783642363153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36315-3_6","type":"book-chapter","created":{"date-parts":[[2013,1,14]],"date-time":"2013-01-14T19:35:15Z","timestamp":1358192115000},"page":"72-84","source":"Crossref","is-referenced-by-count":0,"title":["Synthesizing Loops for Program Inversion"],"prefix":"10.1007","author":[{"given":"Cong","family":"Hou","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Quinlan","sequence":"additional","affiliation":[]},{"given":"David","family":"Jefferson","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Fujimoto","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Vuduc","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/312009.312079","volume":"34","author":"B. Biswas","year":"1999","unstructured":"Biswas, B., Mall, R.: Reverse execution of programs. ACM SIGPLAN Notices\u00a034(4), 61\u201369 (1999)","journal-title":"ACM SIGPLAN Notices"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems\u00a013(4), 451\u2013490 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-28652-0_5","volume-title":"Compiler Construction","author":"C. Hou","year":"2012","unstructured":"Hou, C., Vulov, G., Quinlan, D., Jefferson, D., Fujimoto, R., Vuduc, R.: A New Method for Program Inversion. In: O\u2019Boyle, M. (ed.) CC 2012. LNCS, vol.\u00a07210, pp. 81\u2013100. Springer, Heidelberg (2012)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/3916.3988","volume":"7","author":"D.R. Jefferson","year":"1985","unstructured":"Jefferson, D.R.: Virtual time. ACM Transactions on Programming Languages and Systems\u00a07(3), 404\u2013425 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR5","unstructured":"Muchnick, S.S.: Advanced Compiler Design Implementation. Morgan Kaufmann Publishers (1997)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical consideration on floyo-hoare logic. In: 17th Annual Symposium on Foundations of Computer Science (1976)","DOI":"10.1109\/SFCS.1976.27"},{"key":"6_CR7","unstructured":"Ballance, R.A., Maccabe, A.B., Ottenstein, K.J.: The Program Dependence Web: A Representation Supporting Control-, Data-, and Demand-Driven Interpretation of Imperative Language. In: PLDI 1990 (1990)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-17796-5_9","volume-title":"Algebraic Methodology and Software Technology","author":"G. Ro\u015fu","year":"2011","unstructured":"Ro\u015fu, G., Ellison, C., Schulte, W.: Matching Logic: An Alternative to Hoare\/Floyd Logic. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol.\u00a06486, pp. 142\u2013162. Springer, Heidelberg (2011)"},{"key":"6_CR9","unstructured":"Pop, S., Jouvelot, P., Silber, G.-A.: In and Out of SSA: A Denotational Specification. In: Static Single-Assignment Form Seminar (2009)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Srivastava, S., Gulwani, S., Chaudhuri, S., Foster, J.S.: Path-based inductive synthesis for program inversion. In: PLDI 2011. ACM Press (2011)","DOI":"10.1145\/1993498.1993557"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Vulov, G., Hou, C., Vuduc, R., Quinlan, D., Fujimoto, R., Jefferson, D.: The backstroke framework for source level reverse computation applied to parallel discrete event simulation. In: Winter Simulation Conference (2011)","DOI":"10.1109\/WSC.2011.6147998"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Wolfe, M.: Beyond Induction Variables. In: Proceedings of the ACM SIGPLAN 1992 Conference on Programming Language Design and Implementation, PLDI (1992)","DOI":"10.1145\/143095.143131"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36315-3_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T09:36:26Z","timestamp":1620120986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36315-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363146","9783642363153"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36315-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}