×
Remy, Jean-Luc

Construction, evaluation et amelioration systematiques de structures de données. (French) Zbl 0434.68050

RAIRO, Inf. Théor. 14, 83-118 (1980).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0434.68050

Cited in 1 Document

MSC:

68R99 Discrete mathematics in relation to computer science
68Q25 Analysis of algorithms and problem complexity
68P05 Data structures

Keywords:

abstract data types; dictionaries; binary search trees; insertion algorithm; specifications of data structures; analysis of algorithms

Software:

Lucid
Cite Review PDF
Full Text: EuDML

References:

[1] 1. G. M. ADEL’SON-VEL’SKII et Y. M. LANDIS, An Algorithm for the Organization of Information; Soviet Math. Dokl., vol. 3, 1962, p. 1259-1262.
[2] 2. A. V. AHO, J. E. HOPCROFT et J. D. ULLMAN, The Design and Analysis of Algorithms, Addison-Wesley, Reading, Mass., 1974. · Zbl 0326.68005
[3] 3. J. ARSAC, La construction de programmes structurés, Dunod, Paris. 1977. Zbl0451.68014 · Zbl 0451.68014
[4] 4. E. A. ASHCROFT et W. W. WADGE, Lucid, a Nonprocedural Language with Iteration, Comm. A. C. M., vol. 20, n^\circ 7, 1977, p. 519-526. Zbl0358.68033 MR474941 · Zbl 0358.68033 · doi:10.1145/359636.359715
[5] 5. F. L. BAUER et H. WOSSNER, Algorithmic Language and Program Development, Prentice Hall International, London, 1979.
[6] 6. F. BELLEGARDE et al., MEDEE, A Type of Language for the Deductive Programming Method, Conference on Reliable Software, German A. C. M. Chapter, Bonn, 1978. Zbl0408.68014 · Zbl 0408.68014
[7] 7. R. M. BURSTALL et J. DARLINGTON, A Transformation System for Developing Recursive Programs, J. A.C.M., vol. 24, 1977, p. 44-67. Zbl0343.68014 MR451816 · Zbl 0343.68014 · doi:10.1145/321992.321996
[8] 8. R. M. BURSTALL et J. A. GOGUEN, Putting Theories Together to Make Specifications, Proc. of I.F.I.P. Conference, 1977, p. 1045-1058.
[9] 9. J. DARLINGTON, Program Transformation and Synthesis: Present Capabilities, D.A.I. Research Report n^\circ 48, University of Edinburgh, 1977.
[10] 10. J. DARLINGTON, Program Transformation Involving Unfree Data Structures: an Example, 3e Coll. Int. sur la programmation, Dunod, Paris, 1978, p. 203-217. Zbl0405.68017 MR518771 · Zbl 0405.68017
[11] 11. M. FEATHER, < ZAP > Program Transformation System, Primer and Users’ Manual, D.A.I. Research Report n^\circ 54, University of Edinburgh, 1978.
[12] 12. J. P. FINANCE, Une formulation de la Sémantique des langages de programmation, R.A.I.R.O., vol. 10, Paris, 1976, p. 8-12. MR423858 · Zbl 0356.68025
[13] 13. J. P. FINANCE, De la spécification abstraite d’une donnée à sa représentation en mémoire, Théorie et techniques de l’Informatique, actes de Congrès de l’A.F.C.E.T., t. 1, 1978, Hommes et Techniques, Paris.
[14] 14. M. C. GAUDEL, A Formal Approach to Translation Specification, Information Processing 1977, B. GILCHRIST, éd., North Holland, Amsterdam, 1977 , p. 123-129. Zbl0363.68002 · Zbl 0363.68002
[15] 15. M. C. GAUDEL et G. TERRINE, Synthèse de la représentation d’un type abstrait par des types concrets, Théorie et Techniques de l’Informatique, actes du Congrès de l’A.F.C.E.T., t. 1, 1978, Hommes et Techniques, Paris.
[16] 16. J. A. GOGUEN, J. W. HATCHER, E. G. WAGNER et J. B. WRIGHT, Abstract Data Types as Initial Algebras and the Correctness of Data Representations, Proc. Conf. on Computer Graphics, Pattern Recognition and Data Structure, mai 1975.
[17] 17. J. V. GUTTAG, E. HOROWITZ et D. R. MUSSER, The Design of Data Type Specifications, in Current Trends in Programming Methodology, IV, Data Structuring, R. T. YEH, éd., Prentice-Hall, Engl. Cliffs, New Jersey, 1978. · Zbl 0387.68012
[18] 18. C. B. JONES, Constructing a Theory of a Data Structure as an Aid to Program Development, Acta Informatica, vol. 11, 1979, p. 119-128. Zbl0382.68029 · Zbl 0382.68029 · doi:10.1007/BF00264020
[19] 19. D. E. KNUTH, The Art of Computer Programming, 3. Sorting and Searching, Addison-Wesley, Reading, Mass., 1973. Zbl0302.68010 MR378456 · Zbl 0302.68010
[20] 20. P. LESCANNE, Un calcul relationnel pour les structures de données, Rapport 76-R-029, Centre de Recherche en Informatique de Nancy, Nancy, 1976.
[21] 21. P. LESCANNE, Étude algébrique et relationnelle des représentations de types abstraits, thèse d’état, Nancy, 1979.
[22] 22. B. LISKOV et S. ZILLES, Programming with Abstract Data Types, SIGPLAN, Notices, vol. 9, n^\circ 4, 1974.
[23] 23. Z. MANNA et R. WALDINGER, Knowledge and Reasoning in Program Synthesis, Artif. Intel. J., vol. 6, 1975, p. 175-208. Zbl0303.68012 MR378457 · Zbl 0303.68012 · doi:10.1016/0004-3702(75)90008-9
[24] 24. C. PAIR, La construction des programmes, Rapport 77-R-019, Centre de Recherche en Informatique de Nancy, Nancy, 1977.
[25] 25. C. PAIR et M. C. GAUDEL, Les structures d’information et leurs représentations, I.R.I.A., Rocquencourt, 1978.
[26] 26. A. QUERE, Construction de Programmes Itératifs dans le cadre du langage MEDEE, Convention Informatique Latine, Barcelone, 1979.
[27] 27. J. L. RÉMY, Structures d’Information, formalisation des notions d’accès et de modifications d’une donnée, Thèse 3e Cycle, Université de Nancy I, 1974.
[28] 28. W. P. DE ROEVER, Operational, Mathematical and Axiomatized Semantics for Recursive Procedures and Data Structures, Rapport ID 1/74, Math. Centrum, Amsterdam, 1974.
[29] 29. M. SINTZOFF, Inventing Program Construction Rules, Rapport 77-R-011, Centre de Recherche en Informatique de Nancy, Nancy, 1977; in Constructing Quality Software, P. G. HIBBARD et S. A. SCHUMAN, éd., North-Holland, 1978.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.