default search action
Wim Vanhoof
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c41]Rudy Kabimbi Ngoy, Gonzague Yernaux
, Wim Vanhoof
EvscApp: Evaluating the Pedagogical Relevance of Educational Escape Games for Computer Science. CSEDU (2) 2023: 241-251 - [c40]Gonzague Yernaux
Predicate Anti-unification in (Constraint) Logic Programming. LOPSTR 2023: 131-149 - [c39]Aymeric Vellinger
Neuroevolutionary Transfer Learning for Time Series Forecasting. SOCO (1) 2023: 219-228 - [c38]Felix Barzin, Gonzague Yernaux
Scrimmo: A Real-Time Web Scraper Monitoring the Belgian Real Estate Market. WI/IAT 2023: 335-338 - [c37]Gonzague Yernaux
A Dataflow Analysis for Comparing and Reordering Predicate Arguments. ICLP 2023: 41-54 - 2022
- [c36]Gonzague Yernaux
Anti-Unification of Unordered Goals. CSL 2022: 37:1-37:17 - [c35]Gonzague Yernaux
On Detecting Semantic Clones in Constraint Logic Programs. IWSC 2022: 32-38 - [e2]Emanuele De Angelis
Logic-Based Program Synthesis and Transformation - 31st International Symposium, LOPSTR 2021, Tallinn, Estonia, September 7-8, 2021, Proceedings. Lecture Notes in Computer Science 13290, Springer 2022, ISBN 978-3-030-98868-5 [contents] - 2021
- [i11]Gonzague Yernaux, Wim Vanhoof:
Technical Report: Anti-unification of Unordered Goals. CoRR abs/2107.00341 (2021) - [i10]Emanuele De Angelis, Wim Vanhoof:
Pre-proceedings of the 31st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2021). CoRR abs/2107.10160 (2021) - 2020
- [c34]Sophie Fortz
An SMT-Based Concolic Testing Tool for Logic Programs. FLOPS 2020: 215-219 - [c33]Gonzague Yernaux
Moulinog: A Generator of Random Student Assignments Written in Prolog. PPDP 2020: 15:1-15:5 - [i9]Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
An SMT-Based Concolic Testing Tool for Logic Programs. CoRR abs/2002.07115 (2020)
2010 – 2019
- 2019
- [j5]Gonzague Yernaux
Anti-unification in Constraint Logic Programming. Theory Pract. Log. Program. 19(5-6): 773-789 (2019) - [c32]Wim Vanhoof
Generalization-Driven Semantic Clone Detection in CLP. LOPSTR 2019: 228-242 - [c31]Cédric Libert, Wim Vanhoof
Analysis of students' preconceptions of concurrency. EASEAI@ESEC/SIGSOFT FSE 2019: 9-12 - [i8]Gonzague Yernaux, Wim Vanhoof:
Anti-unification in Constraint Logic Programming. CoRR abs/1907.10333 (2019) - 2017
- [c30]Cédric Libert, Wim Vanhoof
Survey of Software Visualization Systems to Teach Message-Passing Concurrency in Secondary School. PAAMS (Workshops) 2017: 386-397 - [e1]Wim Vanhoof, Brigitte Pientka:
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017. ACM 2017, ISBN 978-1-4503-5291-8 [contents] - 2016
- [c29]Frédéric Mesnard, Étienne Payet, Wim Vanhoof:
Towards a framework for algorithm recognition in binary code. PPDP 2016: 202-213 - 2015
- [j4]Michaël Marcozzi, Wim Vanhoof
Relational symbolic execution of SQL code for unit testing of database programs. Sci. Comput. Program. 105: 44-72 (2015) - [i7]Michaël Marcozzi, Wim Vanhoof, Jean-Luc Hainaut:
A Direct Symbolic Execution of SQL Code for Testing of Data-Oriented Applications. CoRR abs/1501.05265 (2015) - [i6]Michaël Marcozzi, Wim Vanhoof, Jean-Luc Hainaut:
A Symbolic Execution Algorithm for Constraint-Based Testing of Database Programs. CoRR abs/1501.05821 (2015) - 2014
- [c28]Michaël Marcozzi, Wim Vanhoof, Jean-Luc Hainaut:
Towards testing of full-scale SQL applications using relational symbolic execution. CSTVA 2014: 12-17 - 2013
- [c27]Michaël Marcozzi, Wim Vanhoof
A relational symbolic execution algorithm for constraint-based testing of database programs. SCAM 2013: 179-188 - [c26]Romain Demeyer, Wim Vanhoof
Static Application-Level Race Detection in STM Haskell using Contracts. PLACES 2013: 115-134 - 2012
- [c25]Celine Dandois, Wim Vanhoof
Semantic Code Clones in Logic Programs. LOPSTR 2012: 35-50 - [c24]Michaël Marcozzi, Wim Vanhoof
Test input generation for database programs using relational constraints. DBTest 2012: 6 - 2011
- [c23]Michaël Marcozzi, Federico Divina
A novel probabilistic encoding for EAs applied to biclustering of microarray data. GECCO 2011: 339-346 - [c22]Celine Dandois, Wim Vanhoof
Clones in Logic Programs and How to Detect Them. LOPSTR 2011: 90-105 - 2010
- [c21]Celine Dandois, Federico Divina
A multi-objective Evolutionary Concept Learner. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c20]Romain Demeyer, Maxime Van Assche, Ludovic Langevine, Wim Vanhoof
Declarative workflows to efficiently manage flexible and advanced business processes. PPDP 2010: 209-218 - [i5]Peter Biener, François Degrave, Wim Vanhoof:
A Test Automation Framework for Mercury. CoRR abs/1009.3765 (2010)
2000 – 2009
- 2009
- [c19]François Degrave, Tom Schrijvers
Towards a Framework for Constraint-Based Test Case Generation. LOPSTR 2009: 128-142 - 2008
- [c18]Wim Vanhoof, François Degrave:
An Algorithm for Sophisticated Code Matching in Logic Programs. ICLP 2008: 785-789 - [c17]François Degrave, Tom Schrijvers
Automatic Generation of Test Inputs for Mercury. LOPSTR 2008: 71-86 - 2007
- [j3]Maurice Bruynooghe, Michael Codish
Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29(2): 10 (2007) - [c16]François Degrave, Wim Vanhoof:
Towards a Normal Form for Mercury Programs. LOPSTR 2007: 43-58 - [i4]Patricia M. Hill, Wim Vanhoof:
Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007). CoRR abs/0712.3116 (2007) - [i3]Alexander Serebrenik, Wim Vanhoof:
Fingerprinting Logic Programs. CoRR abs/cs/0701081 (2007) - [i2]Wim Vanhoof, Susana Muñoz-Hernández:
Proceedings of the 16th Workshop in Logic-based Methods in Programming Environments (WLPE2006). CoRR abs/cs/0701148 (2007) - 2004
- [j2]Michael Leuschel, Jesper Jørgensen, Wim Vanhoof
Offline specialisation in Prolog using a hand-written compiler generator. Theory Pract. Log. Program. 4(1-2): 139-191 (2004) - [c15]Wim Vanhoof:
Searching Semantically Equivalent Code Fragments in Logic Programs. LOPSTR 2004: 1-18 - [p2]Wim Vanhoof, Maurice Bruynooghe, Michael Leuschel:
Binding-Time Analysis for Mercury. Program Development in Computational Logic 2004: 189-232 - [p1]Michael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof:
Specialising Interpreters Using Offline Partial Deduction. Program Development in Computational Logic 2004: 340-375 - 2002
- [c14]Nancy Mazur, Gerda Janssens, Wim Vanhoof:
Collecting Potential Optimisations. LOPSTR 2002: 109-110 - [c13]Wim Vanhoof
A Fixed Point Semantics for Logic Programs Extended with Cuts. LOPSTR 2002: 238-257 - [c12]Maurice Bruynooghe, Michael Codish
Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492 - [i1]Michael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe:
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator. CoRR cs.PL/0208009 (2002) - 2001
- [c11]Maurice Bruynooghe, Wim Vanhoof
Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference 2001: 406-420 - [c10]Wim Vanhoof, Maurice Bruynooghe:
When Size Does Matter. LOPSTR 2001: 129-147 - [c9]Wim Vanhoof
Binding-Time Annotations Without Binding-Time Analysis. LPAR 2001: 707-722 - 2000
- [c8]Wim Vanhoof, Maurice Bruynooghe:
Towards a modular binding-time analysis for higher-order Mercury. LOPSTR 2000 - [c7]Wim Vanhoof:
Binding-Time Analysis by Constraint Solving. A Modular and Higher-Order Approach for Mercury. LPAR 2000: 399-416
1990 – 1999
- 1999
- [j1]Wim Vanhoof, Danny De Schreye, Bern Martens:
Bottom-up Partial Deduction of Logic Programs. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [c6]Wim Vanhoof, Maurice Bruynooghe:
Binding-time Analysis for Mercury. ICLP 1999: 500-514 - [c5]Wim Vanhoof
Towards Modular Binding-Time Analysis for First-order Mercury. WOID@ICLP 1999: 189-198 - 1998
- [c4]Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck:
Specialising the Other Way Arond. IJCSLP 1998: 279-293 - [c3]Wim Vanhoof, Danny De Schreye
Bottom-Up Specialisation of Logic Programs. LOPSTR 1998: 325-327 - [c2]Wim Vanhoof
A Framework for Bottom Up Specialisation of Logic Programs. PLILP/ALP 1998: 54-72 - 1997
- [c1]Wim Vanhoof, Bern Martens:
To Parse or Not To Parse. LOPSTR 1997: 322-342
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-05-08 21:00 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: