{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:51:33Z","timestamp":1649026293196},"reference-count":37,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1990]]},"DOI":"10.1051\/ita\/1990240201311","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:02:52Z","timestamp":1486029772000},"page":"131-159","source":"Crossref","is-referenced-by-count":1,"title":["Parall\u00e9lisation s\u00e9mantique"],"prefix":"10.1051","volume":"24","author":[{"given":"P.","family":"Jouvelot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Feautrier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. AHO A., SETHI R. et ULLMAN J. D., Compilers, Addison-Wesley, 1986."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. ALLEN J. R. et KENNEDY K., Automatic Loop Interchange, A.C.M. SIGPLAN Notices, vol. 19, juin 1984, p. 233-246.","DOI":"10.1145\/502949.502897"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. BERNSTEIN A. J., Analysis of Programs for Parallel Processing, I.E.E.E. Trans, on Elec. Comp., vol. 15, octobre 1966, p. 757-763.0147.15002","DOI":"10.1109\/PGEC.1966.264565"},{"key":"R4","unstructured":"4. CARDELLI L., Basic Polymorphic Typechecking, Polymorphism Newsletter 1, vol. II, Bell Labs, janvier 1985."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. CLARK K. et GREGORY S., PARLOG: Parallel Programming in Logic, A.C.M. Trans. on Prog. Lang. and Systems, vol. 8, janvier 1986, p. 1-49.0592.68016","DOI":"10.1145\/5001.5390"},{"key":"R6","unstructured":"6. COOPER D. C., Theorem Proving in Arithmetic without Multiplication, Machine Intelligence 7, 1972, p. 91-99.0258.68046"},{"key":"R7","unstructured":"7. COUSINEAU G., The ML Handbook, draft I.N.R.I.A., mai 1985."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. COUSOT P. et COUSOT R., Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximations of Fixpoints, Proc. of the A.C.M. Conf. on Principles of Prog. Lang., janvier 1977, p. 238-252.","DOI":"10.1145\/512950.512973"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. COUSOT P. et HALBWACHS N., Automatic Discovery of Linear Restraints among Variables of a Program, Proc. of A.C.M. Conf. on Principles of Prog. Lang., janvier 1978, p. 84-96.","DOI":"10.1145\/512760.512770"},{"key":"R10","unstructured":"10. COUSOT P., M\u00e9thodes It\u00e9ratives de Construction de Points Fixes d'Op\u00e9rateurs Monotones sur un Treillis: Analyse S\u00e9mantique de Programmes, Th\u00e8se d'\u00c9tat, U.S.M.G., Grenoble, 1978."},{"key":"R11","unstructured":"11. DUFFIN R. J., On Fourier's Analysis of Linear Inequality Systems, Mathematical Systems, vol. 1, North Holland, 1974.0357.90032"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. FLOYD R. W., Assigning Meanings to Programs, 19 Symp. in Applied Math., American Math. Soc., 1967.2357710189.50204","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"R13","unstructured":"13. GIFFORD D. K., JOUVELOT P., LUCASSEN J. M. et SHELDON M. A., FX-87 Reference Manual, M.I.T.\/L.C.S. Tech. Rep. 407, septembre 1987."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. GORDON M. J. C. et MILNER R., Edinburgh LCF, Lect. Note in Comp. Sci., n\u00b0 78, Springer Verlag, 1979.0421.68039","DOI":"10.1007\/3-540-09724-4"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. GORDON M. J. C., The Denotational Description of Programming Languages, Springer Verlag, 1979.0412.68004","DOI":"10.1007\/978-1-4612-6228-2"},{"key":"R16","unstructured":"16. JOHNSON J. C., YACC: Yet Another Compiler Compiler, Bells Labs, juillet 1978."},{"key":"R17","unstructured":"17. JOUVELOT P., ML : Un Langage de Maquettage, Journ\u00e9es d'\u00e9tude \u00ab Nouveaux Langages pour le G\u00e9nie Logiciel \u00bb, A.F.C.E.T., 1985."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"18. JOUVELOT P., Parallelization by Semantic Detection of Reductions, ESOP86, Lect. Note in Comp. Sci., n\u00b0 213, p. 223-236, Springer Verlag, mars 1986.0587.68021","DOI":"10.1007\/3-540-16442-1_17"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. JOUVELOT P., Designing New Languages and New Language Manipulation Systems using ML, A.C.M. SIGPLAN Notices, vol. 21, ao\u00fbt 1986, p. 40-52.","DOI":"10.1145\/382278.382393"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"20. JOUVELOT P., Semantic Parallelization: A Practical Exercise in Abstract Interpretation, Proc. of the A.C.M. Conf. on Principles of Prog. Lang., janvier 1987.","DOI":"10.1145\/41625.41629"},{"key":"R21","unstructured":"21. JOUVELOT P., Parall\u00e9lisation S\u00e9mantique : Une Approche D\u00e9notationnelle Non-Standard pour la Parall\u00e9lisation de Programmes S\u00e9quentiels, Th\u00e8se de l'Universit\u00e9 Paris-VI, Rapport M.A.S.I. 174, f\u00e9vrier 1987."},{"key":"R22","unstructured":"22. KREISEL G. et KRIVINE J. L., \u00c9l\u00e9ments de Logique Math\u00e9matique, Dunod, 1967.2075160146.00703"},{"key":"R23","unstructured":"23. KUCK D. J., The Structure of Computers and Computations, John Wiley and Sons, 1977."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"24. LI K. C., A Note on the Vector C Language, A.C.M. SIGPLAN Notices, vol. 21, janvier 1986, p. 49-57.","DOI":"10.1145\/382282.382422"},{"key":"R25","unstructured":"25. MACQUEEN D., in Standard ML, Edinburgh Univ. Int. Rep. ECS-LFCS-86-2, mars 1986."},{"key":"R26","unstructured":"26. MILLER J. S., MultiScheme, M.I.T. Ph. D. thesis, juin 1987."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"27. NIELSON F., Program Transformations in a Denotational Setting, A.C.M. Trans. on Prog. Lang. and Systems, vol. 7, juillet 1985, p. 359-379.0566.68013","DOI":"10.1145\/3916.3917"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"28. OPPEN D. C., A 222pn Upper Bound on the Complexity of Presburger Arithmetics, J.C.S.S., vol. 16, 1978, p. 323-332.4787500381.03021","DOI":"10.1016\/0022-0000(78)90021-1"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"29. PERROTT R. H., A Language for Array and Vector Processors, A.C.M. Trans. on Prog. Lang. and Systems, vol. 1, octobre 1979, p. 177-195.0449.68004","DOI":"10.1145\/357073.357075"},{"key":"R30","doi-asserted-by":"crossref","unstructured":"30. SCHWARTZ J. T., Ultracomputers, A.C.M. Trans. on Prog. Lang. and Systems, vol. 2, octobre 1980, p. 484-521.0468.68027","DOI":"10.1145\/357114.357116"},{"key":"R31","doi-asserted-by":"crossref","unstructured":"31. SCOTT D., The Lattice of Flow Diagrams, Symp. on Semantics of Algorithmic Lang., Springer Verlag, 1972, p. 311-366.2788490228.68016","DOI":"10.1007\/BFb0059703"},{"key":"R32","unstructured":"32. STOY J. E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, M.I.T. Press, 1977.4889690503.68059"},{"key":"R33","doi-asserted-by":"crossref","unstructured":"33. SUZUKI N. et JEFFERSON D., Verification Decidability of Presburger Array Programs, Proc. of the Conf. on Theo. Comp. Sci., Waterloo, 1977, p. 202-212.4951440411.68017","DOI":"10.21236\/ADA043451"},{"key":"R34","unstructured":"34. TAWBI N., DUMAY A. et FEAUTRIER P., PAF : Un Parall\u00e9liseur Automatique pour FORTRAN, Rapport M.A.S.I. 185, 1987."},{"key":"R35","unstructured":"35. TEST J. A., Multiprocessor Management in the Concentrix Operating System, USENIX Conf., 1986."},{"key":"R36","unstructured":"36. Thinking Machines Corp., The Essential* Lisp Manual, T.M.C. Tech. Rep. 86.15, avril 1986."},{"key":"R37","unstructured":"37. TRIOLET R., Contribution \u00e0 la parall\u00e9lisation automatique de programmes FORTRAN comportant des appels de proc\u00e9dures, Th\u00e8se de Docteur-Ing\u00e9nieur, Universit\u00e9 Paris-VI, d\u00e9cembre 1984."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240201311\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:58:02Z","timestamp":1568771882000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1990240201311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"references-count":37,"journal-issue":{"issue":"2"},"alternative-id":["ita1990240201311"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1990240201311","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}