{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T06:19:37Z","timestamp":1790835577836,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642370359","type":"print"},{"value":"9783642370366","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37036-6_13","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:55Z","timestamp":1361198155000},"page":"209-228","source":"Crossref","is-referenced-by-count":78,"title":["Abstract Refinement Types"],"prefix":"10.1007","author":[{"given":"Niki","family":"Vazou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick M.","family":"Rondon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ranjit","family":"Jhala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-19718-5_2","volume-title":"Programming Languages and Systems","author":"J.F. Belo","year":"2011","unstructured":"Belo, J.F., Greenberg, M., Igarashi, A., Pierce, B.C.: Polymorphic Contracts. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol.\u00a06602, pp. 18\u201337. Springer, Heidelberg (2011)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1890028.1890031","volume":"33","author":"J. Bengtson","year":"2011","unstructured":"Bengtson, J., Bhargavan, K., Fournet, C., Gordon, A.D., Maffeis, S.: Refinement types for secure implementations. ACM TOPLAS\u00a033(2), 8 (2011)","journal-title":"ACM TOPLAS"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development. Coq\u2019Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer (2004)","DOI":"10.1007\/978-3-662-07964-5"},{"key":"13_CR4","unstructured":"Constable, R.L.: Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall (1986)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R., Logozzo, F.: A parametric segmentation functor for fully automatic and scalable array content analysis. In: POPL, pp. 105\u2013118 (2011)","DOI":"10.1145\/1925844.1926399"},{"key":"13_CR6","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.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer, Heidelberg (2008)"},{"key":"13_CR7","unstructured":"Dunfield, J.: A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (2007)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Findler, R.B., Felleisen, M.: Contracts for higher-order functions. In: ICFP, pp. 48\u201359 (2002)","DOI":"10.1145\/583852.581484"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Joshi, R., Leino, K.R.M.: Annotation inference for modular checkers. Information Processing Letters (2001)","DOI":"10.1016\/S0020-0190(00)00196-4"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fournet, C., Kohlweiss, M., Strub, P.-Y.: Modular code-based cryptographic verification. In: CCS, pp. 341\u2013350 (2011)","DOI":"10.1145\/2046707.2046746"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Freeman, T., Pfenning, F.: Refinement types for ML. In: PLDI (1991)","DOI":"10.1145\/113445.113468"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Gopan, D., Reps, T.W., Sagiv, S.: A framework for numeric analysis of array operations. In: POPL, pp. 338\u2013350 (2005)","DOI":"10.1145\/1047659.1040333"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-63166-6_10","volume-title":"Computer Aided Verification","author":"S. Graf","year":"1997","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of Abstract State Graphs with PVS. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 72\u201383. Springer, Heidelberg (1997)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Guha, A., Fredrikson, M., Livshits, B., Swamy, N.: Verified security for browser extensions. In: IEEE Symposium on Security and Privacy, pp. 115\u2013130 (2011)","DOI":"10.1109\/SP.2011.36"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-540-73368-3_23","volume-title":"Computer Aided Verification","author":"R. Jhala","year":"2007","unstructured":"Jhala, R., McMillan, K.L.: Array Abstractions from Proofs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 193\u2013206. Springer, Heidelberg (2007)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kawaguchi, M., Rondon, P., Jhala, R.: Type-based data structure verification. In: PLDI, pp. 304\u2013315 (2009)","DOI":"10.1145\/1543135.1542510"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Knowles, K.W., Flanagan, C.: Hybrid type checking. ACM TOPLAS 32(2) (2010)","DOI":"10.1145\/1667048.1667051"},{"key":"13_CR18","volume-title":"Eiffel: the language","author":"B. Meyer","year":"1992","unstructured":"Meyer, B.: Eiffel: the language. Prentice-Hall, Inc., Upper Saddle River (1992)"},{"key":"13_CR19","unstructured":"Nelson, G.: Techniques for program verification. Technical Report CSL81-10, Xerox Palo Alto Research Center (1981)"},{"key":"13_CR20","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers, SE-412 96 G\u00f6teborg, Sweden (September 2007)"},{"key":"13_CR21","series-title":"IFIP","first-page":"437","volume-title":"TCS 2004","author":"X. Ou","year":"2004","unstructured":"Ou, X., Tan, G., Mandelbaum, Y., Walker, D.: Dynamic Typing with Dependent Types. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol.\u00a0155, pp. 437\u2013450. Springer, Boston (2004)"},{"key":"13_CR22","unstructured":"Pierce, B.C.: Types and Programming Languages. MIT Press (2002)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Rondon, P., Kawaguchi, M., Jhala, R.: Liquid types. In: PLDI (2008)","DOI":"10.1145\/1375581.1375602"},{"key":"13_CR24","unstructured":"Sheard, T.: Type-level computation using narrowing in omega. In: PLPV (2006)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Swamy, N., Chen, J., Fournet, C., Strub, P.-Y., Bhargavan, K., Yang, J.: Secure distributed programming with value-dependent types. In: ICFP, pp. 266\u2013278 (2011)","DOI":"10.1145\/2034574.2034811"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Vytiniotis, D., Peyton Jones, S.L., Magalh\u00e3es, J.: Equality proofs and deferred type errors: a compiler pearl. In: ICFP, pp. 341\u2013352 (2012)","DOI":"10.1145\/2398856.2364554"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Xi, H., Pfenning, F.: Eliminating array bound checking through dependent types. In: PLDI (1998)","DOI":"10.1145\/277650.277732"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37036-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T04:20:32Z","timestamp":1557548432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37036-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370359","9783642370366"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37036-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}