{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:51:44Z","timestamp":1725511904491},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540712084"},{"type":"electronic","value":"9783540712091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71209-1_11","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T18:56:34Z","timestamp":1183575394000},"page":"117-133","source":"Crossref","is-referenced-by-count":7,"title":["Type-Dependence Analysis and Program Transformation for Symbolic Execution"],"prefix":"10.1007","author":[{"given":"Saswat","family":"Anand","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Orso","sequence":"additional","affiliation":[]},{"given":"Mary Jean","family":"Harrold","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Berndl, M., et al.: Points-to analysis using BDDs. In: PLDI, pp. 103\u2013114 (2003)","key":"11_CR1","DOI":"10.1145\/781131.781144"},{"doi-asserted-by":"crossref","unstructured":"Cadar, C., et al.: EXE: Automatically generating inputs of death. In: CCS, pp. 322\u2013335 (2006)","key":"11_CR2","DOI":"10.1145\/1180405.1180445"},{"doi-asserted-by":"crossref","unstructured":"Cadar, C., et al.: EXE: A system for automatically generating inputs of death using symbolic execution. Technical Report CSTR 2006-01, Stanford University (2006)","key":"11_CR3","DOI":"10.1145\/1180405.1180445"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-45657-0_43","volume-title":"Computer Aided Verification","author":"D.R. Dams","year":"2002","unstructured":"Dams, D.R., Holzmann, G.J., Hesse, W.: Abstracting C with abC. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 515\u2013520. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Deng, X., Lee, J., Robby: Bogor\/Kiasan: A k-bounded symbolic execution for checking strong heap properties of open systems. In: ASE, pp. 157\u2013166 (2006)","key":"11_CR5","DOI":"10.1109\/ASE.2006.26"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B. Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 81\u201394. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Dwyer, M.B., et al.: Tool-supported program abstraction for finite-state verification. In: ICSE, pp. 177\u2013187 (2001)","key":"11_CR7","DOI":"10.1109\/ICSE.2001.919092"},{"doi-asserted-by":"crossref","unstructured":"Flanagan, C., et al.: Extended static checking for Java. In: PLDI, pp. 234\u2013245 (2002)","key":"11_CR8","DOI":"10.1145\/512529.512558"},{"unstructured":"Ganesh, V., Dill, D.: System Description of STP, http:\/\/www.csl.sri.com\/users\/demoura\/smt-comp\/descriptions\/stp.ps","key":"11_CR9"},{"doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: PLDI, pp. 213\u2013223 (2005)","key":"11_CR10","DOI":"10.1145\/1065010.1065036"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2006.01.002","volume":"144","author":"W. Grieskamp","year":"2006","unstructured":"Grieskamp, W., Tillmann, N., Schulte, W.: XRT\u2013exploring runtime for .NET architecture and applications. Electr. Notes Theor. Comp. Sci.\u00a0144(3), 3\u201326 (2006)","journal-title":"Electr. Notes Theor. Comp. Sci."},{"doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T.W., Sagiv, S.: Demand interprocedural dataflow analysis. In: FSE, pp. 104\u2013115 (1995)","key":"11_CR12","DOI":"10.1145\/222124.222146"},{"unstructured":"Java PathFinder, http:\/\/javapathfinder.sourceforge.net","key":"11_CR13"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","first-page":"553","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W. Visser","year":"2003","unstructured":"Visser, W., P\u0103s\u0103reanu, C.S., Khurshid, S.: Generalized Symbolic Execution for Model Checking and Testing. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, pp. 553\u2013568. Springer, Heidelberg (2003)"},{"issue":"7","key":"11_CR15","doi-asserted-by":"crossref","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. CACM\u00a019(7), 385\u2013394 (1976)","journal-title":"CACM"},{"doi-asserted-by":"crossref","unstructured":"Lhot\u00e1k, O., Hendren, L.J.: Jedd: a BDD-based relational extension of Java. In: PLDI, pp. 158\u2013169 (2004)","key":"11_CR16","DOI":"10.1145\/996841.996861"},{"doi-asserted-by":"crossref","unstructured":"Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: SC, pp. 4\u201313 (1991)","key":"11_CR17","DOI":"10.1145\/125826.125848"},{"unstructured":"Reps, T.W.: Program analysis via graph reachability. In: ILPS, pp. 5\u201319 (1997)","key":"11_CR18"},{"doi-asserted-by":"crossref","unstructured":"Sen, K., Marinov, D., Agha, G.: CUTE: a concolic unit testing engine for C. In: FSE, pp. 263\u2013272 (2005)","key":"11_CR19","DOI":"10.1145\/1081706.1081750"},{"unstructured":"Shankar, U., et al.: Detecting format-string vulnerabilities with type qualifiers. In: USENIX Security Symposium, pp. 201\u2013218 (2001)","key":"11_CR20"},{"doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control-flow analysis in Scheme. In: PLDI, pp. 164\u2013174 (1988)","key":"11_CR21","DOI":"10.1145\/53990.54007"},{"doi-asserted-by":"crossref","unstructured":"Sridharan, M., et al.: Demand-driven points-to analysis for Java. In: OOPSLA, pp. 59\u201376 (2005)","key":"11_CR22","DOI":"10.1145\/1094811.1094817"},{"doi-asserted-by":"crossref","unstructured":"Tilevich, E., Smaragdakis, Y.: Transparent program transformations in the presence of opaque code. In: GPCE, pp. 89\u201394 (2006)","key":"11_CR23","DOI":"10.1145\/1173706.1173720"},{"unstructured":"Vall\u00e9e-Rai, R., et al.: Soot - a Java optimization framework. In: CASCON, pp. 125\u2013135 (1999)","key":"11_CR24"},{"doi-asserted-by":"crossref","unstructured":"Visser, W., Pasareanu, C.S., Khurshid, S.: Test input generation with Java PathFinder. In: ISSTA, pp. 97\u2013107 (2004)","key":"11_CR25","DOI":"10.1145\/1007512.1007526"},{"issue":"2-3","key":"11_CR26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D.M. Volpano","year":"1996","unstructured":"Volpano, D.M., Irvine, C.E., Smith, G.: A sound type system for secure flow analysis. Journal of Computer Security\u00a04(2-3), 167\u2013188 (1996)","journal-title":"Journal of Computer Security"},{"doi-asserted-by":"crossref","unstructured":"Whaley, J., Lam, M.S.: Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In: PLDI, June 2004, pp. 131\u2013144 (2004)","key":"11_CR27","DOI":"10.1145\/996841.996859"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","first-page":"365","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Notkin","year":"2005","unstructured":"Notkin, D., et al.: Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 365\u2013381. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71209-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:16:39Z","timestamp":1605744999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71209-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540712084","9783540712091"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71209-1_11","relation":{},"subject":[]}}