{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:33:04Z","timestamp":1726407184112},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540418627"},{"type":"electronic","value":"9783540453093"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45309-1_12","type":"book-chapter","created":{"date-parts":[[2008,11,27]],"date-time":"2008-11-27T19:39:26Z","timestamp":1227814766000},"page":"170-189","source":"Crossref","is-referenced-by-count":0,"title":["Entailment with Conditional Equality Constraints"],"prefix":"10.1007","author":[{"given":"Zhendong","family":"Su","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Aiken","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers, and T.K. Lakshman. Soft Typing with Conditional Types. In Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 163\u2013173, January 1994.","key":"12_CR1","DOI":"10.1145\/174675.177847"},{"unstructured":"L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. DIKU report 94\/19.","key":"12_CR2"},{"key":"12_CR3","first-page":"231","volume-title":"Logic Programming","author":"A. Colmerauer","year":"1982","unstructured":"A. Colmerauer. Prolog and Infinite Trees. In K. L. Clark and S.-A. T\u00e4rnlund, editors, Logic Programming, pages 231\u2013251. Academic Press, London, 1982."},{"unstructured":"A. Colmerauer. Equations and Inequations on Finite and Infinite Trees. In 2nd International Conference on Fifth Generation Computer Systems, pages 85\u201399, 1984.","key":"12_CR4"},{"unstructured":"M. F\u00e4hndrich and A. Aiken. Making Set-Constraint Based Program Analyses Scale. In First Workshop on Set Constraints at CP\u201996, Cambridge, MA, August 1996. Available as Technical Report CSD-TR-96-917, University of California at Berkeley.","key":"12_CR5"},{"doi-asserted-by":"crossref","unstructured":"M. F\u00e4hndrich, J. Foster, Z. Su, and A. Aiken. Partial Online Cycle Elimination in Inclusion Constraint Graphs. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 85\u201396, Montreal, CA, June 1998.","key":"12_CR6","DOI":"10.1145\/277652.277667"},{"doi-asserted-by":"crossref","unstructured":"C. Flanagan and M. Felleisen. Componential Set-Based Analysis. In Proceedings of the 1997 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 235\u2013248, June 1997.","key":"12_CR7","DOI":"10.1145\/258915.258937"},{"doi-asserted-by":"crossref","unstructured":"C. Flanagan, M. Flatt, S. Krishnamurthi, S. Weirich, and M. Felleisen. Catching Bugs in the Web of Program Invariants. In Proceedings of the 1996 ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 23\u201332, May 1996.","key":"12_CR8","DOI":"10.1145\/231379.231387"},{"doi-asserted-by":"crossref","unstructured":"J. Foster, M. F\u00e4hndrich, and A. Aiken. Monomorphic versus Polymorphic Flow-insensitive Points-to Analysis for C. In Proceedings of the 7th International Static Analysis Symposium, pages 175\u2013198, 2000.","key":"12_CR9","DOI":"10.1007\/978-3-540-45099-3_10"},{"unstructured":"James Gosling, Bill Joy, and Guy Steele. The Java Language Specification. Addison Wesley, 1996.","key":"12_CR10"},{"doi-asserted-by":"crossref","unstructured":"N. Heintze. Set Based Analysis of ML Programs. In Proceedings of the 1994 ACM Conference on LISP and Functional Programming, pages 306\u2013317, June 1994.","key":"12_CR11","DOI":"10.1145\/182409.182495"},{"doi-asserted-by":"crossref","unstructured":"F. Henglein and J. Rehof. The Complexity of Subtype Entailment for Simple Types. In Symposium on Logic in Computer Science, pages 352\u2013361, 1997.","key":"12_CR12","DOI":"10.1109\/LICS.1997.614961"},{"doi-asserted-by":"crossref","unstructured":"F. Henglein and J. Rehof. Constraint Automata and the Complexity of Recursive Subtype Entailment. In ICALP98, pages 616\u2013627, 1998.","key":"12_CR13","DOI":"10.1007\/BFb0055089"},{"doi-asserted-by":"crossref","unstructured":"Fritz Henglein. Global Tagging Optimization by Type Inference. In 1992 ACM Conference on Lisp and Functional Programming, pages 205\u2013215, June 1992.","key":"12_CR14","DOI":"10.1145\/141471.141542"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19 & 20","author":"J. Jaffar","year":"1994","unstructured":"Joxan Jaffar and Michael J. Maher. Constraint Logic Programming: A Survey. The Journal of Logic Programming, 19 & 20:503\u2013582, May 1994.","journal-title":"The Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"N. D. Jones and S. S. Muchnick. Flow Analysis and Optimization of LISP-like Structures. In Sixth Annual ACM Symposium on Principles of Programming Languages, pages 244\u2013256, January 1979.","key":"12_CR16","DOI":"10.1145\/567752.567776"},{"doi-asserted-by":"crossref","unstructured":"S. Marlow and P. Wadler. A Practical Subtyping System For Erlang. In Proceedings of the International Conference on Functional Programming (ICFP\u2019 97), pages 136\u2013149, June 1997.","key":"12_CR17","DOI":"10.1145\/258948.258962"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17(3):348\u2013375, December 1978.","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1145\/295656.295662","volume":"20","author":"J. Palsberg","year":"1998","unstructured":"J. Palsberg. Equality-based Flow Analysis versus Recursive Types. ACM Transactions on Programming Languages and Systems, 20(6):1251\u20131264, 1998.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"J. Palsberg and M. I. Schwartzbach. Object-Oriented Type Inference. In Proceedings of the ACM Conference on Object-Oriented programming: Systems, Languages, and Applications, pages 146\u2013161, October 1991.","key":"12_CR20","DOI":"10.1145\/117954.117965"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"M.S. Paterson and M.N. Wegman. Linear Unification. Journal of Computer and Systems Sciences, 16(2):158\u2013167, 1978.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"12_CR22","first-page":"456","volume":"68","author":"J. C. Reynolds","year":"1969","unstructured":"J. C. Reynolds. Automatic Computation of Data Set Definitions, pages 456\u2013461. Information Processing 68. North-Holland, 1969.","journal-title":"Information Processing"},{"doi-asserted-by":"crossref","unstructured":"O. Shivers. Control Flow Analysis in Scheme. In Proceedings of the ACM SIGPLAN\u2019 88 Conference on Programming Language Design and Implementation, pages 164\u2013174, June 1988.","key":"12_CR23","DOI":"10.1145\/53990.54007"},{"issue":"3","key":"12_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0743-1066(94)90044-2","volume":"18","author":"G. Smolka","year":"1994","unstructured":"G. Smolka and R. Treinen. Records for Logic Programming. Journal of Logic Programming, 18(3):229\u2013258, 1994.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"B. Steensgaard. Points-to Analysis in Almost Linear Time. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 32\u201341, January 1996.","key":"12_CR25","DOI":"10.1145\/237721.237727"},{"key":"12_CR26","series-title":"Technical Report","volume-title":"Entailment with Conditional Equality Constraints","author":"Z. Su","year":"2000","unstructured":"Z. Su and A. Aiken. Entailment with Conditional Equality Constraints. Technical Report UCB\/\/CSD-00-1113, University of California, Berkeley, October 2000."},{"doi-asserted-by":"crossref","unstructured":"Z. Su, M. F\u00e4hndrich, and A. Aiken. Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs. In Proceedings of the 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 81\u201395, 2000.","key":"12_CR27","DOI":"10.1145\/325694.325706"},{"doi-asserted-by":"crossref","unstructured":"R.E. Tarjan. Efficiency of a Good but Not Linear Set Union Algorithm. JACM, pages 215\u2013225, 1975.","key":"12_CR28","DOI":"10.1145\/321879.321884"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45309-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T16:30:09Z","timestamp":1557937809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45309-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540418627","9783540453093"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45309-1_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}