{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T20:20:24Z","timestamp":1673468424122},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,3]],"date-time":"2013-04-03T00:00:00Z","timestamp":1364947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Innovations Syst Softw Eng"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s11334-013-0198-7","type":"journal-article","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T06:41:54Z","timestamp":1364884914000},"page":"79-93","source":"Crossref","is-referenced-by-count":2,"title":["Precise shape analysis using field sensitivity"],"prefix":"10.1007","volume":"9","author":[{"given":"Sandeep","family":"Dasgupta","sequence":"first","affiliation":[]},{"given":"Amey","family":"Karkare","sequence":"additional","affiliation":[]},{"given":"Vinay Kr","family":"Reddy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,3]]},"reference":[{"key":"198_CR1","unstructured":"GCC, the gnu compiler collection. http:\/\/gcc.gnu.org . Last accessed July 2012"},{"key":"198_CR2","unstructured":"Aho AV, Lam MS, Sethi R, Ullman JD (2006) Compilers: principles, techniques, and tools, 2nd edn. Prentice Hall, Englewood Cliffs"},{"key":"198_CR3","doi-asserted-by":"crossref","unstructured":"Berdine J, Calcagno C, Cook B, Distefano D, O\u2019hearn PW, Yang H, Mary Q (2007) Shape analysis for composite data structures. In: CAV \u201907, pp 178\u2013192. Springer, Berlin","DOI":"10.1007\/978-3-540-73368-3_22"},{"key":"198_CR4","doi-asserted-by":"crossref","unstructured":"Bryant Randal E (1992) Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput Surv 24(3): 293\u2013318","DOI":"10.1145\/136035.136043"},{"key":"198_CR5","unstructured":"Carlisle MC (1995) Olden benchmarks. http:\/\/www.martincarlisle.com\/olden_benchmarks.tar.Z"},{"key":"198_CR6","doi-asserted-by":"crossref","unstructured":"Chase DR, Wegman M, Kenneth Zadeck F (1990) Analysis of pointers and structures. In: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation. ACM, New York, pp 296\u2013310","DOI":"10.1145\/93542.93585"},{"key":"198_CR7","doi-asserted-by":"crossref","unstructured":"Cherem S, Rugina R (2007) Maintaining doubly-linked list invariants in shape analysis with local reasoning. In: Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation. Springer, Berlin, pp 234\u2013250","DOI":"10.1007\/978-3-540-69738-1_17"},{"key":"198_CR8","doi-asserted-by":"crossref","unstructured":"Cherini R, Rearte L, Blanco J (2010) A shape analysis for non-linear data structures. In: Proceedings of the 17th international conference on static analysis. Springer, Berlin, pp 201\u2013217","DOI":"10.1007\/978-3-642-15769-1_13"},{"key":"198_CR9","doi-asserted-by":"crossref","unstructured":"Dasgupta S, Karkare A (2012) Precise shape analysis using field sensitivity. In: Proceedings of the 27th annual ACM symposium on applied computing, SAC \u201912, ACM, New York, pp 1300\u20131307","DOI":"10.1145\/2245276.2231982"},{"key":"198_CR10","doi-asserted-by":"crossref","unstructured":"Distefano D, O\u2019Hearn P, Yang H (2006) A local shape analysis based on separation logic. In: TACAS \u201906. Springer, Berlin, pp 287\u2013302","DOI":"10.1007\/11691372_19"},{"key":"198_CR11","doi-asserted-by":"crossref","unstructured":"Ghiya R, Hendren LJ (1996) Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in c. In POPL \u201996, pp 1\u201315","DOI":"10.1145\/237721.237724"},{"key":"198_CR12","doi-asserted-by":"crossref","unstructured":"Ghiya R, Hendren LJ (1998) Putting pointer analysis to work. In: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on principles of programming languages. ACM, New York, pp 121\u2013133","DOI":"10.1145\/268946.268957"},{"key":"198_CR13","doi-asserted-by":"crossref","unstructured":"Ghiya R, Hendren LJ, Zhu Y (1998) Detecting parallelism in c programs with recursive data structures. In: CC \u201998, pp 159\u2013173","DOI":"10.1007\/BFb0026429"},{"key":"198_CR14","doi-asserted-by":"crossref","unstructured":"Hackett B, Rugina R (2005) Region-based shape analysis with tracked locations. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, New York, pp 310\u2013323","DOI":"10.1145\/1040305.1040331"},{"key":"198_CR15","unstructured":"Hecht MS (1997) Flow analysis of computer programs. Elsevier Science Inc., New York"},{"key":"198_CR16","unstructured":"Jones ND, Muchnick SS (1979) Flow analysis and optimization of lisp-like structures. In: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on principles of programming languages. ACM, New York, pp 244\u2013256"},{"key":"198_CR17","doi-asserted-by":"crossref","unstructured":"Jump M, McKinley KS (2009) Dynamic shape analysis via degree metrics. In: Proceedings of the 2009 international symposium on memory management. ACM, New York, pp 119\u2013128","DOI":"10.1145\/1542431.1542449"},{"key":"198_CR18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"John B Kam","year":"1977","unstructured":"Kam John B, Ullman Jeffrey D (1977) Monotone data flow analysis frameworks. Acta Inform 7:305\u2013317","journal-title":"Acta Inform"},{"key":"198_CR19","unstructured":"Lind-Nielsen J (2012) BuDDy: A Binary Decision Diagram library. http:\/\/buddy.sourceforge.net , last accessed July 2012"},{"key":"198_CR20","unstructured":"Marron M, Kapur D, Stefanovic D, Hermenegildo M (2006) A static heap analysis for shape and connectivity: unified memory analysis: the base framework. In: Proceedings of the 19th international conference on Languages and compilers for parallel computing. Springer, Berlin, pp 345\u2013363"},{"key":"198_CR21","unstructured":"Mattson T, Wrinn M (2008) Parallel programming: can we please get it right this time? In: Proceedings of the 45th annual Design Automation Conference, DAC \u201908. ACM, New York, pp 7\u201311"},{"key":"198_CR22","unstructured":"Puneli MSA (1976) Two approaches to inter procedural data flow analysis. In: Program flow analysis: theory and applications. pp 189\u2013234"},{"key":"198_CR23","unstructured":"Pavlu V (2010) Basic operations on linked lists (c++). http:\/\/www.complang.tuwien.ac.at\/vpavlu\/2010\/list-benchmark.tgz"},{"key":"198_CR24","doi-asserted-by":"crossref","unstructured":"Sagiv M, Reps T, Wilhelm R (1996) Solving shape-analysis problems in languages with destructive updating. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on principles of programming languages. ACM, New York, pp 16\u201331","DOI":"10.1145\/237721.237725"},{"issue":"3","key":"198_CR25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/514188.514190","volume":"24","author":"Shmuel Sagiv","year":"2002","unstructured":"Sagiv Shmuel, Reps Thomas W, Wilhelm Reinhard (2002) Parametric shape analysis via 3-valued logic. ACM TOPLAS 24(3):217\u2013298","journal-title":"ACM TOPLAS"},{"key":"198_CR26","unstructured":"Sessions R (2009) The IT Complexity Crisis: Danger and Opportunity. http:\/\/www.objectwatch.com\/whitepapers\/ITComplexityWhitePaper.pdf . Last accessed July 2012"},{"key":"198_CR27","doi-asserted-by":"crossref","unstructured":"Shaham R, Yahav E, Kolodner EK, Sagiv S (2003) Establishing local temporal heap safety properties with applications to compile-time memory management. In: Proceedings of the 10th international symposium on static analysis. Springer, London, pp 483\u2013503","DOI":"10.1007\/3-540-44898-5_27"},{"key":"198_CR28","unstructured":"Wrinn M (2008) Top 10 challenges in parallel computing. http:\/\/software.intel.com\/en-us\/blogs\/2008\/12\/31\/top-10-challenges-in-p . Last accessed July 2012"}],"container-title":["Innovations in Systems and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-013-0198-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11334-013-0198-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11334-013-0198-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,11]],"date-time":"2019-07-11T13:18:54Z","timestamp":1562851134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11334-013-0198-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s11334-013-0198-7","relation":{},"ISSN":["1614-5046","1614-5054"],"issn-type":[{"value":"1614-5046","type":"print"},{"value":"1614-5054","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,3]]}}}