@article {BSC14,
	title = {Empirical Investigation of {SEA}-Based Dependence Cluster Properties},
	journal = {Science of Computer Programming},
	volume = {105},
	year = {2015},
	note = {Special Issue on SCAM{\textquoteright}13},
	pages = {3 - 25},
	publisher = {Elsevier B.V.},
	keywords = {select:quality},
	doi = {http://dx.doi.org/10.1016/j.scico.2014.09.010},
	author = {{\'A}rp{\'a}d Besz{\'e}des and Schrettner, Lajos and Csaba, B{\'e}la and Tam{\'a}s Gergely and Judit J{\'a}sz and Tibor Gyim{\'o}thy}
}
@conference {16361,
	title = {Empirical investigation of SEA-Based dependence cluster properties},
	booktitle = {IEEE 13th International Working Conference on Source Code Analysis and Manipulation, SCAM 2013},
	year = {2013},
	pages = {1{\textendash}10},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	address = {Piscataway},
	abstract = {Dependence clusters are (maximal) groups of source code entities that each depend on the other according to some dependence relation. Such clusters are generally seen as detrimental to many software engineering activities, but their formation and overall structure are not well understood yet. In a set of subject programs from moderate to large sizes, we observed frequent occurrence of dependence clusters using Static Execute After ({SEA}) dependences ({SEA} is a conservative yet efficiently computable dependence relation on program procedures). We identified potential linchpins inside the clusters; these are procedures that can primarily be made responsible for keeping the cluster together. Furthermore, we found that as the size of the system increases, it is more likely that multiple procedures are jointly responsible as sets of linchpins. We also give a heuristic method based on structural metrics for locating possible linchpins as their exact identification is unfeasible in practice, and presently there are no better ways than the brute-force method. We defined novel metrics and comparison methods to be able to demonstrate clusters of different sizes in programs. {\textcopyright} 2013 {IEEE}.},
	keywords = {select:quality},
	author = {{\'A}rp{\'a}d Besz{\'e}des and Schrettner, L. and B. Csaba and Tam{\'a}s Gergely and Judit J{\'a}sz and Tibor Gyim{\'o}thy},
	editor = {Bram Adams and Juergen Rilling and Foutse Khomh}
}
@conference {GBG10,
	title = {Effect of Test Completeness and Redundancy Measurement on Post Release Failures {\textendash} an Industrial Experience Report},
	booktitle = {Proceedings of the 2010 IEEE International Conference on Software Maintenance (ICSM{\textquoteright}10)},
	year = {2010},
	month = {sep},
	pages = {Research Track 13},
	publisher = {IEEE Computer Society},
	organization = {IEEE Computer Society},
	author = {Tam{\'a}s Gergely and {\'A}rp{\'a}d Besz{\'e}des and Tibor Gyim{\'o}thy and Gyalai, M.I.}
}
@conference {PBG08,
	title = {Experiences in Adapting a Source Code-Based Quality Assessment Technology},
	booktitle = {Proceedings of the 12th European Conference on Software Maintenance and Reengineering (CSMR{\textquoteright}08)},
	year = {2008},
	pages = {311-313},
	author = {J. P{\'a}ntos and {\'A}rp{\'a}d Besz{\'e}des and P. Gyenizse and Tibor Gyim{\'o}thy}
}
@conference {FBG04,
	title = {{Extracting Facts with Columbus from C++ Code}},
	booktitle = {Tool Demonstrations of the 8th European Conference on Software Maintenance and Reengineering (CSMR 2004)},
	year = {2004},
	month = {mar},
	pages = {4-8},
	author = {Rudolf Ferenc and {\'A}rp{\'a}d Besz{\'e}des and Tibor Gyim{\'o}thy}
}
@article {Gyimothy:1999:ERS:318774.319248,
	title = {An efficient relevant slicing method for debugging},
	journal = {SIGSOFT Softw. Eng. Notes},
	volume = {24},
	year = {1999},
	month = {October},
	pages = {303{\textendash}321},
	publisher = {ACM},
	address = {New York, NY, USA},
	keywords = {debugging, dynamic slicing, relevant slicing, software quality selected},
	issn = {0163-5948},
	doi = {http://doi.acm.org/10.1145/318774.319248},
	url = {http://doi.acm.org/10.1145/318774.319248},
	author = {Tibor Gyim{\'o}thy and {\'A}rp{\'a}d Besz{\'e}des and I. Forg{\'a}cs}
}
@conference {GBF99,
	title = {An Efficient Relevant Slicing Method for Debugging},
	booktitle = {Proceedings of the Joint 7th European Software Engineering Conference and 7th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (ESEC/FSE{\textquoteright}99)},
	series = {Lecture Notes in Computer Science},
	number = {1687},
	year = {1999},
	month = {sep},
	pages = {303-321},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	keywords = {relate:quality},
	author = {Tibor Gyim{\'o}thy and {\'A}rp{\'a}d Besz{\'e}des and I. Forg{\'a}cs}
}
@booklet {GyBF99,
	title = {An Efficient Relevant Slicing Method for Debugging},
	year = {1999},
	publisher = {Research Group on Artificial Intelligence, Hungarian Academy of Sciences and J{\'o}zsef Attila University},
	author = {Tibor Gyim{\'o}thy and {\'A}rp{\'a}d Besz{\'e}des and I. Forg{\'a}cs}
}
@booklet {Beszedes_anevaluation,
	title = {An Evaluation of Reverse Engineering Capabilities of the {TDE/Columbus} system},
	year = {1999},
	author = {{\'A}rp{\'a}d Besz{\'e}des and Rudolf Ferenc and Tibor Gyim{\'o}thy and F. Magyar and G. M{\'a}rton and M. Tarkianen}
}
