{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T16:58:34Z","timestamp":1744736314299},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775041"},{"type":"electronic","value":"9783540775058"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-77505-8_26","type":"book-chapter","created":{"date-parts":[[2008,1,24]],"date-time":"2008-01-24T12:56:35Z","timestamp":1201179395000},"page":"331-345","source":"Crossref","is-referenced-by-count":23,"title":["Inferring Disjunctive Postconditions"],"prefix":"10.1007","author":[{"given":"Corneliu","family":"Popeea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Ngan","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-24622-0_13","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"R.. Bagnara","year":"2004","unstructured":"Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol.\u00a02937, pp. 135\u2013148. Springer, Heidelberg (2004)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Cousot, P., Cousot, R., Feret, J., Mauborgne, L., Min\u00e9, A., Monniaux, D., Rival, X.: A static analyzer for large safety-critical software. In: PLDI, pp. 196\u2013207 (2003)","DOI":"10.1145\/780822.781153"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-44978-7_2","volume-title":"Programs as Data Objects","author":"W..-N.. Chin","year":"2001","unstructured":"Chin, W.-N., Khoo, S.-C., Xu, D.N.: Deriving pre-conditions for array bound check elimination. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 2\u201324. Springer, Heidelberg (2001)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Colby, C., Lee, P.: Trace-based program analysis. In: POPL, pp. 195\u2013207 (1996)","DOI":"10.1145\/237721.237776"},{"key":"26_CR5","unstructured":"Cousot, P.: Semantic foundations of program analysis. In: Program Flow Analysis: Theory and Applications (1981)"},{"key":"26_CR6","unstructured":"Cousot, P., Cousot, R.: Static determination of dynamic properties of programs. In: Proceedings of the Second International Symposium on Programming, pp. 106\u2013130 (1976)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269\u2013282 (1979)","DOI":"10.1145\/567752.567778"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201396 (1978)","DOI":"10.1145\/512760.512770"},{"issue":"9","key":"26_CR10","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1002\/cpe.728","volume":"15","author":"J.. Dongarra","year":"2003","unstructured":"Dongarra, J., Luszczek, P., Petitet, A.: The Linpack benchmark: past, present and future. Concurrency and Computation: Practice and Experience\u00a015(9), 803\u2013820 (2003)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Qadeer, S.: Predicate abstraction for software verification. In: POPL, pp. 191\u2013202 (2002)","DOI":"10.1145\/503272.503291"},{"issue":"1-3","key":"26_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0167-6423(97)00034-8","volume":"32","author":"R.. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Ranzato, F.: Optimal domains for disjunctive abstract intepretation. Sci. Comput. Program\u00a032(1-3), 177\u2013210 (1998)","journal-title":"Sci. Comput. Program"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S. Bhargav","year":"2006","unstructured":"Bhargav, S., 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, Springer, Heidelberg (2006)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Gustavsson, J., Svenningsson, J.: Constraint abstractions. In: PADO, pp. 63\u201383 (2001)","DOI":"10.1007\/3-540-44978-7_5"},{"key":"26_CR15","unstructured":"Halbwachs, N.: D\u00e9termination Automatique de Relations Lin\u00e9aires V\u00e9rifi\u00e9es par les Variables d\u2019un Programme. Th\u00e8se de 3\u00e8me cycle d\u2019informatique, Universit\u00e9 scientifique et m\u00e9dicale de Grenoble, Grenoble, France (March 1979)"},{"key":"26_CR16","unstructured":"Simon, L., Jones, P., et al.: Glasgow Haskell Compiler, http:\/\/www.haskell.org\/ghc"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-27813-9_11","volume-title":"Computer Aided Verification","author":"K. Shuvendu","year":"2004","unstructured":"Shuvendu, K., Lahiri, S.K., Bryant, R.E.: Indexed predicate discovery for unbounded system verification. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 135\u2013147. Springer, Heidelberg (2004)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-540-32008-1","volume-title":"APLAS","author":"K. Rustan","year":"2005","unstructured":"Rustan, K., Leino, M., Logozzo, F.: Loop invariants on demand. In: Yi, K. (ed.) APLAS 2005. LNCS, vol.\u00a03780, pp. 119\u2013134. Springer, Heidelberg (2005)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-540-31987-0_2","volume-title":"ESOP","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, pp. 5\u201320. Springer, Heidelberg (2005)"},{"key":"26_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44978-7_10","volume-title":"Programs as Data Objects","author":"A. Min\u00e9","year":"2001","unstructured":"Min\u00e9, A.: A new numerical abstract domain based on difference-bound matrices. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 155\u2013172. Springer, Heidelberg (2001)"},{"key":"26_CR21","unstructured":"National\u00a0Institue of\u00a0Standards and Technology. Java SciMark benchmark for scientific computing, http:\/\/math.nist.gov\/scimark2\/"},{"key":"26_CR22","unstructured":"Popeea, C., Chin, W.-N.: Inferring disjunctive postconditions. Technical report. http:\/\/www.comp.nus.edu.sg\/~corneliu\/research\/disjunctive.tr.pdf"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"8","author":"W.. Pugh","year":"1992","unstructured":"Pugh, W.: The Omega test: A fast practical integer programming algorithm for dependence analysis. Communications of the ACM\u00a08, 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11823230_2","volume-title":"Static Analysis","author":"S.. Sankaranarayanan","year":"2006","unstructured":"Sankaranarayanan, S., Ivancic, F., Shlyakhter, I., Gupta, A.: Static analysis in disjunctive numerical domains. In: Yi, K. (ed.) SAS 2006. LNCS, vol.\u00a04134, Springer, Heidelberg (2006)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Suzuki, N., Ishihata, K.: Implementation of an array bound checker. In: POPL, pp. 132\u2013143 (1977)","DOI":"10.1145\/512950.512963"},{"key":"26_CR26","unstructured":"Xu, D.N., Popeea, C., Khoo, S.-C., Chin, W.-N.: A modular type inference and specializer for array bound checks elimination (under preparation). Technical report, http:\/\/www.comp.nus.edu.sg\/~corneliu\/research\/array.pdf"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77505-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T08:57:14Z","timestamp":1557219434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77505-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540775041","9783540775058"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77505-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}