{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:19:48Z","timestamp":1742948388559,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319175805"},{"type":"electronic","value":"9783319175812"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17581-2_4","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T12:22:36Z","timestamp":1429100556000},"page":"47-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Expression-Based Aliasing for OO\u2013languages"],"prefix":"10.1007","author":[{"given":"Georgiana","family":"Caltais","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-05089-3_24","volume-title":"FM 2009: Formal Methods","author":"E Albert","year":"2009","unstructured":"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Field-sensitive value analysis by field-insensitive analysis. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 370\u2013386. Springer, Heidelberg (2009)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.entcs.2014.05.005","volume":"304","author":"IM Asavoae","year":"2014","unstructured":"Asavoae, I.M.: Abstract semantics for alias analysis in K. Electr. Notes Theor. Comput. Sci. 304, 97\u2013110 (2014)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR 1997: Concurrency Theory","author":"A Bouajjani","year":"1997","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135\u2013150. Springer, Heidelberg (1997)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/BFb0025882","volume-title":"Languages and Compilers for Parallel Computing","author":"M Burke","year":"1995","unstructured":"Burke, M., Carini, P., Choi, J.-D., Hind, M.: Flow-insensitive interprocedural alias analysis in the presence of pointers. In: Pingali, K., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds.) Languages and Compilers for Parallel Computing. LNCS, vol. 892, pp. 234\u2013250. Springer, Berlin Heidelberg (1995)"},{"key":"4_CR5","unstructured":"Caltais, G.: Expression-based aliasing for OO-languages. CoRR, abs\/1409.7509 (2014)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Chase, D.R.., Wegman, M.N., Zadeck, F.K.: Analysis of pointers and structures. In: PLDI, pp. 296\u2013310 (1990)","DOI":"10.1145\/93548.93585"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Choi, J.-D., Burke, M., Carini, P.: Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1993, pp. 232\u2013245. ACM, New York, NY, USA (1993)","DOI":"10.1145\/158511.158639"},{"issue":"2&3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","volume":"13","author":"P Cousot","year":"1992","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation and application to logic programs. J. Log. Program. 13(2&3), 103\u2013179 (1992)","journal-title":"J. Log. Program."},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1145\/277652.277670","volume":"33","author":"A Diwan","year":"1998","unstructured":"Diwan, A., McKinley, K.S., Moss, J.E.B.: Type-based alias analysis. SIGPLAN Not. 33(5), 106\u2013117 (1998)","journal-title":"SIGPLAN Not."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Emami, M., Ghiya, R., Hendren, L.J.: Context-sensitive interprocedural points-to analysis in the presence of function pointers. In: Proceedings of the ACM SIGPLAN 1994 Conference on Programming Language Design and Implementation, PLDI 1994, pp. 242\u2013256. ACM, New York, NY, USA (1994)","DOI":"10.1145\/178243.178264"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hind, M.: Pointer analysis: haven\u2019t we solved this problem yet? In: PASTE, pp. 54\u201361 (2001)","DOI":"10.1145\/379605.379665"},{"issue":"4","key":"4_CR12","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1145\/325478.325519","volume":"21","author":"M Hind","year":"1999","unstructured":"Hind, M., Burke, M., Carini, P., Choi, J.-D.: Interprocedural pointer alias analysis. ACM Trans. Program. Lang. Syst. 21(4), 848\u2013894 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-642-04081-8_27","volume-title":"CONCUR 2009 - Concurrency Theory","author":"CART Hoare","year":"2009","unstructured":"Hoare, C.A.R.T., M\u00f6ller, B., Struth, G., Wehrman, I.: Concurrent Kleene algebra. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 399\u2013414. Springer, Heidelberg (2009)"},{"key":"4_CR14","first-page":"3","volume-title":"Automata Studies","author":"SC Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp. 3\u201341. Princeton University Press, Princeton (1956)"},{"key":"4_CR15","unstructured":"Kogtenkov, A., Meyer, B., Velder, S.: Alias and change calculi, applied to frame inference. CoRR, abs\/1307.3189 (2013)"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/161494.161501","volume":"1","author":"W Landi","year":"1992","unstructured":"Landi, W.: Undecidability of static analysis. ACM Lett. Program. Lang. Syst. 1(4), 323\u2013337 (1992)","journal-title":"ACM Lett. Program. Lang. Syst."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Landi, W., Ryder, B.G:. Pointer-induced aliasing: a problem classification. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1991, pp. 93\u2013103. ACM, New York, NY, USA (1991)","DOI":"10.1145\/99583.99599"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Larus, J.R., Hilfinger, P.N.: Detecting conflicts between structure accesses. In: PLDI, pp. 21\u201334. ACM, New York (1988)","DOI":"10.1145\/53990.53993"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22953-4_1","volume-title":"Fundamentals of Computation Theory","author":"J Meseguer","year":"2011","unstructured":"Meseguer, J., Ro\u015fu, G.: The rewriting logic semantics project: a progress report. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 1\u201337. Springer, Heidelberg (2011)"},{"key":"4_CR20","volume-title":"Eiffel: The Language","author":"B Meyer","year":"1991","unstructured":"Meyer, B.: Eiffel: The Language. Prentice-Hall, Englewood Cliffs (1991)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Min\u00e9, A.: Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics. In: Proceedings of the 2006 ACM SIGPLAN\/SIGBED Conference on Language, Compilers, and Tool Support for Embedded Systems, LCTES 2006, pp. 54\u201363. ACM, New York, NY, USA (2006)","DOI":"10.1145\/1134650.1134659"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Morandi, B., Schill, M., Nanz, S., Meyer, B.: Prototyping a concurrency model. In: ACSD, pp. 170\u2013179 (2013)","DOI":"10.1109\/ACSD.2013.21"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Myers. E.M.: A precise inter-procedural data flow algorithm. In: Proceedings of the 8th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1981, pp. 219\u2013230. ACM, New York, NY, USA (1981)","DOI":"10.1145\/567532.567556"},{"key":"4_CR24","unstructured":"Nienaltowski, P.: Practical Framework for Contract-based Concurrent Object-oriented Programming, ETH (2007)"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-35308-6_5","volume-title":"Certified Programs and Proofs","author":"V Robert","year":"2012","unstructured":"Robert, V., Leroy, X.: A formally-verified alias analysis. In: Hawblitzel, C., Miller, D. (eds.) CPP 2012. LNCS, vol. 7679, pp. 11\u201326. Springer, Heidelberg (2012)"},{"key":"4_CR27","unstructured":"Rosu, G., Serbanuta, T.F.: K overview and SIMPLE case study. In Proceedings of International K Workshop (K 2011), ENTCS. Elsevier (2013) (to appear)"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-16310-4_8","volume-title":"Rewriting Logic and Its Applications","author":"TF \u015eerb\u0103nu\u0163\u0103","year":"2010","unstructured":"\u015eerb\u0103nu\u0163\u0103, T.F., Ro\u015fu, G.: K-Maude: a rewriting based tool for semantics of programming languages. In: \u00d6lveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 104\u2013122. Springer, Heidelberg (2010)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/978-3-642-36946-9_8","volume-title":"Aliasing in Object-Oriented Programming","author":"M Sridharan","year":"2013","unstructured":"Sridharan, M., Chandra, S., Dolby, J., Fink, S.J., Yahav, E.: Alias analysis for object-oriented programs. In: Clarke, D., Noble, J., Wrigstad, T. (eds.) Aliasing in Object-Oriented Programming. LNCS, vol. 7850, pp. 196\u2013232. Springer, Heidelberg (2013)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, PLDI 1995, pp. 1\u201312. ACM, New York, NY, USA (1995)","DOI":"10.1145\/223428.207111"}],"container-title":["Communications in Computer and Information Science","Formal Techniques for Safety-Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17581-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T02:26:41Z","timestamp":1675132001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17581-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319175805","9783319175812"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17581-2_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}