Publications
Export 66 results:
[ Author
Filters: First Letter Of Last Name is H [Clear All Filters]
Code Coverage Differences of Java Bytecode and Source Code. Software Quality Journal. 27(1):79-123.
.
2019. Separating JavaScript Applications by Processes. Proceedings of the 11th Symposium on Programming Languages and Software Tools (SPLST'09) and 7th Nordic Workshop on Model Driven Software Engineering (NW-MODE'09). :189–194.
.
2009. Comparison of static- and dynamic call graphs. Volume of Extended Abstracts of 5th Conference of PhD Students in Computer Science (CSCS 2006). :56.
.
2006. A New Interactive Fault Localization Method with Context Aware User Feedback. Proceedings of the First International Workshop on Intelligent Bug Fixing (IBF 2019). :23-28.
.
2019. Test Suite Evaluation using Code Coverage Based Metrics. Proceedings of the 14th Symposium on Programming Languages and Software Tools (SPLST'15). :46-60.
.
2015. Code Coverage Differences of Java Bytecode and Source Code Instrumentation Tools. Software Quality Journal.
.
2017. Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. Proceedings of the 9th International Workshop on Inductive Logic Programming. :128–139.
.
1999. .
1990. Code Coverage Measurement Framework for Android Devices. Acta Cybernetica. 21:439-458.
.
2014. General Flow-Sensitive Pointer Analysis and Call Graph Construction. Proceedings of the 9th Symposium on Programming Languages and Software Tools (SPLST 2005). :49–58.
.
2005. Experiments with Interactive Fault Localization Using Simulated and Real Users. Proceedings of the 36th IEEE International Conference on Software Maintenance and Evolution (ICSME'20).
.
2020. Interactive diagnosis and testing of logic programs. Third Finnish- Estonian- Hungarian Symposium on Programming Languages and Software Tools. :34-47.
.
1993. General Flow-Sensitive Pointer Analysis and Call Graph Construction. Proceedings of the Estonian Academy of Sciences – Engineering. 11:286–295.
.
2005. On a Merging Reduction of the Process Network Synthesis Problem. Acta Cybernetica. 14:251-261.
.
1999. A Look Ahead Branch-and-Bound Procedure for Solving PNS Problems. Pure Mathematics and Applications. 11:265-279.
.
2000. .
1995. Hallgatói teljesítések javításának lehet\H oségei a fels\H ooktatásban informatikus szakokon. INFODIDACT 2016 Informatika Szakmódszertani Konferencia elektronikus kiadványa (DVD). :1–13.
.
2016. A Procedure Based on Automaton Theory Approach for Solving Modified PNS Problems. Pure Mathematics and Applications. 13:159-169.
.
2002. Reduction techniques for the PNS problems: a novel technique and a review. Optimization and Engineering. 10:351-361.
.
2009. .
1995. A partial enumeration algorithm for solving PNS problems. Mathematical and Computer Modelling. 38:855-864.
.
2003. .
2004. .
2011. Reliability considerations for process network synthesis problems. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH. 22?
.
2013. .
1996.