{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:26:01Z","timestamp":1759332361680,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396977"},{"type":"electronic","value":"9783642396984"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-39698-4_21","type":"book-chapter","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T13:03:05Z","timestamp":1374670985000},"page":"346-353","source":"Crossref","is-referenced-by-count":1,"title":["Performance Estimation Using Symbolic Data"],"prefix":"10.1007","author":[{"given":"Jian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, S.: A fast string matching algorithm. Comm. ACM\u00a020, 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"key":"21_CR2","unstructured":"Cole, R.: Tight bounds on the complexity of the Boyer-Moore string matching algorithm. In: Proc. of the 2nd Symp. on Discrete Algorithms (SODA 1991), pp. 224\u2013233 (1991)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Geldenhuys, J., Dwyer, M.B., Visser, W.: Probabilistic symbolic execution. In: Proc. of the Int\u2019l Symposium on Software Testing and Analysis (ISSTA 2012), pp. 166\u2013176 (2012)","DOI":"10.1145\/2338965.2336773"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/362452.362489","volume":"14","author":"C.A.R. Hoare","year":"1971","unstructured":"Hoare, C.A.R.: Proof of a program: FIND. Commun. ACM\u00a014(1), 39\u201345 (1971)","journal-title":"Commun. ACM"},{"issue":"7","key":"21_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J.C. King","year":"1976","unstructured":"King, J.C.: Symbolic execution and program testing. Commun. ACM\u00a019(7), 385\u2013394 (1976)","journal-title":"Commun. ACM"},{"key":"21_CR6","unstructured":"Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press (1994), \n                  \n                    http:\/\/www-cs-faculty.stanford.edu\/~knuth\/sgb.html"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Liu, S., Zhang, J.: Program analysis: from qualitative analysis to quantitative analysis. In: Proc. of the 33rd Int\u2019l Conf. on Software Engineering (ICSE 2011), pp. 956\u2013959 (2011)","DOI":"10.1145\/1985793.1985957"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-642-02959-2_33","volume-title":"Automated Deduction \u2013 CADE-22","author":"F. Ma","year":"2009","unstructured":"Ma, F., Liu, S., Zhang, J.: Volume computation for Boolean combination of linear arithmetic constraints. In: Schmidt, R.A. (ed.) CADE-22. LNCS, vol.\u00a05663, pp. 453\u2013468. Springer, Heidelberg (2009)"},{"key":"21_CR9","unstructured":"Zhang, J.: Quantitative analysis of symbolic execution. Presented at the 28th Int\u2019l Computer Software and Applications Conf. (COMPSAC 2004) (2004)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-540-69149-5_59","volume-title":"Verified Software: Theories, Tools, Experiments","author":"J. Zhang","year":"2008","unstructured":"Zhang, J.: Constraint solving and symbolic execution. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol.\u00a04171, pp. 539\u2013544. Springer, Heidelberg (2008)"},{"key":"21_CR11","unstructured":"Zhang, J., Liu, S., Ma, F.: A tool for computing the volume of the solution space of SMT(LAC) constraints, draft (January 2013)"}],"container-title":["Lecture Notes in Computer Science","Theories of Programming and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39698-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:54:23Z","timestamp":1558302863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39698-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396977","9783642396984"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39698-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}