Structure and interpretation of computer programs

Proceedings - 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2008

Volumn , Issue , 2008, Pages 73-80

  Narayan, Ganesh ^a   Gopinath, K ^a   Sridhar, V ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b Satyam Computers

Author keywords

[No Author keywords available]

Indexed keywords

CALL GRAPHS; INTERNATIONAL SYMPOSIUM;

COMPUTER NETWORKS; COMPUTER SOFTWARE SELECTION AND EVALUATION; LINGUISTICS; PROGRAM INTERPRETERS; QUERY LANGUAGES; SOFTWARE ENGINEERING;

CONCURRENCY CONTROL;

EID: 51749124195     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TASE.2008.40     Document Type: Conference Paper

References (28)

1. A. Abdo and A. de Moura. Clustering as a measure of the local topology of networks. In arXiv:physics/0605235, 2006.
2. S. Asur, S. Parthasarathy, and D. Ucar. An ensemble approach for clustering scalefree graphs. In LinkKDD workshop, 2006.
3. H. Barcelo, X. Kramer, R. Laubenbacher, and C. Weaver. Foundations of a connectivity theory for simplicial complexes. In Advances in Applied Mathematics, 2006.
4. G. Baxter and et al. Understanding the shape of java software. In OOPSLA, 2006.
5. M. Boguna, R. Pastor-Satorras, and A. Vespignani. Absence of epidemic threshold in scale-free networks with connectivity correlations. In arXiv:cond-mat/0208163, 2002.
6. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
7. J. A. Brretzen and R. Conradi. Results and experiences from an empirical study of fault reports in industrial projects. In PROFES, 2006.
8. A. Clauset and et al. Power-law distributions in empirical data. In arXiv.org:physics/0706.1062, 2007.
9. L. da F. Costa, F. A. Rodrigues, G. Travieso, and P. R. V. Boas. Characterization of complex networks: A survey of measurements. Advances In Physics, 56:167, 2007.
10. F. S. Diego Puppin. The social network of Java classes. In ACM Symposium on Applied Computing, 2006.
11. P. Erdös and A. Rnyi. On random graphs. In Publicationes Mathematicae 6, 1959.
12. D. Garlaschelli and M. I. Loffredo. Patterns of link reciprocity in directed networks. Physical Review Letters, 2004.
13. D. Hrimiuc. The rearrangement inequality - a tutorial: pims.math.ca/pi/issue2/page21-23.pdf, 2007.
14. http://agni.csa.iisc.ernet.in/nganesh/papers/sicp draft.pdf.
15. http://projects.forked.de/graph tool/.
16. P. Krapivsky and S. Redner. Network growth by copying. Phys Rev E Stat Nonlin Soft Matter Phys, 2005.
17. L. Li, D. Alderson, R. Tanaka, J. Doyle, and W. Willinger. Towards a theory of scale-free graphs. In arXiv.condmat/0501169, 2005.
18. Y. Matsuo. Clustering using small world structure. In Knowledge-Based Intelligent Information and Engineering Systems, 2002.
19. C. R. Myers. Software systems as complex networks. In Physical Review, E68, 2003.
20. M. Newman. The structure and function of complex networks. In SIAM Review, 2003.
21. M. E. J. Newman. Assortative mixing in networks. Physical Review Letters, 89:208701, 2002.
22. D. E. Perry and W M. Evangelist. An empirical study of software interface faults. In Symposium on New Directions in Computing, 1985.
23. A. Potanin, J. Noble, M. Frean, and R. Biddle. Scale-free geometry in oo programs. Comm. ACM, May 2005.
24. S. Valverde and R. V. Sole. Logarithmic growth dynamics in software networks. In arXiv:physics/0511064, Nov. 2005.
25. S. Valverde and R. V. Sole. Hierarchical small worlds in software architecture. In arXiv:cond-mat/0307278, 2006.
26. Y. Wang, D. Chakrabarti, C. Wang, and C. Faloutsos. Epidemic spreading in real networks: An eigenvalue viewpoint. In Symposium on Reliable Distributed Computing, 2003.
27. A. Y. Wu, M. Garland, and J. Han. Mining scale-free networks using geodesic clustering. In ACM SIGKDD, 2004.
28. www.csn.ul.ie/mel/projects/codeviz/.