Publications

Export 655 results:
Author Title Type [ Year(Asc)]
2002
Ferenc R, Gustafsson J, Müller L, Paakki J.  2002.  Recognizing Design Patterns in C++ programs with the integration of Columbus and Maisa. Acta Cybernetica. 15:669-682.
Alexin Z.  2002.  Rule-based Learning Methods and their Applications to Natural Language Processing.
Szilágyi G., Gyimóthy T, Małuszyński J.  2002.  Static and Dynamic Slicing of Constraint Logic Programs. Automated Software Engg.. 9:41–65.
Kiss Á, Jász Judit, Lehotai G.  2002.  Static Slicing of Binary Executables. Volume of Extended Abstracts of the 3rd Conference of PhD Students in Computer Science (CSCS 2002). :60.
Beszédes Á, Faragó C., Szabó Z.M, Csirik J, Gyimóthy T.  2002.  Union Slices for Program Maintenance. Proceedings of the IEEE International Conference on Software Maintenance (ICSM 2002). :12-21.
Havasi F, Kálmán M.  2002.  XML Semantics. Conference of PhD Students in Computer Science. :43.
Havasi F.  2002.  XML Semantics Extension. Acta Cybernetica. 15:509-528.
2001
Ferenc R, Magyar F, Beszédes Á, Kiss Á, Tarkiainen M.  2001.  Columbus – Tool for Reverse Engineering Large Object Oriented Software Systems. Proceedings of the Seventh Symposium on Programming Languages and Software Tools (SPLST 2001). :16-27.
Szilágyi G., Harmath L, Gyimóthy T.  2001.  The debug slicing of logic programs. Acta Cybernetica. 15:257–278.
Beszédes Á, Gergely Tamás, Szabó Z.M, Csirik J, Gyimóthy T.  2001.  Dynamic Slicing Method for Maintenance of Large C Programs. Proceedings of the Fifth European Conference on Software Maintenance and Reengineering (CSMR 2001). :105-113.
Faragó C., Gergely Tamás.  2001.  Handling the Unstructured Statements in the Forward Dynamic Slice Algorithm. Proceedings of Seventh Symposium on Programming Languages and Software Tools. :71-83.
Blázsik Z, Holló C., Imreh C., Kovács Z.  2001.  Heuristics for the PNS problem. Optimization theory: Recent development from Mátraháza. :1-18.
Ferenc R, Gustafsson J, Müller L, Paakki J.  2001.  Recognizing Design Patterns in C++ programs with the integration of Columbus and Maisa. Proceedings of the 7th Symposium on Programming Languages and Software Tools (SPLST 2001). :58-70.
Alexin Z, Leipold P, Csirik J, Bibok K, Gyimóthy T.  2001.  A Rule-Based Tagger Development Framework. :1-10.
Ferenc R, Beszédes Á, Magyar F, Gyimóthy T.  2001.  A short introduction to Columbus/CAN.
Ferenc R, Sim SE, Holt RC, Koschke R, Gyimóthy T.  2001.  Towards a Standard Schema for C/C++. Proceedings of the 8th Working Conference on Reverse Engineering (WCRE 2001). :49-58.
Zvada S., Gyimóthy T.  2001.  Using decision trees to infer semantic functions of attribute grammars. Acta Cybern.. 15:279–304.
Havasi F.  2001.  XML Semantics Extensions. Proceedings of Seventh Symposium on Programming Languages and Software Tools. :198-211.
2000
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On bottleneck and k-sum versions of the Process Network Synthesis problems. Novi Sad Journal of Mathematics. 30:11-19.
Ferenc R, Magyar F, Beszédes Á, Márton G, Tarkiainen M, Gyimóthy T.  2000.  Columbus 2.0 - Tool for Reverse Engineering Large Object Oriented Software Systems.
Kocsor A, Tóth L, Kuba A, Kovács K, Jelasity M, Gyimóthy T, Csirik J.  2000.  A Comparative Study of Several Feature Transformation and Learning Methods for Phoneme Classification. International Journal of Speech Technology. 3:263-276.
Szilágyi G., Harmath L, Gyimóthy T.  2000.  Debug Slicing of Logic Programs. Conference of PhD Students on Computer Sciences. :43-44.
Schrettner L.  2000.  Distributed and parallel systems. :127–136.
Beszédes Á, Szabó Z.M, Faragó C., Gyimóthy T.  2000.  Forward Computation of Dynamic Slices of C Programs.
Holló C..  2000.  A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems. Pure Mathematics and Applications. 11:265-279.