{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:40Z","timestamp":1725664300881},"publisher-location":"Berlin, Heidelberg","reference-count":69,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591559"},{"type":"electronic","value":"9783540492009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59155-9_9","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:04:34Z","timestamp":1330257874000},"page":"147-170","source":"Crossref","is-referenced-by-count":0,"title":["Abstract interpretation and finite domain symbolic constraints"],"prefix":"10.1007","author":[{"given":"Baudouin","family":"Charlier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"volume-title":"Abstract Interpretation of Declarative Languages","year":"1987","key":"9_CR1","unstructured":"S. Abramsky and C. Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood Limited, West Sussex, England, 1987."},{"key":"9_CR2","unstructured":"S. Abramsky and C. Hankin. An introduction to abstract interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 1, pages 9\u201331. Ellis Horwood Limited, 1987."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"O. Agesen. Constraint-Based Type Inference and Parametric Polymorphism. In [43], pages 78\u2013101, 1994.","DOI":"10.1007\/3-540-58485-4_34"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"A. Aiken and T.K. Lakshman. Directional Type Checking of Logic Programs. In [43], pages 43\u201360, 1994.","DOI":"10.1007\/3-540-58485-4_32"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"T. Armstrong, K. Marriott, P. Schachte, and H. S\u00f8ndergaard. Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. In [43], pages 266\u2013280, 1994.","DOI":"10.1007\/3-540-58485-4_46"},{"key":"9_CR6","first-page":"307","volume-title":"Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity","author":"F. Bourdoncle","year":"1990","unstructured":"F. Bourdoncle. Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity. In P. Deransart and J. Maluszy\u0144ski, editors, Proceedings of the Programming Language Implementation and Logic Programming (PLILP'90), volume 456 of Lectures Notes in Computer Science, pages 307\u2013323, Link\u00f6ping, Sweden, August 1990. Springer-Verlag."},{"key":"9_CR7","unstructured":"F. Bourdoncle. S\u00e9mantique des Langages Imp\u00e9ratifs d'Ordre Sup\u00e9rieur et Interpr\u00e9tation Abstraite. PhD thesis, Paris, France, November 1992. In French."},{"issue":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M. Bruynooghe","year":"1991","unstructured":"M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91\u2013124, February 1991.","journal-title":"Journal of Logic Programming"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"M. Bruynooghe and D. Boulanger. Abstract Interpretation for (Constraint) Logic Programming. In B. Mayoh, E. To\u00fcgu, and J. Penjam, editors, Constraint Programming, Advanced Science Series, Computers and System Sciences. Springer Verlag, 1994.","DOI":"10.1007\/978-3-642-85983-0_9"},{"key":"9_CR10","first-page":"192","volume-title":"Abstract interpretation: Towards the global optimization of Prolog programs","author":"M. Bruynooghe","year":"1987","unstructured":"M. Bruynooghe, G. Janssens, A. Callebaut, and B. Demoen. Abstract interpretation: Towards the global optimization of Prolog programs. In Proceedings of the 1987 Symposium on Logic Programming, pages 192\u2013204, San Francisco, California, August 1987. Computer Society Press of the IEEE."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"R. Bryant. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys, 1992.","DOI":"10.1145\/136035.136043"},{"key":"9_CR12","volume-title":"Analysing Logic Programs using \u201cProp\u201d-ositional Logic Programs and a Magic Wand","author":"M. Codish","year":"1993","unstructured":"M. Codish and B. DeMoen. Analysing Logic Programs using \u201cProp\u201d-ositional Logic Programs and a Magic Wand. In D. Miller, editor, Proceedings of (ILPS'93), Vancouver, Canada, October 1993. MIT Press."},{"key":"9_CR13","unstructured":"P. Codognet and G. Fil\u00e9. Computations, abstractions and constraints in logic programs. In Proceedings of the fourth International Conference on Programming languages (ICCL'92), Oakland, U.S.A., April 1992."},{"key":"9_CR14","volume-title":"volume 714 of Lecture Notes in Computer Science","author":"M.-M. Corsini","year":"1993","unstructured":"M.-M. Corsini, K. Musumbu, A. Rauzy, and B. Le Charlier. Efficient Bottom-up Abstract Interpretation of Logic Programs by means of Constraint Solving over Symbolic Finite Domains. In Penjam J. and M. Bruynooghe, editors, Proceedings of the Fifth International Workshop on Programming Language Implementation and Logic Programming (PLILP'93), volume 714 of Lecture Notes in Computer Science, Tallin, August 1993. Springer-Verlag."},{"key":"9_CR15","volume-title":"Technical report, Institute of Computer Science","author":"M.-M. Corsini","year":"1993","unstructured":"M.-M. Corsini, K. Musumbu, A. Rauzy, and B. Le Charlier. Efficient Bottom-up Abstract Interpretation of Logic Programs by means of Constraint Solving over Symbolic Finite Domains. Technical report, Institute of Computer Science, University of Namur, Belgium, (also LaBri, Bordeaux), March 1993."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"A. Cortesi, G. Fil\u00e8, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science (LICS'91), 1991.","DOI":"10.1109\/LICS.1991.151656"},{"key":"9_CR17","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Groundness Analysis for Prolog: Implementation and Evaluation of the Domain prop. Journal of Logic Programming. to appear."},{"key":"9_CR18","unstructured":"A. Cortesi, B. Le Charlier, and P. Van Hentenryck. Type analysis of prolog using type graphs. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Programming Language Design and Implementation (PLDI'94), Orlando, Florida, June 1994. (An extended version will appear in the Journal of Logic Programming.)."},{"key":"9_CR19","first-page":"106","volume-title":"Static determination of dynamic properties of programs","author":"P. Cousot","year":"1976","unstructured":"P. Cousot and R. Cousot. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programmings, pages 106\u2013130, Paris, April 1976. Dunod."},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of Fourth ACM Symposium on Programming Languages (POPL'77), pages 238\u2013252, Los Angeles, California, January 1977.","DOI":"10.1145\/512950.512973"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. Journal of Logic Programming, 13(2\u20133), 1992.","DOI":"10.1016\/0743-1066(92)90030-7"},{"key":"9_CR22","volume-title":"Lecture Notes in Computer Science","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Comparison of the Galois connection and widening\/narrowing approaches to abstract interpretation (invited paper). In M. Bruynooghe and M. Wirsing, editors, Proceedings of the Fourth International Workshop on Programming Language Implementation and Logic Programming (PLILP'92), Lecture Notes in Computer Science, Leuven, August 1992. Springer-Verlag."},{"key":"9_CR23","first-page":"222","volume-title":"Static type analysis of Prolog procedures for ensuring correctness","author":"P. Boeck De","year":"1990","unstructured":"P. De Boeck and B. Le Charlier. Static type analysis of Prolog procedures for ensuring correctness. In Proceedings of Programming Language Implementation and Logic Programming (PLILP'90), volume 456 of Lecture Notes in Computer Science, pages 222\u2013237, Link\u00f6ping, Sweden, August 1990. Springer-Velag."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"P. De Boeck and B. Le Charlier. Mechanical Transformation of Logic Definitions augmented with Type Information into Prolog Procedures: Some Experiments. In Proceedings of (LOPSTR'93). Springer Verlag, July 1993.","DOI":"10.1007\/978-1-4471-3234-9_19"},{"key":"9_CR25","unstructured":"Y. Deville. Logic Programming: Systematic Program Development. MIT Press 1990."},{"key":"9_CR26","volume-title":"PhD thesis","author":"V. Dumortier","year":"1994","unstructured":"V. Dumortier. Freeness and Related Analyses of Constraint Logic Programs using Abstract Interpretation. PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, November 1994."},{"issue":"4","key":"9_CR27","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/spe.4380230406","volume":"23","author":"V. Englebert","year":"1993","unstructured":"V. Englebert, B. Le Charlier, D. Roland, and P. Van Hentenryck. Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation. Software Practice and Experience, 23 (4):419\u2013459, April 1993.","journal-title":"Software Practice and Experience"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Cousot et all (Eds.). Static Analysis: Proceedings of the Third International Workshop on Static Analysis. Number 724 in Lecture Notes in Computer Science. Springer-Verlag, September 1993.","DOI":"10.1007\/3-540-57264-3"},{"issue":"3","key":"9_CR29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","volume":"69","author":"M. Falaschi","year":"1989","unstructured":"M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behaviour of Logic Languages. Theoretical Computer Science, 69(3):289\u2013318, 1989.","journal-title":"Theoretical Computer Science"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Thomas W. Getzinger. The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization. In [43], pages 1\u201325, 1994.","DOI":"10.1007\/3-540-58485-4_30"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"N. Halbwachs. About Synchronous Programming and Abstract Interpretation. In [43], pages 179\u2013192, 1994.","DOI":"10.1007\/3-540-58485-4_40"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"N. Halbwachs. Verification of Linear Hybrid Systems by Means of Convex Approximations. In [43], pages 223\u2013237, 1994.","DOI":"10.1007\/3-540-58485-4_43"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(4), 1992.","DOI":"10.1016\/0743-1066(92)90032-X"},{"key":"9_CR34","unstructured":"R.B. Kieburtz and M. Napierala. Abstract semantics. In S. Abramsky and C, Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 7, pages 143\u2013180. Ellis Horwood Limited, 1987."},{"key":"9_CR35","volume-title":"number 724 in Lecture Notes in Computer Science","author":"B. Charlier Le","year":"1993","unstructured":"B. Le Charlier, O. Degimbe, L. Michel, and P. Van Hentenryck. Optimization Techniques for General Purpose Fixpoint Algorithms: Practical Efficiency for the Abstract Interpretation of Prolog. In Cousot P. and all, editors, Proc of the Third International Workshop on Static Analysis (WSA'93), number 724 in Lecture Notes in Computer Science, Padova, September 1993. Springer-Verlag."},{"key":"9_CR36","volume-title":"A generic abstract interpretation algorithm and its complexity analysis","author":"B. Charlier Le","year":"1991","unstructured":"B. Le Charlier, K. Musumbu, and P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis. In K. Furukawa, editor, Proceedings of the Eighth International Conference on Logic Programming (ICLP'91), Paris, France, June 1991. MIT Press."},{"key":"9_CR37","volume-title":"An Abstract Interpretation Framework Which Accurately Handles Prolog Search-Rule and the Cut","author":"B. Charlier Le","year":"1994","unstructured":"B. Le Charlier, S. Rossi, and P. Van Hentenryck. An Abstract Interpretation Framework Which Accurately Handles Prolog Search-Rule and the Cut. In M. Bruynooghe, editor, Proceedings of the International Logic Programming Symposium (ILPS'94), Ithaca NY, USA, November 1994. MIT Press."},{"key":"9_CR38","first-page":"81","volume-title":"On the Design of Generic Abstract Interpretation Frameworks","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. On the Design of Generic Abstract Interpretation Frameworks. In M. Billaud and all, editors, Proceedings of the Workshop on Static Analysis (WSA'92), Bordeaux, France, September 1992. Bigre 81\u201382."},{"key":"9_CR39","volume-title":"Reexecution in abstract interpretation of prolog","author":"B. Charlier Le","year":"1992","unstructured":"B. Le Charlier and P. Van Hentenryck. Reexecution in abstract interpretation of prolog. In K. Apt, editor, Proceedings of the Join International Conference and Symposium on Logic Programming (JICSLP'92), Washington, U.S.A., November 1992. MIT Press."},{"key":"9_CR40","unstructured":"B. Le Charlier and P. Van Hentenryck. A general top-down fixpoint algorithm (revised version). Technical Report 93\u201322, Institute of Computer Science, University of Namur, Belgium, (also Brown University), June 1993."},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"B. Le Charlier and P. Van Hentenryck. Groundness Analysis for Prolog: Implementation and Evaluation of the Domain prop (extended abstract). In Proc. of the 1993 ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM'93), June 1993. (An extended version will appear in the Journal of Logic Programming.).","DOI":"10.1145\/154630.154641"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"B. Le Charlier and P. Van Hentenryck. Experimental Evaluation of a Generic Abstract interpretation Algorithm for Prolog. ACM Transactions on Programming Languages and Systems (TOPLAS), January 1994.","DOI":"10.1145\/174625.174627"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"B. Le Charlier (Ed.). Static Analysis: Proceedings of the First International Static Analysis Symposium. Number 864 in Lecture Notes in Computer Science. Springer-Verlag, September 1994.","DOI":"10.1007\/3-540-58485-4"},{"key":"9_CR44","volume-title":"PhD thesis","author":"C. Lecoutre","year":"1994","unstructured":"C. Lecoutre. Interpretation Abstraite en Programmation Logique avec Contraintes. PhD thesis, Universit\u00e9 de Lille, Lille, France, February 1994. In French."},{"key":"9_CR45","unstructured":"P. Lefebvre, B. Le Charlier, and E. Villemonte de la Clergerie. Yet another efficient implementation of the domain Prop using a \u201cLogical Push-Down Automaton\u201d-based Logic Program Interpreter and a Constraint Solver Over Finite Domains. In Proceedings of (Benelog'93), Antwerpen, September 1993."},{"key":"9_CR46","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer Series: Symbolic Computation-Artificial Intelligence. Springer-Verlag, second, extended edition, 1987."},{"key":"9_CR47","first-page":"733","volume-title":"Bottom-up abstract interpretation of logic programs","author":"K. Marriott","year":"1988","unstructured":"K. Marriott and H. S\u00f8ndergaard. Bottom-up abstract interpretation of logic programs. In R.A. Kowalski and K.A. Bowen, editors, Proceeding of Fifth International Conference on Logic Programming (ICLP'88), pages 733\u2013748, Seattle, Washington, August 1988. MIT Press."},{"key":"9_CR48","unstructured":"K. Marriott and H. S\u00f8ndergaard. Notes for a tutorial on abstract interpretation of logic programs. In North American Conference on Logic Programming (NACLP'89), Cleveland, Ohio, 1989."},{"key":"9_CR49","unstructured":"K. Marriott and H. S\u00f8ndergaard. Precise and Efficient Groundness Analysis for Logic Programs. Technical Report 93\/7, University of Melbourne, Australia, 1993."},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"L. Mauborgne. Abstract Interpretation using TDGs. In [43], pages 363\u2013379, 1994.","DOI":"10.1007\/3-540-58485-4_52"},{"key":"9_CR51","unstructured":"C.S. Mellish. Abstract Interpretation of Prolog Programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 8, pages 181\u2013198. Ellis Horwood Limited, 1987."},{"key":"9_CR52","unstructured":"N. Mercouroff. Analyse S\u00e9mantique des Communications entre Processus de Programmes Parall\u00e8les. PhD thesis, Ecole polytechnique, Paris, France, September 1990. In French."},{"key":"9_CR53","first-page":"267","volume-title":"number 724 in Lecture Notes in Computer Science","author":"B. Monsuez","year":"1993","unstructured":"B. Monsuez. Polymorphic Types and Widening Operators. In Cousot P. and all, editors, Proc of the Third International Workshop on Static Analysis (WSA'93), number 724 in Lecture Notes in Computer Science, pages 267\u2013281, Padova, September 1993. Springer-Verlag."},{"key":"9_CR54","unstructured":"K. Musumbu. Interpr\u00e9tation Abstraite de Programmes Prolog. PhD thesis, Institute of Computer Science, University of Namur, Belgium, September 1990. In French."},{"issue":"2\u20133","key":"9_CR55","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. Hermenegildo. Compile-Time Derivation of Variable Dependency Using Abstract Interpretation. Journal of Logic Programming, 13(2\u20133):315\u2013347, August 1992.","journal-title":"Journal of Logic Programming"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"L. Naish. Specification=program+types. In K. Nori, editor, Foundations of Software Technology and Theoretical Computer Science, number 287 in LNCS. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18625-5_58"},{"key":"9_CR57","unstructured":"F. Nielson. Towards a denotational theory of abstract interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 10, pages 219\u2013245. Ellis Horwood Limited, 1987."},{"key":"9_CR58","first-page":"293","volume-title":"volume 456 of Lecture Notes in Computer Science","author":"U. Nilsson","year":"1990","unstructured":"U. Nilsson. Systematic semantic approximations of logic programs. In P. Deransart and J. Maluszy\u0144ski, editors, Proceedings of the International Workshop on Programming Language Implementation and Logic Programming (PLILP'90), volume 456 of Lecture Notes in Computer Science, pages 293\u2013306, Link\u00f6ping, Sweden, August 1990. Springer-Verlag."},{"key":"9_CR59","first-page":"729","volume-title":"Finite fixed-point problems","author":"R.A. O'Keefe","year":"1987","unstructured":"R.A. O'Keefe. Finite fixed-point problems. In J-L. Lassez, editor, Proceedings of the Fourth International Conference on Logic Programming (ICLP'87), pages 729\u2013743, Melbourne, Australia, May 1987. MIT Press."},{"key":"9_CR60","unstructured":"F. Pfenning. Types in Logic Programming. Logic Programming Series. Addison Wesley, 1992."},{"key":"9_CR61","unstructured":"A. Rauzy. Toupie: a constraint language for model checking. In this volume."},{"key":"9_CR62","doi-asserted-by":"crossref","unstructured":"K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. In [43], pages 408\u2013423, 1994.","DOI":"10.1007\/3-540-58485-4_55"},{"key":"9_CR63","volume-title":"An Abstract Machine for SLG Resolution: Definite Programs","author":"T. Swift","year":"1994","unstructured":"T. Swift and D. S. Warren. An Abstract Machine for SLG Resolution: Definite Programs. In M. Bruynooghe, editor, Proceedings of the International Logic Programming Symposium (ILPS'94), Ithaca NY, USA, November 1994. MIT Press."},{"key":"9_CR64","volume-title":"number 724 in Lecture Notes in Computer Science","author":"P. Hentenryck Van","year":"1993","unstructured":"P. Van Hentenryck, O. Degimbe, B. Le Charlier, and L. Michel. The impact of Granularity in Abstract Interpretation of Prolog. In Cousot P. and all, editors, Proc of the Third International Workshop on Static Analysis (WSA '93), number 724 in Lecture Notes in Computer Science, Padova, September 1993. Springer-Verlag."},{"key":"9_CR65","doi-asserted-by":"crossref","unstructured":"P. Van Roy. 1983\u20131993: The Wonder Years of Sequential Prolog Implementation. Journal of Logic Programming, Tenth Anniversary Issue, 1994. to appear.","DOI":"10.1016\/0743-1066(94)90031-0"},{"key":"9_CR66","doi-asserted-by":"crossref","unstructured":"B. Vergauwen. Efficient FixPoint Computation. In [43], pages 314\u2013328, 1994.","DOI":"10.1007\/3-540-58485-4_49"},{"key":"9_CR67","volume-title":"PhD thesis, Department of Computer Science","author":"K. Verschaetse","year":"1993","unstructured":"K. Verschaetse. Termination Analysis of Logic Programs. PhD thesis, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 1993."},{"key":"9_CR68","volume-title":"PhD thesis","author":"E. V. Clergerie de la","year":"1993","unstructured":"E. Villemonte de la Clergerie. Automates \u00e0 Piles et Programmation Dynamique: DyALog, Application \u00e0 la Programmation en Logique. PhD thesis, Universit\u00e9 Paris VII, Paris, France, June 1993. In French."},{"key":"9_CR69","doi-asserted-by":"crossref","unstructured":"Kwangkeun Yi. Compile-time Detection of Uncaught Exceptions in Standard ML Programs. In [43], pages 238\u2013254, 1994.","DOI":"10.1007\/3-540-58485-4_44"}],"container-title":["Lecture Notes in Computer Science","Constraint Programming: Basics and Trends"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59155-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:42Z","timestamp":1605630342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59155-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591559","9783540492009"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/3-540-59155-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}