default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaco Geldenhuys
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Trienko L. Grobler
, Manfred Habeck, Lynette van Zijl, Jaco Geldenhuys:
Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words. J. Univers. Comput. Sci. 29(2): 100-117 (2023)- 2020
- [c25]Jan Taljaard, Jaco Geldenhuys, Willem Visser:
Constraint Caching Revisited. NFM 2020: 251-266 - [c24]Willem Visser, Jaco Geldenhuys:
COASTAL: Combining Concolic and Fuzzing for Java (Competition Contribution). TACAS (2) 2020: 373-377
2010 – 2019
- 2019
- [j11]Marcel Dunaiski, Jaco Geldenhuys, Willem Visser:
On the interplay between normalisation, bias, and performance of paper impact metrics. J. Informetrics 13(1): 270-290 (2019) - [j10]Marcel Dunaiski, Jaco Geldenhuys, Willem Visser:
Globalised vs averaged: Bias and ranking performance on the author level. J. Informetrics 13(1): 299-313 (2019) - 2018
- [j9]Marcel Dunaiski, Jaco Geldenhuys, Willem Visser:
How to evaluate rankings of academic entities using test data. J. Informetrics 12(3): 631-655 (2018) - [j8]Marcel Dunaiski, Jaco Geldenhuys, Willem Visser:
Author ranking evaluation at scale. J. Informetrics 12(3): 679-702 (2018) - 2016
- [j7]Marcel Dunaiski, Willem Visser, Jaco Geldenhuys:
Evaluating paper and author ranking algorithms using impact and contribution awards. J. Informetrics 10(2): 392-407 (2016) - 2015
- [j6]Nicolás Rosner, Jaco Geldenhuys, Nazareno Aguirre, Willem Visser, Marcelo F. Frias:
BLISS: Improved Symbolic Execution by Bounded Lazy Initialization with SAT Support. IEEE Trans. Software Eng. 41(7): 639-660 (2015) - [c23]Matthew B. Dwyer, Antonio Filieri, Jaco Geldenhuys, Mitchell J. Gerrard, Corina S. Pasareanu, Willem Visser:
Probabilistic Program Analysis. GTTSE 2015: 1-25 - [c22]Antonio Filieri, Corina S. Pasareanu, Willem Visser, Jaco Geldenhuys:
Statistical Symbolic Execution with Informed Sampling. Software Engineering & Management 2015: 51-52 - [e1]Bernd Fischer, Jaco Geldenhuys:
Model Checking Software - 22nd International Symposium, SPIN 2015, Stellenbosch, South Africa, August 24-26, 2015, Proceedings. Lecture Notes in Computer Science 9232, Springer 2015, ISBN 978-3-319-23403-8 [contents] - 2014
- [j5]A. B. van der Merwe, Lynette van Zijl, Jaco Geldenhuys:
Ambiguity and structural ambiguity of symmetric difference NFAs. Theor. Comput. Sci. 537: 97-104 (2014) - [c21]Antonio Filieri, Corina S. Pasareanu, Willem Visser, Jaco Geldenhuys:
Statistical symbolic execution with informed sampling. SIGSOFT FSE 2014: 437-448 - 2013
- [j4]Corina S. Pasareanu, Willem Visser, David H. Bushnell, Jaco Geldenhuys, Peter C. Mehlitz, Neha Rungta:
Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis. Autom. Softw. Eng. 20(3): 391-425 (2013) - [c20]Brink van der Merwe, Mark Farag, Jaco Geldenhuys:
Counting Minimal Symmetric Difference NFAs. LATA 2013: 419-430 - [c19]Jaco Geldenhuys, Nazareno Aguirre, Marcelo F. Frias, Willem Visser:
Bounded Lazy Initialization. NASA Formal Methods 2013: 229-243 - 2012
- [c18]Jaco Geldenhuys, Matthew B. Dwyer, Willem Visser:
Probabilistic symbolic execution. ISSTA 2012: 166-176 - [c17]Jean Fourie, Jaco Geldenhuys, Cornelia P. Inggs:
Improving communication for distributed model checking. SAICSIT 2012: 41-50 - [c16]Gideon Redelinghuys, Willem Visser, Jaco Geldenhuys:
Symbolic execution of programs with strings. SAICSIT 2012: 139-148 - [c15]Willem Visser, Jaco Geldenhuys, Matthew B. Dwyer:
Green: reducing, reusing and recycling constraints in program analysis. SIGSOFT FSE 2012: 58 - 2011
- [j3]Lynette van Zijl, Jaco Geldenhuys:
Descriptional Complexity of Ambiguity in Symmetric Difference NFAs. J. Univers. Comput. Sci. 17(6): 874-890 (2011) - [c14]Brink van der Merwe, Lynette van Zijl, Jaco Geldenhuys:
Ambiguity of Unary Symmetric Difference NFAs. ICTAC 2011: 256-266 - 2010
- [c13]Jaco Geldenhuys:
Finding the Core Developers. EUROMICRO-SEAA 2010: 447-450 - [c12]Willem Visser, Jaco Geldenhuys:
Impendulo: debugging the programmer. ASE 2010: 351-352
2000 – 2009
- 2009
- [j2]Jaco Geldenhuys, Brink van der Merwe:
Comparing leaf and root insertion. South Afr. Comput. J. 44: 30-38 (2009) - [c11]Jaco Geldenhuys, Henri Hansen, Antti Valmari:
Exploring the Scope for Partial Order Reduction. ATVA 2009: 39-53 - [c10]Jaco Geldenhuys, Brink van der Merwe, Lynette van Zijl:
Reducing Nondeterministic Finite Automata with SAT Solvers. FSMNLP 2009: 81-92 - 2008
- [c9]Heikki Orsila, Jaco Geldenhuys, Anna Ruokonen, Imed Hammouda:
Update Propagation Practices in Highly Reusable Open Source Components. OSS 2008: 159-170 - [c8]Henri Hansen, Jaco Geldenhuys:
Cheap and Small Counterexamples. SEFM 2008: 53-62 - 2006
- [c7]Jaco Geldenhuys, Henri Hansen:
Larger Automata and Less Work for LTL Model Checking. SPIN 2006: 53-70 - 2005
- [j1]Jaco Geldenhuys, Antti Valmari:
More efficient on-the-fly LTL verification with Tarjan's algorithm. Theor. Comput. Sci. 345(1): 60-82 (2005) - 2004
- [c6]Jaco Geldenhuys:
State Caching Reconsidered. SPIN 2004: 23-38 - [c5]Jaco Geldenhuys, Antti Valmari:
Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. TACAS 2004: 205-219 - 2003
- [c4]Jaco Geldenhuys, Antti Valmari:
A Nearly Memory-Optimal Data Structure for Sets and Mappings. SPIN 2003: 136-150 - 2001
- [c3]Jaco Geldenhuys, Antti Valmari:
Techniques for Smaller Intermediary BDDs. CONCUR 2001: 233-247
1990 – 1999
- 1999
- [c2]Jaco Geldenhuys, P. J. A. de Villiers:
Runtime Efficient State Compaction in SPIN. SPIN 1999: 12-21 - 1995
- [c1]Andries P. Engelbrecht, Ian Cloete, Jaco Geldenhuys, Jacek M. Zurada:
Automatic Scaling using Gamma Learning for Feedforward Neural Networks. IWANN 1995: 374-381
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
