{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T01:10:26Z","timestamp":1738285826602,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540691631"},{"type":"electronic","value":"9783540691662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69166-2_16","type":"book-chapter","created":{"date-parts":[[2008,7,13]],"date-time":"2008-07-13T09:25:03Z","timestamp":1215941103000},"page":"238-254","source":"Crossref","is-referenced-by-count":21,"title":["SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement"],"prefix":"10.1007","author":[{"given":"Gogul","family":"Balakrishnan","sequence":"first","affiliation":[]},{"given":"Sriram","family":"Sankaranarayanan","sequence":"additional","affiliation":[]},{"given":"Franjo","family":"Ivan\u010di\u0107","sequence":"additional","affiliation":[]},{"given":"Ou","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Aarti","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3-4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10009-007-0029-y","volume":"9","author":"R. Bagnara","year":"2007","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. STTT\u00a09(3-4), 413\u2013414 (2007)","journal-title":"STTT"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: PADL (2005)","DOI":"10.1007\/978-3-540-30557-6_14"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-63531-9_25","volume-title":"Fast Software Encryption","author":"R. Bodik","year":"1997","unstructured":"Bodik, R., Gupta, R., Soffa, M.L.: Refining data flow information using infeasible paths. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 361\u2013377. Springer, Heidelberg (1997)"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/155090.155095","volume-title":"PLDI 1993","author":"F. Bourdoncle","year":"1993","unstructured":"Bourdoncle, F.: Abstract debugging of higher-order imperative languages. In: PLDI 1993, pp. 46\u201355. ACM Press, New York (1993)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: Proc. Principles of Programming Languages (POPL) (1977)","DOI":"10.1145\/512950.512973"},{"key":"16_CR6","volume-title":"Formal Descriptions of Programming Concepts","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of recursive procedures. In: Formal Descriptions of Programming Concepts, North-Holland, Amsterdam (1978)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-74061-2_21","volume-title":"Static Analysis","author":"P. Cousot","year":"2007","unstructured":"Cousot, P., Ganty, P., Raskin, J.-F.: Fixpoint-guided abstraction refinements. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 333\u2013348. Springer, Heidelberg (2007)"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/512529.512538","volume-title":"PLDI","author":"M. Das","year":"2002","unstructured":"Das, M., Lerner, S., Seigle, M.: ESP: path-sensitive program verification in polynomial time. In: PLDI, pp. 57\u201368. ACM Press, New York (2002)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/11823230_27","volume-title":"Static Analysis","author":"D. Dhurjati","year":"2006","unstructured":"Dhurjati, D., Das, M., Yang, Y.: Path-sensitive dataflow analysis with iterative refinement. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 425\u2013442. Springer, Heidelberg (2006)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/11594116","volume-title":"Fast Software Encryption","author":"J. Fischer","year":"2005","unstructured":"Fischer, J., Jhala, R., Majumdar, R.: Joining dataflow with predicates. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, Springer, Heidelberg (2005)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11691372_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B.S. Gulavani","year":"2006","unstructured":"Gulavani, B.S., Rajamani, S.K.: Counterexample driven refinement for abstract interpretation. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.\u00a03920, pp. 474\u2013488. Springer, Heidelberg (2006)"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1008678014487","volume":"11","author":"N. Halbwachs","year":"1997","unstructured":"Halbwachs, N., Proy, Y.-E., Roumanoff, P.: Verification of real-time systems using linear relation analysis. Formal Methods in Sys. Design\u00a011(2), 157\u2013185 (1997)","journal-title":"Formal Methods in Sys. Design"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49727-7_12","volume-title":"Static Analysis","author":"M. Handjieva","year":"1998","unstructured":"Handjieva, M., Tzolovski, S.: Refining static analyses by trace-based partitioning using control flow. In: Levi, G. (ed.) SAS 1998. LNCS, vol.\u00a01503, Springer, Heidelberg (1998)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ivan\u010di\u0107, F., Shlyakhter, I., Gupta, A., Ganai, M.K., Kahlon, V., Wang, C., Yang, Z.: Model checking C programs using f-soft. In: ICCD, pp. 297\u2013308 (2005)","DOI":"10.1109\/ICCD.2005.77"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"M.H. Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. of Automated Reasoning\u00a040(1), 133 (2008)","journal-title":"J. of Automated Reasoning"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-27864-1_20","volume-title":"Static Analysis","author":"R. Manevich","year":"2004","unstructured":"Manevich, R., Sagiv, S., Ramalingam, G., Field, J.: Partially disjunctive heap abstraction. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 265\u2013279. Springer, Heidelberg (2004)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"L. Mauborgne","year":"2005","unstructured":"Mauborgne, L., Rival, X.: Trace partitioning in abstract interpretation based static analyzers. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, Springer, Heidelberg (2005)"},{"key":"16_CR18","unstructured":"Min\u00e9, A.: The octagon abstract domain. In: Working Conf. on Reverse Eng. (2001)"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","author":"M.N. Ngo","year":"2007","unstructured":"Ngo, M.N., Tan, H.B.K.: Detecting large number of infeasible paths through recognizing their patterns. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol.\u00a04593, Springer, Heidelberg (2007)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_21","volume-title":"Static Analysis","author":"X. Rival","year":"2005","unstructured":"Rival, X.: Understanding the origin of alarms in ASTR\u00c9E. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.\u00a03672, Springer, Heidelberg (2005)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-540-74061-2_23","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2007","unstructured":"Sankaranarayanan, S., Ivan\u010di\u0107, F., Gupta, A.: Program analysis using symbolic ranges. In: Riis Nielson, H., Fil\u00e9, G. (eds.) SAS 2007. LNCS, vol.\u00a04634, pp. 366\u2013383. Springer, Heidelberg (2007)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11823230_2","volume-title":"Static Analysis","author":"S. Sankaranarayanan","year":"2006","unstructured":"Sankaranarayanan, S., Ivan\u010di\u0107, F., Shlyakhter, I., Gupta, A.: Static analysis in disjunctive numerical domains. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, pp. 3\u201317. Springer, Heidelberg (2006)"},{"key":"16_CR23","unstructured":"Sankaranarayanan, S.: NECLA static analysis benchmarks (2007), http:\/\/www.nec-labs.com\/~fsoft"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69166-2_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:41:07Z","timestamp":1738284067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69166-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540691631","9783540691662"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69166-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}