{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T12:49:54Z","timestamp":1744116594565,"version":"3.37.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961415"},{"type":"electronic","value":"9783319961422"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96142-2_29","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T15:55:08Z","timestamp":1532102108000},"page":"487-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Android Stack Machine"],"prefix":"10.1007","author":[{"given":"Taolue","family":"Chen","sequence":"first","affiliation":[]},{"given":"Jinlong","family":"He","sequence":"additional","affiliation":[]},{"given":"Fu","family":"Song","sequence":"additional","affiliation":[]},{"given":"Guozhen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zhilin","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"29_CR1","unstructured":"Android documentation. \nhttps:\/\/developer.android.com\/guide\/components\/activities\/tasks-and-back-stack.html"},{"key":"29_CR2","unstructured":"Stackoverflow entry: Android singletask or singleinstance launch mode? \nhttps:\/\/stackoverflow.com\/questions\/3219726\/"},{"key":"29_CR3","unstructured":"Abdulla, P.A., Atig, M.F., Rezine, O., Stenman, J.: Multi-pushdown systems with budgets. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 24\u201333 (2012)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-63141-0_10","volume-title":"CONCUR \u201997: 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). \nhttps:\/\/doi.org\/10.1007\/3-540-63141-0_10"},{"issue":"3","key":"29_CR5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1142\/S0129054196000191","volume":"7","author":"L Breveglieri","year":"1996","unstructured":"Breveglieri, L., Cherubini, A., Citrini, C., Crespi-Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci. 7(3), 253\u2013292 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"29_CR6","unstructured":"Chen, T., He, J., Song, F., Wang, G., Wu, Z., Yan, J.: Android stack machine (full version) (2018). \nhttp:\/\/www.dcs.bbk.ac.uk\/~taolue\/pub-papers\/ASM-full.pdf"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Hofman, P., Lasota, S.: Reachability problem for weak multi-pushdown automata. In: Proceedings of the 23rd International Conference on (CONCUR), pp. 53\u201368 (2012)","DOI":"10.1007\/978-3-642-32940-1_6"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Hao, S., Li, D., Halfond, W.G.J., Govindan, R.: Estimating mobile application energy consumption using program analysis. In: Proceedings of the 35th International Conference on Software Engineering (ICSE), pp. 92\u2013101 (2013)","DOI":"10.1109\/ICSE.2013.6606555"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), pp. 205\u2013222 (2002)","DOI":"10.1007\/3-540-45931-6_15"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS), pp. 161\u2013170 (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"La Torre, S., Napoli, M.: Reachability of multistack pushdown systems with scope-bounded matching relations. In: Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR), pp. 203\u2013218 (2011)","DOI":"10.1007\/978-3-642-23217-6_14"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 283\u2013294 (2011)","DOI":"10.1145\/1926385.1926419"},{"key":"29_CR13","first-page":"1170","volume":"15","author":"AN Maslov","year":"1976","unstructured":"Maslov, A.N.: Multilevel stack automata. Probl. Inf. Transm. 15, 1170\u20131174 (1976)","journal-title":"Probl. Inf. Transm."},{"key":"29_CR14","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall Int., Upper Saddle River (1967)"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 93\u2013107 (2005)","DOI":"10.1007\/978-3-540-31980-1_7"},{"key":"29_CR16","unstructured":"Ren, C., Zhang, Y., Xue, H., Wei, T., Liu, P.: Towards discovering and understanding task hijacking in android. In: Proceedings of the 24th USENIX Security Symposium (USENIX Security), pp. 945\u2013959 (2015)"},{"issue":"1","key":"29_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ic.2017.12.003","volume":"259","author":"F Song","year":"2018","unstructured":"Song, F.: Analyzing pushdown systems with stack manipulation. Inf. Comput. 259(1), 41\u201371 (2018)","journal-title":"Inf. Comput."},{"key":"29_CR18","unstructured":"Song, F., Miao, W., Pu, G., Zhang, M.: On reachability analysis of pushdown systems with transductions: application to Boolean programs with call-by-reference. In: Proceedings of the 26th International Conference on Concurrency Theory (CONCUR), pp. 383\u2013397 (2015)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Uezato, Y., Minamide, Y.: Pushdown systems with stack manipulation. In: Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA), pp. 412\u2013426 (2013)","DOI":"10.1007\/978-3-319-02444-8_29"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Yan, J., Wu, T., Yan, J., Zhang, J.: Widget-sensitive and back-stack-aware GUI exploration for testing android apps. In: Proceedings of the 2017 IEEE International Conference on Software Quality, Reliability and Security (QRS), pp. 42\u201353 (2017)","DOI":"10.1109\/QRS.2017.14"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Yang, S., Zhang, H., Wu, H., Wang, Y., Yan, D., Rountev, A.: Static window transition graphs for android. In: Proceedings of the 30th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 658\u2013668 (2015)","DOI":"10.1109\/ASE.2015.76"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96142-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T16:09:01Z","timestamp":1532102941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96142-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961415","9783319961422"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96142-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}