{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:21Z","timestamp":1725544041149},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330950"},{"type":"electronic","value":"9783540330967"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11693024_18","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T13:30:35Z","timestamp":1143552635000},"page":"264-278","source":"Crossref","is-referenced-by-count":24,"title":["Inference of User-Defined Type Qualifiers and Qualifier Rules"],"prefix":"10.1007","author":[{"given":"Brian","family":"Chin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shane","family":"Markstrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Todd","family":"Millstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/378795.378846","volume-title":"Proceedings of the ACMSIGPLAN 2001 conference on Programming language design and implementation","author":"T. Ball","year":"2001","unstructured":"Ball, T., Majumdar, R., Millstein, T., Rajamani, S.K.: Automatic predicate abstraction of C programs. In: Proceedings of the ACMSIGPLAN 2001 conference on Programming language design and implementation, pp. 203\u2013213. ACM Press, New York (2001)"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1065010.1065022","volume-title":"PLDI 2005: Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation","author":"B. Chin","year":"2005","unstructured":"Chin, B., Markstrum, S., Millstein, T.: Semantic type qualifiers. In: PLDI 2005: Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 85\u201395. ACM Press, New York (2005)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Chin, B., Markstrum, S., Millstein, T., Palsberg, J.: Inference of user-defined type qualifiers and qualifier rules. Technical Report CSD-TR-050041, UCLA Computer Science Department (October 2005)","DOI":"10.1007\/11693024_18"},{"key":"18_CR4","first-page":"198","volume-title":"ICFP 2000: Proceedings of the ACM SIGPLAN International Conference on Functional Programming","author":"R. Davies","year":"2000","unstructured":"Davies, R., Pfenning, F.: Intersection types and computational effects. In: ICFP 2000: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pp. 198\u2013208. ACM Press, New York (2000)"},{"key":"18_CR5","unstructured":"Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs (2003)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Foster, J.S., F\u00e4hndrich, M., Aiken, A.: A Theory of Type Qualifiers. In: Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, Georgia, pp. 192\u2013203 (May 1999)","DOI":"10.1145\/301618.301665"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/512529.512531","volume-title":"Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation","author":"J.S. Foster","year":"2002","unstructured":"Foster, J.S., Terauchi, T., Aiken, A.: Flow-sensitive type qualifiers. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp. 1\u201312. ACM Press, New York (2002)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/113445.113468","volume-title":"PLDI 1991: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation","author":"T. Freeman","year":"1991","unstructured":"Freeman, T., Pfenning, F.: Refinement types for ML. In: PLDI 1991: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, pp. 268\u2013277. ACM Press, New York (1991)"},{"key":"18_CR9","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":"18_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/944705.944725","volume-title":"Proceedings of the eighth ACMSIGPLAN international conference on Functional programming","author":"Y. Mandelbaum","year":"2003","unstructured":"Mandelbaum, Y., Walker, D., Harper, R.: An effective theory of type refinements. In: Proceedings of the eighth ACMSIGPLAN international conference on Functional programming, pp. 213\u2013225. ACM Press, New York (2003)"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"M. Odersky","year":"1999","unstructured":"Odersky, M., Sulzmann, M., Wehr, M.: Type inference with constrained types. Theor. Pract. Object Syst.\u00a05(1), 35\u201355 (1999)","journal-title":"Theor. Pract. Object Syst."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Reps, T.W., Sagiv, S., Yorsh, G.: Symbolic implementation of the best transformer. In: 5th International Conference on Verification, Model Checking, and Abstract Interpretation, pp. 252\u2013266 (2004)","DOI":"10.1007\/978-3-540-24622-0_21"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Yorsh, G., Reps, T.W., Sagiv, S.: Symbolically computing most-precise abstract operations for shape analysis. In: 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 530\u2013545 (2004)","DOI":"10.1007\/978-3-540-24730-2_39"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11693024_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:16:29Z","timestamp":1555521389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11693024_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330950","9783540330967"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11693024_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}