{"language":[{"iso":"eng"}],"volume":6011,"year":"2010","title":"Verifying local transformations on relaxed memory models","intvolume":"      6011","date_created":"2018-12-11T12:08:38Z","date_updated":"2021-01-12T07:56:39Z","conference":{"name":"CC: Compiler Construction","start_date":"2010-03-20","location":"Pahos, Cyprus","end_date":"2010-03-28"},"month":"04","citation":{"ieee":"S. Burckhardt, M. Musuvathi, and V. Singh, “Verifying local transformations on relaxed memory models,” presented at the CC: Compiler Construction, Pahos, Cyprus, 2010, vol. 6011, pp. 104–123.","ama":"Burckhardt S, Musuvathi M, Singh V. Verifying local transformations on relaxed memory models. In: Gupta R, ed. Vol 6011. Springer; 2010:104-123. doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>","chicago":"Burckhardt, Sebastian, Madanlal Musuvathi, and Vasu Singh. “Verifying Local Transformations on Relaxed Memory Models.” edited by Rajiv Gupta, 6011:104–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>.","short":"S. Burckhardt, M. Musuvathi, V. Singh, in:, R. Gupta (Ed.), Springer, 2010, pp. 104–123.","ista":"Burckhardt S, Musuvathi M, Singh V. 2010. Verifying local transformations on relaxed memory models. CC: Compiler Construction, LNCS, vol. 6011, 104–123.","mla":"Burckhardt, Sebastian, et al. <i>Verifying Local Transformations on Relaxed Memory Models</i>. Edited by Rajiv Gupta, vol. 6011, Springer, 2010, pp. 104–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">10.1007/978-3-642-11970-5_7</a>.","apa":"Burckhardt, S., Musuvathi, M., &#38; Singh, V. (2010). Verifying local transformations on relaxed memory models. In R. Gupta (Ed.) (Vol. 6011, pp. 104–123). Presented at the CC: Compiler Construction, Pahos, Cyprus: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11970-5_7\">https://doi.org/10.1007/978-3-642-11970-5_7</a>"},"doi":"10.1007/978-3-642-11970-5_7","alternative_title":["LNCS"],"date_published":"2010-04-21T00:00:00Z","publication_status":"published","oa_version":"None","quality_controlled":"1","publist_id":"1063","_id":"4395","editor":[{"first_name":"Rajiv","last_name":"Gupta","full_name":"Gupta, Rajiv"}],"abstract":[{"text":"The problem of locally transforming or translating programs without altering their semantics is central to the construction of correct compilers. For concurrent shared-memory programs this task is challenging because (1) concurrent threads can observe transformations that would be undetectable in a sequential program, and (2) contemporary multiprocessors commonly use relaxed memory models that complicate the reasoning. In this paper, we present a novel proof methodology for verifying that a local program transformation is sound with respect to a specific hardware memory model, in the sense that it is not observable in any context. The methodology is based on a structural induction and relies on a novel compositional denotational semantics for relaxed memory models that formalizes (1) the behaviors of program fragments as a set of traces, and (2) the effect of memory model relaxations as local trace rewrite operations. To apply this methodology in practice, we implemented a semi- automated tool called Traver and used it to verify/falsify several compiler transformations for a number of different hardware memory models.","lang":"eng"}],"status":"public","type":"conference","extern":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Sebastian","last_name":"Burckhardt","full_name":"Burckhardt, Sebastian"},{"first_name":"Madanlal","full_name":"Musuvathi, Madanlal","last_name":"Musuvathi"},{"first_name":"Vasu","last_name":"Singh","full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Springer","day":"21","page":"104 - 123"}