{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:48Z","timestamp":1725565428656},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_3","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T20:29:36Z","timestamp":1284582576000},"page":"27-42","source":"Crossref","is-referenced-by-count":10,"title":["Abstract Domains Based on Regular Types"],"prefix":"10.1007","author":[{"given":"John P.","family":"Gallagher","sequence":"first","affiliation":[]},{"given":"Kim S.","family":"Henriksen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Fr\u00fchwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: Proceedings of the IEEE Symposium on Logic in Computer Science, Amsterdam (1991)"},{"key":"3_CR2","unstructured":"Mishra, P.: Towards a theory of types in Prolog. In: Proceedings of the IEEE International Symposium on Logic Programming (1984)"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1990","unstructured":"Yardeni, E., Shapiro, E.: A type system for logic programs. Journal of Logic Programming\u00a010(2), 125\u2013154 (1990)","journal-title":"Journal of Logic Programming"},{"key":"3_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (1999), http:\/\/www.grappa.univlille3.fr\/tata"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-58402-1_30","volume-title":"Programming Language Implementation and Logic Programming","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M., Denecker, M.: Abstracting s-semantics using a model-theoretic approach. In: Penjam, J. (ed.) PLILP 1994. LNCS, vol.\u00a0844, pp. 432\u2013446. Springer, Heidelberg (1994)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-58485-4_33","volume-title":"Static Analysis","author":"D. Boulanger","year":"1994","unstructured":"Boulanger, D., Bruynooghe, M.: A systematic construction of abstract domains. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 61\u201377. Springer, Heidelberg (1994)"},{"key":"3_CR7","first-page":"351","volume-title":"Proc. of International Logic Programming Symposium","author":"J. Gallagher","year":"1995","unstructured":"Gallagher, J., Boulanger, D., Sa\u011flam, H.: Practical model-based static analysis for definite logic programs. In: Lloyd, J.W. (ed.) Proc. of International Logic Programming Symposium, pp. 351\u2013365. MIT Press, Cambridge (1995)"},{"key":"3_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1987","unstructured":"Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"3_CR9","unstructured":"Clark, K.: Predicate logic as a computational formalism. Technical Report DOC 79\/59, Imperial College, London, Department of Computing (1979)"},{"key":"3_CR10","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Bottom-up abstract interpretation of logic programs. In: Proceedings of the Fifth International Conference and Symposium on Logic Programming, Washington (1988)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Leuschel, M., J\u00f8rgensen, J.: Efficient specialisation in Prolog using the handwritten compiler generator LOGEN. Elec. Notes Theor. Comp. Sci, vol.\u00a030(2) (1999)","DOI":"10.1016\/S1571-0661(05)80636-X"},{"key":"3_CR12","volume-title":"Proceedings of the 1993 International Symposium on Logic Programming","author":"M. Codish","year":"1993","unstructured":"Codish, M., Demoen, B.: Analysing logic programs using \u201cProp\u201d-ositional logic programs and a magic wand. In: Miller, D. (ed.) Proceedings of the 1993 International Symposium on Logic Programming, Vancouver, MIT Press, Cambridge (1993)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-46419-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Roychoudhury","year":"2000","unstructured":"Roychoudhury, A., Kumar, K.N., Ramakrishnan, C.R., Ramakrishnan, I.V., Smolka, S.A.: Verification of parameterized systems using logic program transformations. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 172\u2013187. Springer, Heidelberg (2000)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-46425-5_5","volume-title":"Programming Languages and Systems","author":"W. Charatonik","year":"2000","unstructured":"Charatonik, W.: Directional type checking for logic programs: Beyond discriminative types. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 72\u201387. Springer, Heidelberg (2000)"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S. Debray","year":"1988","unstructured":"Debray, S., Warren, D.: Automatic mode inference for logic programs. Journal of Logic Programming\u00a05(3), 207\u2013229 (1988)","journal-title":"Journal of Logic Programming"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal of Computing\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM Journal of Computing"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Implementation of Logical Query Languages for Databases. ACM Transactions on Database Systems\u00a010(3) (1985)","DOI":"10.1145\/3979.3980"},{"key":"3_CR18","unstructured":"Schachte, P.: Precise and Efficient Static Analysis of Logic Programs. PhD thesis, Dept. of Computer Science, The University of Melbourne, Australia (1999)"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45635-X_16","volume-title":"Logic Programming","author":"J.M. Howe","year":"2001","unstructured":"Howe, J.M., King, A.: Positive Boolean Functions as Multiheaded Clauses. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 120\u2013134. Springer, Heidelberg (2001)"},{"key":"3_CR20","first-page":"669","volume-title":"Proceedings of ICLP\/SLP","author":"M. Bruynooghe","year":"1988","unstructured":"Bruynooghe, M., Janssens, G.: An instance of abstract interpretation integrating type and mode inferencing. In: Kowalski, R., Bowen, K. (eds.) Proceedings of ICLP\/SLP, pp. 669\u2013683. MIT Press, Cambridge (1988)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-19426-6_13","volume-title":"Logic Programming \u201987","author":"K. Horiuchi","year":"1988","unstructured":"Horiuchi, K., Kanamori, T.: Polymorphic type inference in prolog by abstract interpretation. In: Furukawa, K., Fujisaki, T., Tanaka, H. (eds.) Logic Programming 1987. LNCS, vol.\u00a0315, pp. 195\u2013214. Springer, Heidelberg (1988)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-58485-4_47","volume-title":"Static Analysis","author":"M. Codish","year":"1994","unstructured":"Codish, M., Demoen, B.: Deriving type dependencies for logic programs using multiple incarnations of Prop. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 281\u2013296. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"3_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00122-4","volume":"238","author":"M. Codish","year":"2000","unstructured":"Codish, M., Lagoon, V.: Type dependencies for logic programs using ACIunification. Theoretical Computer Science\u00a0238(1-2), 131\u2013159 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1-4","key":"3_CR24","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Precise and efficient groundness analysis for logic programs. LOPLAS\u00a02(1-4), 181\u2013196 (1993)","journal-title":"LOPLAS"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:19:57Z","timestamp":1605759597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}