Jaco Geldenhuys

Orcid: 0000-0002-5636-6656

According to our database1, Jaco Geldenhuys authored at least 36 papers between 1995 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words.
J. Univers. Comput. Sci., February, 2023

2020
COASTAL: Combining Concolic and Fuzzing for Java (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Constraint Caching Revisited.
Proceedings of the NASA Formal Methods - 12th International Symposium, 2020

2019
Globalised vs averaged: Bias and ranking performance on the author level.
J. Informetrics, 2019

On the interplay between normalisation, bias, and performance of paper impact metrics.
J. Informetrics, 2019

2018
Author ranking evaluation at scale.
J. Informetrics, 2018

How to evaluate rankings of academic entities using test data.
J. Informetrics, 2018

2016
Evaluating paper and author ranking algorithms using impact and contribution awards.
J. Informetrics, 2016

2015
BLISS: Improved Symbolic Execution by Bounded Lazy Initialization with SAT Support.
IEEE Trans. Software Eng., 2015

Statistical Symbolic Execution with Informed Sampling.
Proceedings of the Software Engineering & Management 2015, Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW, 17. März, 2015

Probabilistic Program Analysis.
Proceedings of the Grand Timely Topics in Software Engineering, 2015

2014
Ambiguity and structural ambiguity of symmetric difference NFAs.
Theor. Comput. Sci., 2014

2013
Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis.
Autom. Softw. Eng., 2013

Bounded Lazy Initialization.
Proceedings of the NASA Formal Methods, 2013

Counting Minimal Symmetric Difference NFAs.
Proceedings of the Language and Automata Theory and Applications, 2013

2012
Green: reducing, reusing and recycling constraints in program analysis.
Proceedings of the 20th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-20), 2012

Symbolic execution of programs with strings.
Proceedings of the 2012 South African Institute of Computer Scientists and Information Technologists Conference, 2012

Improving communication for distributed model checking.
Proceedings of the 2012 South African Institute of Computer Scientists and Information Technologists Conference, 2012

Probabilistic symbolic execution.
Proceedings of the International Symposium on Software Testing and Analysis, 2012

2011
Descriptional Complexity of Ambiguity in Symmetric Difference NFAs.
J. Univers. Comput. Sci., 2011

Ambiguity of Unary Symmetric Difference NFAs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010
Impendulo: debugging the programmer.
Proceedings of the ASE 2010, 2010

Finding the Core Developers.
Proceedings of the 36th EUROMICRO Conference on Software Engineering and Advanced Applications, 2010

2009
Comparing leaf and root insertion.
South Afr. Comput. J., 2009

Reducing Nondeterministic Finite Automata with SAT Solvers.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

Exploring the Scope for Partial Order Reduction.
Proceedings of the Automated Technology for Verification and Analysis, 2009

2008
Cheap and Small Counterexamples.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

Update Propagation Practices in Highly Reusable Open Source Components.
Proceedings of the Open Source Development, 2008

2006
Larger Automata and Less Work for LTL Model Checking.
Proceedings of the Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30, 2006

2005
More efficient on-the-fly LTL verification with Tarjan's algorithm.
Theor. Comput. Sci., 2005

2004
Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2004

State Caching Reconsidered.
Proceedings of the Model Checking Software, 2004

2003
A Nearly Memory-Optimal Data Structure for Sets and Mappings.
Proceedings of the Model Checking Software, 2003

2001
Techniques for Smaller Intermediary BDDs.
Proceedings of the CONCUR 2001, 2001

1999
Runtime Efficient State Compaction in SPIN.
Proceedings of the Theoretical and Practical Aspects of SPIN Model Checking, 1999

1995
Automatic Scaling using Gamma Learning for Feedforward Neural Networks.
Proceedings of the From Natural to Artificial Neural Computation, 1995


  Loading...