Publications

Export 642 results:
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
Imreh C., Bilicki V.  2004.  A forgalomszabályozás egy optimalizálási modellje. XXVI. Operációkutatási Konferencia.
Kertész Attila, Zs. Németh.  2009.  Formal Aspects of Grid Brokering. PDMC. :18-31.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Korel B.  2006.  A Formalisation of the Relationship between Forms of Program Slicing. Science of Computer Programming. 62:228–252.
Binkley D, Danicic S, Gyimóthy T, Harman M, Kiss Á, Ouarbya L.  2004.  Formalizing Executable Dynamic and Forward Slicing. Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004). :43–52.
Kiss Á.  2005.  Formalizing Slicing – Results, Current Work and Challenges. Beyond Program Slicing – Abstracts Collection. 05451:10–11.
Beszédes Á, Szabó Z.M, Faragó C., Gyimóthy T.  2000.  Forward Computation of Dynamic Slices of C Programs.
Kertész Attila.  2004.  Fraktálgenerálás párhuzamos környezetben.
Vidács L, Gogolla M, Ferenc R.  2006.  From C++ Refactorings to Graph Transformations. Electronic Communications of the EASST and Proceedings of the 3rd Workshop on Software Evolution through Transformations (Setra 2006). :127-141.
Hodován R, Kiss Á.  2018.  Fuzzinator: An Open-Source Modular Random Testing Framework. Proceedings of the 11th IEEE International Conference on Software Testing, Verification and Validation (ICST 2018). :416-421.
Hodován R, Kiss Á.  2016.  Fuzzing JavaScript Engine APIs. Integrated Formal Methods – 12th International Conference, iFM 2016. 9681:425–438.
G
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.
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 9th Symposium on Programming Languages and Software Tools (SPLST 2005). :49–58.
Fritzson P, Shahmehri N, Kamkar M, Gyimóthy T.  1992.  Generalized algorithmic debugging and testing. ACM Lett. Program. Lang. Syst.. 1:303–322.
Fritzson P, Gyimóthy T, Kamkar M, Shahmehri N.  1991.  Generalized algorithmic debugging and testing. Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation. :317–326.
Alexin Z.  2008.  Generating large and optimized FSA for Morphological Analysis. Proceedings of the 2008 International NooJ Conference. :60-66.
Toczki J, Gyimóthy T, Horváth T, Kocsis F.  1989.  Generating modular compilers in PROF-LP. Proceedings of the Workshop on Compiler Compilers and High Speed Compilation. :156-166.
Gyimóthy T.  1999.  Gépi tanulás. Mesterséges intelligencia.
Beszédes Á.  2015.  Global Dynamic Slicing for the C Language. Acta Polytechnica Hungarica. 12:117-136.
Kertész Attila, Kacsuk P.  2010.  GMBS: A new middleware service for making grids interoperable. Future Generation Computer Systems. 26:542-553.
Baniata H., Sharieh A., Mahmood S., Kertesz A..  2020.  Graft: A model for evaluating actuator systems in terms of force production. Sensors (Switzerland). 20
Hodován R, Kiss Á, Gyimóthy T.  2018.  Grammarinator: A Grammar-based Open Source Fuzzer. Proceedings of the 9th Workshop on Automating Test Case Design, Selection and Evaluation (A-TEST 2018).
Beszédes Á, Gergely Tamás, Gyimóthy T.  2006.  Graph-Less Dynamic Dependence-Based Dynamic Slicing Algorithms. Proceedings of the Sixth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'06). :21-30.
Kertész Attila.  2007.  Grid Brókerek evolúciója: Egységben az erő. Hiradástechnika.
Kertész Attila, Farkas Z, Kacsuk P, Kiss T.  2007.  Grid interoperability by multiple broker utilization and meta-brokering. Proceedings of 2nd International Workshop on Distributed Cooperative Laboratories: Instrumenting the GRID (INGRID 2007). :1-10.
Kertész Attila, Kacsuk P.  2009.  Grid Interoperability Solutions in Grid Resource Management. Systems Journal, IEEE. 3:131-141.