{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T12:40:42Z","timestamp":1747572042857},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3406,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82599-x","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"395-409","source":"Crossref","is-referenced-by-count":8,"title":["On the Recognition of Algorithm Templates"],"prefix":"10.1016","volume":"82","author":[{"given":"Christophe","family":"Alias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Barthou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82599-X_BIB1","series-title":"Handbook of Formal Languages","article-title":"Context-free languages and pushdown automata","author":"Autebert","year":"1997"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB2","series-title":"\u201cTerm Rewriting and all that,\u201d","author":"Baader","year":"1998"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB3","series-title":"Technical Report RR-4285, INRIA","article-title":"On the equivalence of two systems of affine recurrence equations","author":"Barthou","year":"2001"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB4","series-title":"8th International Euro-Par Conference","first-page":"309","article-title":"On the equivalence of two systems of affine recurrence equations","author":"Barthou","year":"2002"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB5","series-title":"\u201cScheduling and automatic Parallelization,\u201d","author":"Darte","year":"2000"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","article-title":"Dataflow analysis of scalar and array references","volume":"20","author":"Feautrier","year":"1991","journal-title":"Int. J. of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB7","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01379404","article-title":"Some efficient solutions to the affine scheduling problem, II, multidimensional time","volume":"21","author":"Feautrier","year":"1992","journal-title":"Int. J. of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0304-3975(96)00052-7","article-title":"Unification of infinite sets of terms schematized by primal grammars","volume":"176","author":"Hermann","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF03356760","article-title":"Transitive closure of infinite graphs and its applications","volume":"24","author":"Kelly","year":"1996","journal-title":"Int. J. of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB11","series-title":"Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications","first-page":"399","article-title":"The generic graph component library","author":"Lee","year":"1999"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB12","series-title":"\u201cAutomatic Algorithm Recognition: A New Approach to Program Optimization,\u201d","author":"Metzger","year":"2000"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1080\/01495730008947357","article-title":"Detection of scans in the polytope model","volume":"15","author":"Redon","year":"2000","journal-title":"Parallel Algorithms and Applications"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB14","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(93)90326-O","article-title":"Computability of recurrence equations","volume":"116","author":"Saouter","year":"1993","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB15","article-title":"Geometric model checking: An automatic verification technique for loop and data reuse transformations","volume":"65","author":"Shashidhar","year":"2002"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB16","series-title":"ISCOPE","first-page":"59","article-title":"The matrix template library: A generic programming approach to high performance numerical linear algebra","author":"Siek","year":"1998"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB17","series-title":"Parallel Computing","article-title":"Derivation of systolic algorithm path problem by recurrence transformations","author":"TayouDjameni","year":"2000"},{"key":"10.1016\/S1571-0661(05)82599-X_BIB18","first-page":"170","article-title":"Using Attributed Flow Graph Parsing to Recognize Clich\u00e9s in Programs","volume":"1073","author":"Wills","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582599X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582599X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T05:57:47Z","timestamp":1548482267000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610582599X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S157106610582599X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82599-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}