{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:27:06Z","timestamp":1748071626264,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540586012"},{"type":"electronic","value":"9783540490326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58601-6_107","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:28Z","timestamp":1330274248000},"page":"281-298","source":"Crossref","is-referenced-by-count":23,"title":["Set constraints and set-based analysis"],"prefix":"10.1007","author":[{"given":"Nevin","family":"Heintze","sequence":"first","affiliation":[]},{"given":"Joxan","family":"Jaffar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers, \u201cSolving Systems of Set Constraints\u201d, Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, pp. 329\u2013340, June 1992.","DOI":"10.1109\/LICS.1992.185545"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"A. Aiken and E. Wimmers, \u201cType Inclusion Constraints and Type Inference\u201d, Proc. 1993 Conf. on Functional Programming and Computer Architecture, Copenhagen, pp. 31\u201341, June 1993.","DOI":"10.1145\/165180.165188"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Aiken, E. Wimmers and T.K. Lakshman, \u201cSoft Typing with Conditional Types\u201d Proc. 21st ACM Symp. on Principles of Programming Languages, Portland, OR, pp. 163\u2013173, January 1994.","DOI":"10.1145\/174675.177847"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen and E. Wimmers, \u201cDecidability of Systems of Set Constraints with Negative Constraints\u201d, IBM Research Report RJ 9421, 1993.","DOI":"10.7146\/brics.v1i32.21611"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger and U. Waldmann, \u201cSet Constraints are the Monadic Class\u201d, Proc. 8th IEEE Symp. on Logic in Computer Science, 75\u201383, 1993.","DOI":"10.1109\/LICS.1993.287598"},{"key":"23_CR6","unstructured":"W. Charatonik and L. Pacholski, \u201cNegative Set Constraints: an Easy Proof of Decidability\u201d, Proc. 9th IEEE Symp. on Logic in Computer Science, 1994, to appear."},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot, \u201cAbstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints\u201d, Proc. 4th ACM Symp. on Principles of Programming Languages, Los Angeles, pp. 238\u2013252, January 1977.","DOI":"10.1145\/512950.512973"},{"key":"23_CR8","unstructured":"J. Gallagher and D.A. de Wall, \u201cFast and Precise Regular Approximations of Logic Programs\u201d, Proc. International Conf. on Logic Programming, MIT Press, to appear 1994."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison and M. Tommasi, \u201cSolving Systems of Set Constraints using Tree Automata\u201d, Proc. 10th Annual Symposium on Theoretical Aspects of Computer Science, pp. 505\u2013514, 1992.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"R. Gilleron, S. Tison and M. Tommasi, \u201cSolving Systems of Set Constraints with Negated Subset Relationships\u201d, in Foundations of Computer Science, 372\u2013380, 1993.","DOI":"10.1007\/3-540-56503-5_50"},{"key":"23_CR11","first-page":"765","volume-title":"Practical Aspects of Set-Based Analysis","author":"N. Heintze","year":"1992","unstructured":"N. Heintze, \u201cPractical Aspects of Set-Based Analysis\u201d, Proc. Joint International Conf. and Symp. on Logic Programming, Washington D.C., MIT Press, pp. 765\u2013779, November 1992."},{"key":"23_CR12","unstructured":"N. Heintze, \u201cSet-Based Program Analysis\u201d, Ph.D. thesis, School of Computer Science, Carnegie Mellon University, October 1992."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"N. Heintze, \u201cSet-Based Analysis of ML Programs\u201d, to appear, ACM Conference on Lisp and Functional Programming, 1994.","DOI":"10.1145\/182409.182495"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"N. Heintze, \u201cSet-Based Analysis of Arithmetic\u201d, Carnegie Mellon University technical report CMU-CS-93-221, 20pp., December 1993.","DOI":"10.21236\/ADA274112"},{"key":"23_CR15","unstructured":"N. Heintze, \u201cSet Constraints in Program Analysis\u201d, Workshop on Global Compilation, International Logic Programming Symposium, October 1993."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar, \u201cA Finite Presentation Theorem for Approximating Logic Programs\u201d, Proc. 17th ACM Symp. on Principles of Programming Languages, San Francisco, pp. 197\u2013209, January 1990. (A full version of this paper appears as IBM Technical Report RC 16089 (# 71415), 66 pp., August 1990.)","DOI":"10.1145\/96709.96729"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar, \u201cA Decision Procedure for a Class of Herbrand Set Constraints\u201d, Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, pp. 42\u201351, June 1990. (A full version of this paper appears as Carnegie Mellon University Technical Report CMU-CS-91-110, 42 pp., February 1991.)","DOI":"10.1109\/LICS.1990.113732"},{"key":"23_CR18","unstructured":"N. Heintze and J. Jaffar, \u201cSemantic Types for Logic Programs\u201d in Types in Logic Programming, F. Pfenning (Bd.), MIT Press Series in Logic Programming, pp. 141\u2013155, 1992."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar, \u201cAn Engine for Logic Program Analysis\u201d, Proc. 7th IEEE Symp. on Logic in Computer Science, Santa Cruz, pp. 318\u2013328, June 1992.","DOI":"10.1109\/LICS.1992.185544"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"T. Jensen and T. Mogensen, \u201cA Backwards Analysis for Compile-Time Garbage Collection\u201d, Proc. 3rd European Symp. on Programming, Copenhagen, LNCS 432, pp. 227\u2013239, May 1990.","DOI":"10.1007\/3-540-52592-0_66"},{"key":"23_CR21","unstructured":"N. Jones, \u201cFlow Analysis of Lazy Higher-Order Functional Programs\u201d, in Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin (Eds.), Ellis Horwood, 1987."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"N. Jones and S. Muchnick, \u201cFlow Analysis and Optimization of LISP-like Structures\u201d, Proc. 6th ACM Symp. on Principles of Programming Languages, San Antonio, pp. 244\u2013256, January 1979.","DOI":"10.1145\/567752.567776"},{"key":"23_CR23","unstructured":"R. Milner, M. Tofte and R. Harper, \u201cThe Definition of Standard ML\u201d, MIT Press, 1990."},{"key":"23_CR24","first-page":"12","volume-title":"Separating Binding Times in Language Specifications","author":"T. Mogensen","year":"1989","unstructured":"T. Mogensen, \u201cSeparating Binding Times in Language Specifications\u201d, Proc. Functional Programming and Computer Architecture, London, ACM, pp. 12\u201325, September 1989."},{"key":"23_CR25","unstructured":"P. Mishra, \u201cToward a Theory of Types in PROLOG\u201d, Proc. 1st IEEE Symp. on Logic Programming, Atlantic City, pp. 289\u2013298, 1984."},{"key":"23_CR26","unstructured":"L. Pacholski, personal communication, March 1994."},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"J. Palsberg and M. Schwartzbach, \u201cSafety Analysis versus Type Inference for Partial Types\u201d Information Processing Letters, Vol 43, pp. 175\u2013180, North-Holland, September 1992.","DOI":"10.1016\/0020-0190(92)90196-3"},{"key":"23_CR28","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"M.O. Rabin, \u201cDecidability of Second-order Theories and Automata on Infinite Trees\u201d, Transactions of the American Math. Society 141, pp 1\u201335, 1969.","journal-title":"Transactions of the American Math. Society"},{"key":"23_CR29","unstructured":"J. Reynolds, \u201cAutomatic Computation of Data Set Definitions\u201d, Information Processing 68, pp. 456\u2013461, North-Holland, 1969."},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"P. Sestoft, \u201cReplacing Function Parameters by Global Variables\u201d, Proc. Functional Programming and Computer Architecture, London, ACM, pp. 39\u201353, September 1989.","DOI":"10.1145\/99370.99374"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"T.E. Uribe, \u201cSorted Unification using Set Constraints\u201d, Proc. 11th Intl. Conf. on Automated Deduction, D. Kapur (Ed), Springer Verlag Lecture Notes in Computer Science, 1992.","DOI":"10.1007\/3-540-55602-8_163"},{"key":"23_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1991","unstructured":"E. Yardeni and E.Y. Shapiro, \u201cA Type System for Logic Programs\u201d, Journal of Logic Programming, Vol. 10, pp. 125\u2013153, 1991. (An early version of this paper appears in Concurrent PROLOG: Collected Papers, Vol. 2, MIT Press, pp 211\u2013244, 1987.)","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58601-6_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:36:26Z","timestamp":1742596586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58601-6_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540586012","9783540490326"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-58601-6_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}