{"publisher":"Springer","year":"2013","ec_funded":1,"day":"01","date_published":"2013-01-01T00:00:00Z","publist_id":"4630","file":[{"content_type":"application/pdf","file_size":299004,"date_created":"2018-12-12T10:10:36Z","checksum":"907edd33a5892e3af093365f1fd57ed7","access_level":"open_access","file_name":"IST-2014-196-v1+1_sas13.pdf","relation":"main_file","file_id":"4824","creator":"system","date_updated":"2020-07-14T12:45:37Z"}],"intvolume":"      7935","pubrep_id":"196","language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":1,"title":"Local shape analysis for overlaid data structures","oa_version":"Submitted Version","department":[{"_id":"ToHe"}],"citation":{"apa":"Dragoi, C., Enea, C., &#38; Sighireanu, M. (2013). Local shape analysis for overlaid data structures (Vol. 7935, pp. 150–171). Presented at the SAS: Static Analysis Symposium, Seattle, WA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>","chicago":"Dragoi, Cezara, Constantin Enea, and Mihaela Sighireanu. “Local Shape Analysis for Overlaid Data Structures,” 7935:150–71. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">https://doi.org/10.1007/978-3-642-38856-9_10</a>.","ista":"Dragoi C, Enea C, Sighireanu M. 2013. Local shape analysis for overlaid data structures. SAS: Static Analysis Symposium, LNCS, vol. 7935, 150–171.","ieee":"C. Dragoi, C. Enea, and M. Sighireanu, “Local shape analysis for overlaid data structures,” presented at the SAS: Static Analysis Symposium, Seattle, WA, United States, 2013, vol. 7935, pp. 150–171.","short":"C. Dragoi, C. Enea, M. Sighireanu, in:, Springer, 2013, pp. 150–171.","mla":"Dragoi, Cezara, et al. <i>Local Shape Analysis for Overlaid Data Structures</i>. Vol. 7935, Springer, 2013, pp. 150–71, doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>.","ama":"Dragoi C, Enea C, Sighireanu M. Local shape analysis for overlaid data structures. In: Vol 7935. Springer; 2013:150-171. doi:<a href=\"https://doi.org/10.1007/978-3-642-38856-9_10\">10.1007/978-3-642-38856-9_10</a>"},"month":"01","date_created":"2018-12-11T11:56:50Z","project":[{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"}],"status":"public","page":"150 - 171","ddc":["000","004"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"file_date_updated":"2020-07-14T12:45:37Z","date_updated":"2021-01-12T06:56:36Z","volume":7935,"type":"conference","has_accepted_license":"1","_id":"2298","doi":"10.1007/978-3-642-38856-9_10","conference":{"start_date":"2013-06-20","end_date":"2013-06-22","name":"SAS: Static Analysis Symposium","location":"Seattle, WA, United States"},"author":[{"first_name":"Cezara","full_name":"Dragoi, Cezara","id":"2B2B5ED0-F248-11E8-B48F-1D18A9856A87","last_name":"Dragoi"},{"full_name":"Enea, Constantin","first_name":"Constantin","last_name":"Enea"},{"last_name":"Sighireanu","full_name":"Sighireanu, Mihaela","first_name":"Mihaela"}],"alternative_title":["LNCS"],"publication_status":"published","abstract":[{"text":"We present a shape analysis for programs that manipulate overlaid data structures which share sets of objects. The abstract domain contains Separation Logic formulas that (1) combine a per-object separating conjunction with a per-field separating conjunction and (2) constrain a set of variables interpreted as sets of objects. The definition of the abstract domain operators is based on a notion of homomorphism between formulas, viewed as graphs, used recently to define optimal decision procedures for fragments of the Separation Logic. Based on a Frame Rule that supports the two versions of the separating conjunction, the analysis is able to reason in a modular manner about non-overlaid data structures and then, compose information only at a few program points, e.g., procedure returns. We have implemented this analysis in a prototype tool and applied it on several interesting case studies that manipulate overlaid and nested linked lists.\r\n","lang":"eng"}]}