{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T17:24:26Z","timestamp":1743096266192,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319259413"},{"type":"electronic","value":"9783319259420"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25942-0_17","type":"book-chapter","created":{"date-parts":[[2015,10,16]],"date-time":"2015-10-16T05:32:14Z","timestamp":1444973534000},"page":"258-274","source":"Crossref","is-referenced-by-count":2,"title":["Assertion-Directed Precondition Synthesis for Loops over Data Structures"],"prefix":"10.1007","author":[{"given":"Juan","family":"Zhai","sequence":"first","affiliation":[]},{"given":"Hanfei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianhua","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Berghammer, R.: Soundness of a purely syntactical formalization of weakest preconditions. Electronic Notes in Theoretical Computer Science 35 (2000)","DOI":"10.1016\/S1571-0661(05)01196-5"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Saxe, J.B.: Avoiding exponential explosion: Generating compact verification conditions. In: ACM SIGPLAN Notices. Volume 36, ACM (2001)","DOI":"10.1145\/373243.360220"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Barnett, M., Leino, K.R.M.: Weakest-precondition of unstructured programs. In: ACM SIGSOFT Software Engineering Notes. Volume 31, ACM (2005)","DOI":"10.1145\/1108768.1108813"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ipl.2004.10.015","volume":"93","author":"KRM Leino","year":"2005","unstructured":"Leino, K.R.M.: Efficient weakest preconditions. Information Processing Letters 93(6), 281\u2013288 (2005)","journal-title":"Information Processing Letters"},{"key":"17_CR5","unstructured":"Jager, I., Brumley, D.: Efficient directionless weakest preconditions. Technical report, CMU-CyLab-10-002, CMU, CyLab (2010)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-642-39718-9_24","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2013","author":"Z Jianhua","year":"2013","unstructured":"Jianhua, Z., Xuandong, L.: Scope logic: an extension to hoare logic for pointers and recursive data structures. In: Liu, Z., Woodcock, J., Zhu, H. (eds.) ICTAC 2013. LNCS, vol. 8049, pp. 409\u2013426. Springer, Heidelberg (2013)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.S.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"issue":"8","key":"17_CR8","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"EW Dijkstra","year":"1975","unstructured":"Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. ACM 18(8), 453\u2013457 (1975)","journal-title":"Commun. ACM"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Zhai, J., Wang, H., Zhao, J.: Post-condition-directed invariant inference for loops over data structures. In: 2014 IEEE Eighth International Conference on Software Security and Reliability-Companion (SERE-C), IEEE (2014)","DOI":"10.1109\/SERE-C.2014.40"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-23283-1_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2011","author":"O Mraihi","year":"2011","unstructured":"Mraihi, O., Ghardallou, W., Louhichi, A., Labed Jilani, L., Bsaies, K., Mili, A.: Computing preconditions and postconditions of while loops. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 173\u2013193. Springer, Heidelberg (2011)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Mraihi, O., Louhichi, A., Jilani, L.L., Desharnais, J., Mili, A.: Invariant assertions, invariant relations, and invariant functions. Volume 78, 1212\u20131239 Elsevier (2013)","DOI":"10.1016\/j.scico.2012.05.006"},{"issue":"9","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1016\/j.scico.2010.07.004","volume":"77","author":"WN Chin","year":"2012","unstructured":"Chin, W.N., David, C., Nguyen, H.H., Qin, S.: Automated verification of shape, size and bag properties via user-defined predicates in separation logic. Sci. Comput. Program. 77(9), 1006\u20131036 (2012)","journal-title":"Sci. Comput. Program."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.jsc.2012.08.007","volume":"50","author":"S Qin","year":"2013","unstructured":"Qin, S., He, G., Luo, C., Chin, W.N., Chen, X.: Loop invariant synthesis in a combined abstract domain. Journal of Symbolic Computation 50, 386\u2013408 (2013)","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering: Theories, Tools, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25942-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:09:04Z","timestamp":1559272144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25942-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319259413","9783319259420"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25942-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}