| Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis CS Păsăreanu, W Visser, D Bushnell, J Geldenhuys, P Mehlitz, N Rungta Automated Software Engineering 20, 391-425, 2013 | 230 | 2013 |
| Green: reducing, reusing and recycling constraints in program analysis W Visser, J Geldenhuys, MB Dwyer Proceedings of the ACM SIGSOFT 20th International Symposium on the …, 2012 | 193 | 2012 |
| Probabilistic symbolic execution J Geldenhuys, MB Dwyer, W Visser Proceedings of the 2012 International Symposium on Software Testing and …, 2012 | 179 | 2012 |
| Tarjan’s algorithm makes on-the-fly LTL verification more efficient J Geldenhuys, A Valmari International Conference on Tools and Algorithms for the Construction and …, 2004 | 80 | 2004 |
| More efficient on-the-fly LTL verification with Tarjan's algorithm J Geldenhuys, A Valmari Theoretical Computer Science 345 (1), 60-82, 2005 | 72 | 2005 |
| Evaluating paper and author ranking algorithms using impact and contribution awards M Dunaiski, W Visser, J Geldenhuys Journal of Informetrics 10 (2), 392-407, 2016 | 58 | 2016 |
| Symbolic execution of programs with strings G Redelinghuys, W Visser, J Geldenhuys Proceedings of the South African Institute for Computer Scientists and …, 2012 | 50 | 2012 |
| BLISS: improved symbolic execution by bounded lazy initialization with SAT support N Rosner, J Geldenhuys, NM Aguirre, W Visser, MF Frias IEEE Transactions on Software Engineering 41 (7), 639-660, 2015 | 49 | 2015 |
| Statistical symbolic execution with informed sampling A Filieri, CS Păsăreanu, W Visser, J Geldenhuys Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations …, 2014 | 46 | 2014 |
| Larger automata and less work for LTL model checking J Geldenhuys, H Hansen Model Checking Software: 13th International SPIN Workshop, Vienna, Austria …, 2006 | 42 | 2006 |
| Runtime efficient state compaction in SPIN J Geldenhuys, PJA De Villiers Theoretical and Practical Aspects of SPIN Model Checking, 12-21, 1999 | 36 | 1999 |
| Reducing nondeterministic finite automata with SAT solvers J Geldenhuys, B Van Der Merwe, L Van Zijl Finite-State Methods and Natural Language Processing: 8th International …, 2010 | 32 | 2010 |
| State caching reconsidered J Geldenhuys International SPIN Workshop on Model Checking of Software, 23-38, 2004 | 32 | 2004 |
| Techniques for smaller intermediary bdds J Geldenhuys, A Valmari International Conference on Concurrency Theory, 233-247, 2001 | 28 | 2001 |
| Bounded lazy initialization J Geldenhuys, N Aguirre, MF Frias, W Visser NASA Formal Methods Symposium, 229-243, 2013 | 27 | 2013 |
| Exploring the scope for partial order reduction J Geldenhuys, H Hansen, A Valmari Automated Technology for Verification and Analysis: 7th International …, 2009 | 27 | 2009 |
| A nearly memory-optimal data structure for sets and mappings J Geldenhuys, A Valmari Model Checking Software: 10th International SPIN Workshop Portland, OR, USA …, 2003 | 25 | 2003 |
| Author ranking evaluation at scale M Dunaiski, J Geldenhuys, W Visser Journal of Informetrics 12 (3), 679-702, 2018 | 24 | 2018 |
| Finding the core developers J Geldenhuys 2010 36th EUROMICRO Conference on Software Engineering and Advanced …, 2010 | 24 | 2010 |
| Automatic scaling using gamma learning for feedforward neural networks AP Engelbrecht, I Cloete, J Geldenhuys, JM Zurada From Natural to Artificial Neural Computation: International Workshop on …, 1995 | 21 | 1995 |
Willem VisserComputer Science Division, Stellenbosch UniversityDirección de correo verificada de cs.sun.ac.za
