Gergely Tamás, Havasi F, Gyimóthy T.
2005. Binary code compression based on decision trees. Proceedings of the Estonian Academy of Sciences Engineering. 11:269-285.
Page last modified: January 16, 2012
Kiss Á, Jász Judit, Gyimóthy T.
2005. Using Dynamic Information in the Interprocedural Static Slicing of Binary Executables. Software Quality Journal. 13:227–245.
Page last modified: January 16, 2012
Szegedi A, Gyimóthy T.
2005. Dynamic Slicing of Java Bytecode Programs. Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation. :35–44.
Page last modified: January 16, 2012
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.
2005. Minimal Slicing and the Relationships between Forms of Slicing. Proceedings of the 5th {IEEE} International Workshop on Source Code Analysis and Manipulation ({SCAM} 2005). :45–54.
Page last modified: September 26, 2019
Csendes D, Csirik J, Gyimóthy T, Kocsor A.
2005. The Szeged Treebank. TSD. :123-131.
Page last modified: January 16, 2012
Kiss Á.
2005. Formalizing Slicing – Results, Current Work and Challenges. Beyond Program Slicing – Abstracts Collection. 05451:10–11.
Page last modified: January 16, 2012
Rajlich V, Gyimóthy T.
2006. {IEEE} International Conference on Software Maintenance (ICSM2005). Journal of Software Maintenance and Evolution: Research and Practice. 18:59–60.
Page last modified: January 16, 2012
Horváth E, Forgács I, Kiss Á, Jász Judit, Gyimóthy T.
2005. General Flow-Sensitive Pointer Analysis and Call Graph Construction. Proceedings of the Estonian Academy of Sciences – Engineering. 11:286–295.
Page last modified: January 16, 2012
Bilicki V.
2006. Testing and Verifying an {IPv6} Based Multicast Network. ICCGI '06: Proceedings of the International Multi-Conference on Computing in the Global Information Technology. :3.
Page last modified: January 16, 2012
Bilicki V.
2006. Network topology discovery. Volume of Extended Abstracts of the 5th Conference of PhD Students in Computer Science. :27.
Page last modified: January 16, 2012
