{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:21Z","timestamp":1761611061251},"reference-count":72,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4039,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0304-3975(01)00358-9","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"155-185","source":"Crossref","is-referenced-by-count":91,"title":["ELAN from a rewriting logic point of view"],"prefix":"10.1016","volume":"285","author":[{"given":"Peter","family":"Borovansk\u00fd","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"H\u00e9l\u00e8ne","family":"Kirchner","sequence":"additional","affiliation":[]},{"given":"Pierre-Etienne","family":"Moreau","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00358-9_BIB1","series-title":"The B-Book: Assigning Programs to Meanings","author":"Abrial","year":"1996"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB2","unstructured":"C. Alvarado, Q.-H. Nguyen, ELAN for equational reasoning in COQ, in: J. Despeyroux (Ed.), Proc. 2nd Workshop on Logical Frameworks and Metalanguages, Santa Barbara (California), June 2000."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB3","unstructured":"T. Arts, Automatically proving termination and innermost normalisation of term rewriting systems, Ph.D. Thesis, Universiteit Utrecht, 1997."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB4","series-title":"Term Rewriting and all That","author":"Baader","year":"1998"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB5","doi-asserted-by":"crossref","unstructured":"L. Bachmair, T. Chen, I.V. Ramakrishnan, Associative\u2013commutative discrimination nets, in: M.-C. Gaudel, J.-P. Jouannaud (Eds.), TAPSOFT \u201993: Theory and Practice of Software Development, 4th Intern. Joint Conf. CAAP\/FASE, Lecture Notes in Computer Science, Vol. 668, Orsay, France, April 13\u201317, 1993, Springer, Berlin, pp. 61\u201374.","DOI":"10.1007\/3-540-56610-4_56"},{"issue":"2","key":"10.1016\/S0304-3975(01)00358-9_BIB6","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/inco.1995.1131","article-title":"Basic paramodulation","volume":"121","author":"Bachmair","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB7","unstructured":"H. Barendregt, E. Barendsen, Autartik computations in formal proofs, J. Symbolic Comput., 2002, to appear. 1997."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB8","unstructured":"E. Beffara, O. Bournez, H. Kacem, C. Kirchner, Verification of timed automata using rewrite rules and strategies, in: N. Dershowitz, A. Frank (Eds.), Proc. BISFAI 2001, Tel Aviv (Israel), June 2001."},{"issue":"1 & 2","key":"10.1016\/S0304-3975(01)00358-9_BIB9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","article-title":"Complexity of matching problems","volume":"3","author":"Benanav","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB10","first-page":"363","article-title":"Implementation of higher-order unification based on calculus of explicit substitutions","volume":"Vol. 1012","author":"Borovansk\u00fd","year":"1995"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB11","unstructured":"P. Borovansk\u00fd, Le contr\u00f4le de la r\u00e9\u00e9criture: \u00e9tude et implantation d'un formalisme de strat\u00e9gies, Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy 1, France, October 1998. Also TR LORIA 98-T-326."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB12","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Castro, Cooperation of constraint solvers: using the new process control facilities of ELAN. in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Electronic Notes in Theoretical Computer Science, Vol. 15, Pont-\u00e0-Mousson, France, September 1998, pp. 379\u2013398.","DOI":"10.1016\/S1571-0661(05)82549-6"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB13","unstructured":"P. Borovansk\u00fd, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P.-E. Moreau, C. Ringeissen, M. Vittek, ELAN V 3.3 User Manual, 3rd Edition, LORIA, Nancy, France, December 1998."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB14","article-title":"Controlling rewriting by rewriting","volume":"Vol. 4","author":"Borovansk\u00fd","year":"1996"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB15","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, A functional view of rewriting and strategies for a semantics of ELAN, in: M. Sato, Y. Toyama (Eds.), The 3rd Fuji Internat. Symp. on Functional and Logic Programming, Kyoto, April 1998. World Scientific, Singapore, pp. 143\u2013167. Also report LORIA 98-R-165."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB16","article-title":"ELAN: a logical framework based on computational systems","volume":"Vol. 4","author":"Borovansk\u00fd","year":"1996"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB17","doi-asserted-by":"crossref","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, C. Ringeissen, Rewriting with strategies in ELAN: a functional semantics. Internat. J. Foundations Comput. Sci., 12 (2001) 69\u201395.","DOI":"10.1142\/S0129054101000412"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB18","article-title":"Solving binary CSP using computational systems","volume":"Vol. 4","author":"Castro","year":"1996"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB19","doi-asserted-by":"crossref","first-page":"263","DOI":"10.3233\/FI-1998-34303","article-title":"Building constraint satisfaction problem solvers using rewrite rules and strategies","volume":"34","author":"Castro","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB20","doi-asserted-by":"crossref","unstructured":"C. Castro, COLETTE, prototyping CSP solvers using a rule-based language, in: Proc. 4th Internat. Conf. on Artificial Intelligence and Symbolic Computation, Theory, Implementations and Applications, AISC\u201998, Lecture Notes in Artificial Intelligence, Vol. 1476, Plattsburgh, NY, USA, September 1998.","DOI":"10.1007\/BFb0055906"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB21","unstructured":"H. Cirstea, Calcul de r\u00e9\u00e9criture: fondements et applications, Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy I, 2000."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB22","doi-asserted-by":"crossref","unstructured":"H. Cirstea, C. Kirchner, Using rewriting and strategies for describing the B predicate prover, in: Proc. Workshop on Strategies in Automated Deduction, CADE-15, Lindau, Germany, July 1998.","DOI":"10.1007\/BFb0054239"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB23","series-title":"Frontiers of Combining Systems 2, Research Studies","first-page":"95","article-title":"Combining higher-order and first-order computation using \u03c1-calculus","author":"Cirstea","year":"1999"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB24","doi-asserted-by":"crossref","unstructured":"H. Cirstea, C. Kirchner, The simply typed rewriting calculus, in: K. Futatsugi (Ed.), 3rd Internat. Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Kanazawa, Japan, September 2000.","DOI":"10.1016\/S1571-0661(05)80127-6"},{"issue":"3","key":"10.1016\/S0304-3975(01)00358-9_BIB25","first-page":"427","article-title":"The rewriting calculus \u2014 Part I and II","volume":"9","author":"Cirstea","year":"2001","journal-title":"Logic J. Interest Group Pure Appl. Logics"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB26","unstructured":"H. Cirstea, C. Kirchner, Specifying authentication protocols using rewriting and strategies, in: I.V. Ramakrishnan (Ed.), 3rd Internat. Workshop on Practical Aspects of Declarative Languages, Lecture Notes in Computer Science, Vol. 1990, Las Vegas, USA, Springer, Berlin, March 2001, pp. 138\u2013153."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB27","first-page":"77","article-title":"Matching power","volume":"Vol. 2051","author":"Cirstea","year":"2001"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB28","doi-asserted-by":"crossref","unstructured":"H. Cirstea, C. Kirchner, L. Liquori, The rho cube, in: F. Honsell (Ed.), Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, Vol. 2030, Genova, Italy, Springer, Berlin, April 2001, pp. 166\u2013180.","DOI":"10.1007\/3-540-45315-6_11"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB29","doi-asserted-by":"crossref","unstructured":"M. Clavel, F. Duran, S. Eker, P. Lincoln, J. Meseguer, Metalevel Computation in Maude, in: C. Kirchner, H. Kirchner (Eds.), Proc. 2nd Internat. Workshop on Rewriting Logic and its Applications, WRLA\u201998, Electronic Notes in Theoretical Computer Science, Vol. 15, Pont-\u00e1-Mousson, France, September 1998, pp. 3\u201324.","DOI":"10.1016\/S1571-0661(05)80020-9"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB30","unstructured":"M.G. Clavel, J. Meseguer, Axiomatizing reflective logics and languages, in: G. Kiczales (Ed.), Proc. Reflection\u201996, San Francisco, California, April 1996, pp. 263\u2013288. Xerox PARC, 1996."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB31","series-title":"Handbook of Theoretical Computer Science","first-page":"244","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB32","doi-asserted-by":"crossref","unstructured":"E. Domenjoud, A technical note on AC-unification. the number of minimal unifiers of the equation \u03b1 x1 + \u22ef + \u03b1 xp\u2250AC\u03b2 y1 +\u22ef + \u03b2 yq, J. Automated Reasoning 8 (1992) 39\u201344. Also as research report CRIN 89-R-2.","DOI":"10.1007\/BF00263448"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB33","unstructured":"G. Dowek, La part du Calcul., M\u00e9moire d'habilitation, Universit\u00e9 de Paris 7, 1999."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB34","unstructured":"G. Dowek, T. Hardin, C. Kirchner, Theorem proving modulo, Rapport de Recherche 3400, Institut National de Recherche en Informatique et en Automatique, April 1998, to appear in the JAR."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB35","unstructured":"H. Dubois, H. Kirchner, Objects, rules and strategies in ELAN, in: Proc. 2nd AMAST Workshop on Algebraic Methods in Language Processing, Iowa City, Iowa, USA, May 2000."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB36","first-page":"274","article-title":"Rule based programming with constraints and strategies","volume":"Vol. 1865","author":"Dubois","year":"2000"},{"issue":"5","key":"10.1016\/S0304-3975(01)00358-9_BIB37","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1093\/comjnl\/38.5.381","article-title":"Associative\u2013commutative matching via bipartite graph matching","volume":"38","author":"Eker","year":"1995","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB38","doi-asserted-by":"crossref","unstructured":"O. Fissore, I. Gnaedig, H. Kirchner, Termination of rewriting with local strategies, Technical Report, LORIA, Nancy, France, 2001. http:\/\/www.loria.fr\/\u223cgnaedig\/INDO\/STRAT-LO\/strat-lo.ps.gz.","DOI":"10.1016\/S1571-0661(04)00284-1"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB39","unstructured":"T. Genet, Contraintes d'ordre et automates d'arbres pour les preuves de terminaison, Ph.D. Thesis, Universi\u00e9 Henri Poincar\u00e9 \u2013 Nancy I, 1998."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB40","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB41","doi-asserted-by":"crossref","unstructured":"B. Gramlich, On proving termination by innermost termination, in: H. Ganzinger, Proc. 7th Conf. on Rewriting Techniques and Applications, New Brunswick, NJ, USA, Lecture Notes in Computer Science, Vol. 1103, Springer, Berlin, July 1996, 93\u2013107.","DOI":"10.1007\/3-540-61464-8_45"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB42","unstructured":"J.-M. Hullot, Associative\u2013commutative pattern matching, in: Proc. 9th International Joint Conference on Artificial Intelligence, Tokyo, Japan, 1979."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB43","unstructured":"J.-M. Hullot, Compilation de Formes Canoniques dans les Th\u00e9ories \u00e9quationelles, Th\u00e8se de Doctorat de Troisi\u00e8me Cycle, Universit\u00e9 de Paris Sud, Orsay, France, 1980."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB44","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming","volume":"19\u201320","author":"Jaffar","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB45","unstructured":"J.-P. Jouannaud, H. Kirchner, Completion of a set of rules modulo a set of equations, SIAM J. Comput. 15(4) (1986) 1155\u20131194. Preliminary version in Proc. 11th ACM Symp. on Principles of Programming Languages, Salt Lake City, USA, 1984."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB46","series-title":"Computational Logic. Essays in honor of Alan Robinson","first-page":"257","article-title":"Solving equations in abstract algebras","author":"Jouannaud","year":"1991"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB47","first-page":"54","article-title":"Some extensions of rewriting","volume":"Vol. 909","author":"Kirchner","year":"1995"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB48","doi-asserted-by":"crossref","unstructured":"C. Kirchner, H. Kirchner, Rewriting, Solving, Proving, A preliminary version of a book available at www.loria.fr\/\u223cckirchne\/rsp.ps.gz, 1999.","DOI":"10.1007\/978-3-642-59851-7_9"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB49","series-title":"Principles and Practice of Constraint Programming, The Newport Papers","first-page":"131","article-title":"Designing constraint logic programming languages using computational systems","author":"Kirchner","year":"1995"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB50","first-page":"438","article-title":"Prototyping completion with constraints using computational systems","volume":"Vol. 914","author":"Kirchner","year":"1995"},{"issue":"2","key":"10.1016\/S0304-3975(01)00358-9_BIB51","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S0956796800003907","article-title":"Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative\u2013commutative theories","volume":"11","author":"Kirchner","year":"2001","journal-title":"J. Functional Programming"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB52","unstructured":"C. Kirchner, Z. Qian, P.-K. Singh, J. Stuber, Xemantics: a semantic of XSLT in ELAN, Technical Report A01-R-386, LORIA, 2001."},{"issue":"3","key":"10.1016\/S0304-3975(01)00358-9_BIB53","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1998-34302","article-title":"Rule-based constraint programming","volume":"34","author":"Kirchner","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB54","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1145\/151257.151260","article-title":"A meta-environment for generating programming environments","volume":"2","author":"Klint","year":"1993","journal-title":"ACM Trans. Software Engng. Methodol."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB55","first-page":"57","article-title":"Compilation of pattern matching with associative commutative functions","volume":"Vol. 493","author":"Kounalis","year":"1991"},{"issue":"4","key":"10.1016\/S0304-3975(01)00358-9_BIB56","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1006\/jsco.1994.1049","article-title":"Tree automata help one to solve equational formulae in AC-theories","volume":"18","author":"Lugiez","year":"1994","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB57","doi-asserted-by":"crossref","unstructured":"C. March\u00e9, Normalised rewriting and normalised completion, in: S. Abramsky (Ed.), Proc. 9th IEEE Symp. on Logic in Computer Science, Paris, France, 1994, pp. 394\u2013403.","DOI":"10.1109\/LICS.1994.316050"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB58","doi-asserted-by":"crossref","unstructured":"N. Mart\u0131́-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, 2001. To appear in: D. Gabbay (Ed.), Handbook of Philosophical Logic, Vol. 9, Kluwer Academic Publishers, Dordrecht.","DOI":"10.1007\/978-1-4020-6324-4"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB59","first-page":"228","article-title":"Merging monads and folds for functional programming","volume":"Vol. 925","author":"Meijer","year":"1995"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB60","doi-asserted-by":"crossref","unstructured":"J. Meseguer, General logics, in: H.-D.E. et al. (Eds.), Logic Colloquium\u201987, Elsevier Science Publishers BV, North-Holland, Amsterdam, 1989, pp. 275\u2013329.","DOI":"10.1016\/S0049-237X(08)70132-0"},{"issue":"1","key":"10.1016\/S0304-3975(01)00358-9_BIB61","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional rewriting logic as a unified model of concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB62","doi-asserted-by":"crossref","unstructured":"P.-E. Moreau, H. Kirchner, A compiler for rewrite programs in associative\u2013commutative theories, in: Principles of Declarative Programming, Lecture Notes in Computer Science, Vol. 1490, Springer, Berlin, September 1998, pp. 230\u2013249.","DOI":"10.1007\/BFb0056617"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB63","doi-asserted-by":"crossref","unstructured":"Q.-H. Nguyen, Certifying term rewriting proof in ELAN, in: M. vanden Brand, R. Verma (Eds.), Proc. of RULE\u201901, Vol. 59 of Electronic Notes in Theoretical Computer Science, September 2001.","DOI":"10.1016\/S1571-0661(04)00295-6"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB64","first-page":"436","article-title":"Saturation of first-order (constrained) clauses with the saturate system","volume":"Vol. 690","author":"Nivela","year":"1993"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB65","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322248.322251","article-title":"Complete sets of reductions for some equational theories","volume":"28","author":"Peterson","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB66","first-page":"323","article-title":"Prototyping combination of unification algorithms with the ELAN rule-based programming language","volume":"Vol. 1232","author":"Ringeissen","year":"1997"},{"issue":"1","key":"10.1016\/S0304-3975(01)00358-9_BIB67","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01270929","article-title":"Automated deduction with associative\u2013commutative operators","volume":"6","author":"Rusinowitch","year":"1995","journal-title":"Appl. Algebra Engng., Commun. Comput."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB68","unstructured":"J. Stuber, Experiments with an implementation of extended narrowing and resolution in the rewriting language ELAN (system description), December 2000."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB69","unstructured":"L. Vigneron, D\u00e9duction automatique avec contraintes symboliques dans les th\u00e9ories \u00e9quationnelles, Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy 1, November 1994."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB70","unstructured":"P. Viry, Input\/Output for ELANin: J. Meseguer, Proc. 1st International Workshop on Rewriting Logic and its Applications, WRLA\u201996, Electronic Notes in Theoretical Computer Science, Vol. 4, Asilomar, California, September 1996."},{"key":"10.1016\/S0304-3975(01)00358-9_BIB71","series-title":"The Stratego Tutorial","author":"Visser","year":"1999"},{"key":"10.1016\/S0304-3975(01)00358-9_BIB72","unstructured":"M. Vittek, ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes, Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 Henri Poincar\u00e9 \u2013 Nancy 1, October 1994."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T19:10:30Z","timestamp":1578424230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":72,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0304397501003589"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00358-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}