article · Data Archiving and Networked Services (DANS) · 2005
Partitioning a Call Graph
Rob H. Bisseling, Jarosław Byrka, Selin Cerav-Erbas, Nebojša Gvozdenović, Mathias Lorenz, Rudi Pendavingh, Colin R. Reeves, Matthias Röger, A. Verhoeven
Cited by 17Open access
Abstract
In recent years, the capabilities of information technology have increased tremendously. At the same time, large software systems in today’s organizations
Cite this paper
Bisseling, R. H., Byrka, J., Cerav-Erbas, S., Gvozdenović, N., Lorenz, M., Pendavingh, R., Reeves, C. R., Röger, M., & Verhoeven, A. (2005). Partitioning a Call Graph. Data Archiving and Networked Services (DANS), 33(2), 209–14.
Bisseling, Rob H., et al. “Partitioning a Call Graph.” Data Archiving and Networked Services (DANS), vol. 33, no. 2, 2005, pp. 209–14.
Bisseling, Rob H., Jarosław Byrka, Selin Cerav-Erbas, Nebojša Gvozdenović, Mathias Lorenz, Rudi Pendavingh, Colin R. Reeves, Matthias Röger, and A. Verhoeven. 2005. “Partitioning a Call Graph.” Data Archiving and Networked Services (DANS) 33 (2): 209–14.
Bisseling, R.H. et al. (2005) ‘Partitioning a Call Graph’, Data Archiving and Networked Services (DANS), 33(2), pp. 209–14.
@article{bisseling2005partitioning,
title = {{Partitioning a Call Graph}},
author = {Bisseling, Rob H. and Byrka, Jarosław and Cerav-Erbas, Selin and Gvozdenović, Nebojša and Lorenz, Mathias and Pendavingh, Rudi and Reeves, Colin R. and Röger, Matthias and Verhoeven, A.},
journal = {Data Archiving and Networked Services (DANS)},
volume = {33},
number = {2},
pages = {209--14},
year = {2005}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.