Publications

Export 282 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Last Name is B  [Clear All Filters]
2003
Balanyi Z., Ferenc R.  2003.  Mining Design Patterns from C++ Source Code. Proceedings of the 19th International Conference on Software Maintenance (ICSM 2003). :305-314.
Vidács L, Beszédes Á.  2003.  Opening Up The C/C++ Preprocessor Black Box. Proceedings of the Eight Symposium on Programming Languages and Software Tools (SPLST'03). :45-57.
Beszédes Á, Gergely Tamás, Gyimóthy T, Lóki G, Vidács L.  2003.  Optimizing for Space : Measurements and Possibilities for Improvement. Proceedings of the 2003 GCC Developers' Summit. :7-20.
Fidrich M, Bilicki V, Sógor Z, Sey G.  2003.  SIP compression. Periodica Polytechnica-Electrical Engineering. 47:1-2.
Beszédes Á, Ferenc R, Gyimóthy T, Dolenc A, Karsisto K.  2003.  Survey of Code-Size Reduction Methods. ACM Computing Surveys. 35:223-267.
2002
Ferenc R, Beszédes Á, Tarkiainen M, Gyimóthy T.  2002.  Columbus – Reverse Engineering Tool and Schema for C++. Proceedings of the 18th International Conference on Software Maintenance (ICSM'02). :172-181.
Ferenc R, Beszédes Á.  2002.  Data Exchange with the Columbus Schema for C++. Proceedings of the 6th European Conference on Software Maintenance and Reengineering (CSMR 2002). :59-66.
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.
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.
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.
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.
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.
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.
Beszédes Á, Szabó Z.M, Faragó C., Gyimóthy T.  2000.  Forward Computation of Dynamic Slices of C Programs.
Blázsik Z, Holló C., Imreh B, Imreh C., Kovács Z.  2000.  On a well solvable class of the PNS problem. Novi Sad Journal of Mathematics. 30:21-30.
1999
Gyimóthy T, Beszédes Á, Forgács I.  1999.  An Efficient Relevant Slicing Method for Debugging. Proceedings of the Joint 7th European Software Engineering Conference and 7th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (ESEC/FSE'99). :303-321.
Gyimóthy T, Beszédes Á, Forgács I.  1999.  An Efficient Relevant Slicing Method for Debugging.
Gyimóthy T, Beszédes Á, Forgács I.  1999.  An efficient relevant slicing method for debugging. SIGSOFT Softw. Eng. Notes. 24:303–321.
Beszédes Á, Ferenc R, Gyimóthy T, Magyar F, Márton G, Tarkianen M.  1999.  An Evaluation of Reverse Engineering Capabilities of the TDE/Columbus system.
Blázsik Z, Holló C., Imreh B.  1999.  Kiszámolható korlátok speciális PNS-problémaosztályok lehetséges megoldásainak a számára. :182-194.
Holló C., Blázsik Z, Imreh C., Kovács Z.  1999.  On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
1998
Blázsik Z, Holló C., Imreh B.  1998.  On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybernetica. 13:319-328.
Blázsik Z, Holló C., Imreh B.  1998.  Explicit bounds for the number of feasible solutions of special PNS-problem classes. Pure Mathematics and Applications. 9:17-27.