Automated hypertext support for software maintenance

Computer Journal

Volumn 39, Issue 7, 1996, Pages

  Paakki, Jukka ^a   Salminen, Airi ^b   Koskinen, Jussi ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001188871     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/39.7.577     Document Type: Article

References (52)

1. Jambor-Sadeghi, K., Ketabchi, M. A., Chue, J. and Ghiassi, M. (1994) A systematic approach to corrective maintenance. Comput. J., 37, 764-778.
2. Wilde, N., Chapman, A. and Richardson, R. (1994) The extensible dependency analysis tool set: a knowledge base for understanding industrial software. Int. J. Software Engng Knowl. Engng, 4, 521-534.
3. Harrold, M. and Soffa, M. (1990) Computation of interprocedural definition and use dependencies. In Proc. IEEE Comput. Soc. 1990 Int. Conf. on Computer Languages, New Orleans, LA, pp. 297-306.
4. Ryder, B. (1979) Constructing the call graph of a program. IEEE Trans. Software Engineering, 5, 216-225.
5. Murphy, G., Notkin, D. and Lan, E. (1996) An empirical study of static call graph extractors. In: Proc. 18th Int. Conf. on Software Engineering, Berlin, Germany. IEEE Computer Soc. Press, pp. 90-99.
6. Horwitz, S., Reps, T. and Binkley, D. (1990) Interprocedural slicing using dependence graphs. ACM Trans. Progr. Langs Syst., 12, 26-60.
7. Horwitz, S. and Reps, T. (1992) The use of program dependence graphs in software engineering. In Proc. 14th Int. Conf. on Software Engineering, Melbourne, Australia. IEEE Computer Soc. Press, pp. 392-410.
8. Kamkar, M. (1993) Interprocedural Dynamic Slicing with Applications to Debugging and Testing. Ph.D. thesis, Linköping Studies in Science and Technology Dissertations No. 297, Department of Computer and Information Science, Linköping University, Sweden.
9. [91 Tip, F. (1995) A survey of program slicing techniques. J. Program. Lang., 3, 121-189.
10. Koskinen, J., Paakki, J. and Salminen, A. (1994) Program text as hypertext: using program dependences for transient linking. In Proc. 6th Int. Conf. on Software Engineering and Knowledge Engineering (SEKE'94), Jurmala, Latvia. Knowledge Systems Institute, pp. 209-216.
11. Salminen, A., Koskinen, J. and Paakki, J. (1994) HyperSoft: an environment for hypertextual software maintenance. In Proc. Nordic Workshop on Programming Environment Research (NWPER'94), Lund, Sweden. Report LU-CS-TR: 94-127, Department of Computer Science, Lund University, pp. 25-37.
12. Pressman, R. S. (1992) Software Engineering - A Practitioner's Approach, 3rd ed. McGraw-Hill, New York.
13. Garg, P. K. and Scacchi, W. (1990) A hypertext system to manage software lifecycle documents. IEEE Software, May, 90-98.
14. Cybulski, J. L. and Reed, K. (1992) A hypertext-based software-engineering environment. IEEE Software, March, 62-68.
15. Letovsky, S. and Soloway, E. (1986) Delocalized plans and program comprehension. IEEE Software, May, 41-49.
16. Brade, K., Guzdial, M., Steckel, M. and Soloway, E. (1994) Whorf: a hypertext tool for software maintenance. Int. J. Software Engng Knowl. Engng, 4, 1-16.
17. Bigelow, J. (1988) Hypertext and CASE. IEEE Software, March, 23-27.
18. Cleveland, L. (1989) A program understanding support environment. IBM Systems J., 28, 324-344.
19. Linos, P., Aubet, P., Dumas, L., Helleboid, Y., Lejeune, P. and Tulula, P. (1993) CARE: an environment for understanding and re-engineering C programs. In Proc. Conf. on Software Maintenance, Montreal, Canada. IEEE Computer Society Press, pp. 130-139.
20. Goldberg, A. (1984) Smalltalk-80: The Interactive Programming Environment. Addison-Wesley, Reading, MA.
21. SunPro (1992) SparcWorks (v. 2.0) Browsing Source Code. SunPro, Sun Microsystems, Inc. Business, Mountain View, CA.
22. Lakhotia, A. (1993) Understanding someone else's code: analysis of experiences. J. Systems Software, 23, 269-275.
23. Halasz, F. and Schwartz, M. (1994) The Dexter hypertext reference model. Commun. ACM, 37, 29-39.
24. Salminen, A. and Watters, C. (1992) A two-level structure for textual databases to support hypertext access. J. Am. Soc. Info. Sci., 43, 432-447.
25. Akscyn, R. M., McCracken, D. L. and Yoder, E. A. (1988) KMS: a distributed hypermedia system for managing knowledge in organizations. Commun. ACM, 31, 820-835.
26. Rivlin, E., Botafogo, R. and Shneiderman, B. (1994) Navigating in hyperspace: designing a structure-based toolbox. Commun. ACM, 37, 87-96.
27. Conklin, J. (1987) Hypertext: an introduction and survey. Computer (IEEE), 20, 17-41.
28. Shneiderman, B., Shafer, P., Roland, S. and Weldon, L. (1986) Display strategies for program browsing - concepts and experiment. IEEE Software, May, 7-15.
29. Goldfarb, C. F. (1990) In Rubinsky, Y. (ed.), The SGML Handbook. Oxford University Press, Oxford.
30. Aho, A. V. and Ullman, J. D. (1972) The Theory of Parsing, Translation and Compiling. Prentice Hall, Englewood Cliffs, NJ.
31. Salminen, A., Tague-Sutcliffe, J. and McClellan, C. (1995) From text to hypertext by indexing. ACM Trans. Infor. Syst., 13, 69-99.
32. Watters, C. and Shepherd, M. A. (1990) A transient hypergraph-based model for data access. ACM Trans. Infor. Syst., 8, 77-102.
33. Aho, A. V., Sethi, R. and Ullman, J. D. (1986) Compilers -Principles, Techniques and Tools. Addison-Wesley, Reading, MA.
34. Paakki, J., Koskinen, J. and Salminen, A. (1996) From relational program dependencies to hypertextual access structures. Nordic J. Comput., submitted.
35. Rumbaugh, J., Blaha, M., Premerlani, W., Eddy, F. and Lorensen, W. (1991) Object-Oriented Modeling and Design. Prentice Hall, Englewood Cliffs, NJ.
36. Baker, B. S. (1993) A theory of parameterized pattern matching: algorithms and applications. In Proc. 25th ACM Symp. on Theory of Computing, San Diego, CA. ACM Press, pp. 71-80.
37. Yang, W. (1991) Identifying syntactic differences between two programs. Software Pract. Exper., 21, 739-755.
38. Kilpeläinen, P. and Mannila, H. (1994) Query primitives for tree-structured data. In Proc. 5th Annual Symp. on Combinatorial Pattern Matching (CPM'94), Asilomar, CA. LNCS 807, Springer-Verlag, pp. 213-225.
39. Rich, C. and Wills, L. M. (1990) Recognizing a program's design: a graph-parsing approach. IEEE Software, January, 82-89.
40. McCabe, T. J. (1976) A complexity measure. IEEE Trans. Software Engng, 2, 308-320.
41. Gibbs, S., Tsichritzis, D., Casais, E., Nierstrasz, O. and Pintado, X. (1990) Class management for software communities. Commun. ACM, 33, 90-103.
42. Taenzer, D., Ganti, M. and Podar, S. (1989) Object-oriented software reuse: the yoyo problem. J. Object-Oriented Program., 2, 30-35.
43. Moriconi, M. and Hare, D. F. (1986) The PegaSys system: pictures as formal documentation of large programs. ACM Trans. Program. Lang. Syst., 8, 524-546.
44. Kernighan, B. and Ritchie, D. (1988) The C Programming Language, 2nd ed. Prentice Hall, Englewood Cliffs, NJ.
45. Weiser, M. (1984) Program slicing. IEEE Trans. Software Engng, 10, 352-357.
46. Bergeretti, J. -F. and Carre, B. (1985) Information-flow and data-flow analysis of while-programs. ACM Trans. Program. Lang. Systems, 7, 37-61.
47. Koskinen, J. (1996) Creating transient hypertextual access structures for C programs. In Proc. 7th Israeli Conf. on Computer Systems and Software Engineering, Herzliya, Israel. IEEE Computer Society Press, pp. 56-65.
48. Parsifal Software (1993) AnaGramTM - User's, Guide Parsifal Software, Wayland, MA.
49. Katajainen, J. and Mäkinen, E. (1990) Tree compression and optimization with applications. Int. J. Foundations Comput. Sci., 1, 425-447.
50. Samadzadeh, M. and Wichaipanitch, W. (1993) An interactive debugging tool for C based on dynamic slicing and dicing. In Proc. 21st Annual Computer Science Conf., Indianapolis, IN. ACM Press, pp. 30-37.
51. Hoffner, T, Kamkar, M. and Fritzson, P. (1995) Evaluation of program slicing tools. In Proc. 2nd Int. Workshop on Automated and Algorithmic Debugging (AADEBUG'95), St Malo, France IRISA-CNRS.
52. Binkley, D. W. and Gallagher, K. B. (1996) Program slicing. In Adv. Comput., 43, 1-50.