| Publications |
| Journal publications |
|
M. Bruynooghe, M. Codish, J. Gallagher, S. Genaim, and W. Vanhoof.Termination analysis through combination of type based norms.ACM Transactions on Programming Languages and Systems (TOPLAS) 29(2) pp. 1-44. April 2007.
M. Leuschel, J. Jorgensen, W. Vanhoof, and M. Bruynooghe.Offline specialisation in Prolog using a hand-written compiler generator.Theory and Practice of Logic Programming 4 (1), pp. 139-191, January, 2004
W. Vanhoof, D. De Schreye, and B. Martens.Bottom-up partial deduction of logic programs.Journal of Functional and Logic Programming 1999 (2) , pp. 1-33. The MIT Press, 1999
| Book chapters |
|
M. Leuschel, S.J. Craig, M. Bruynooghe, and W. Vanhoof.Specializing interpreters using offline partial deduction.K.K. Lau and M. Bruynooghe (eds.), Program Development in Computational Logic. pp. 341 - 376. Lecture Notes in Computer Science, volume 3049. Springer-Verlag. 2004.
W. Vanhoof, M. Bruynooghe, and M. Leuschel.Binding-time Analysis for Mercury.K.K. Lau and M. Bruynooghe (eds.), Program Development in Computational Logic. pp. 190 - 223. Lecture Notes in Computer Science, volume 3049. Springer-Verlag. 2004.
| Contributions at international conferences |
|
W. Vanhoof and F. Degrave.An Algorithm for Sophisticated Code Matching in Logic Programs.Short Paper. In M. Garcia de la Banda and E. Pontelli (Eds). Proceedings of ICLP 2008, LNCS 5366, pp. 785-789. To Appear.
F. Degrave, T. Schrijvers and W. Vanhoof.Automatic Test Input Generation for Mercury.Proceedings of LOPSTR 2008. Lecture Notes in Computer Science. Accepted
F. Degrave and W. Vanhoof.Towards a normal form for Mercury programs.Proceedings of LOPSTR 2007. Lecture Notes in Computer Science 4915, pp. 43-58. Springer-Verlag, 2008.
W. Vanhoof.Searching Semantically Equivalent Equivalent Code Fragments in Logic Programs.Logic-Based Program Synthesis and Transformation, August 2004. Lecture Notes in Computer Science Vol. 3573, Springer-Verlag 2005.
W. Vanhoof, R. Tronçon, and M. Bruynooghe.A fixed point semantics for logic programs extended with cuts.Logic Based Program Synthesis and Transformation, LOPSTR 2002, Revised Selected Papers (Leuschel, M., ed.), vol 2664, LNCS, pp. 238-257, 2003
W. Vanhoof, and M. Bruynooghe.When size does matter - Termination analysis for typed logic programs.Logic-based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Selected Papers (Pettorossi, A., ed.), vol 2372, Lecture Notes in Computer Science, pp. 129-147, 2002
M. Bruynooghe, M. Codish, S. Genaim, and W. Vanhoof.Reuse of results in termination analysis of typed logic programs.Static Analysis, 9th International Symposium (Hermenegildo, M. and Puebla, G., eds.), vol 2477, Lecture Notes in Computer Science, pp. 477-492, 2002
W. Vanhoof, and M. Bruynooghe.Binding-time annotations without binding-time analysis.Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, Proceedings (Nieuwenhuis, R. and Voronkov, A., eds.), vol 2250, Lecture Notes in Artificial Intelligence, pp. 707-722, 2001
M. Bruynooghe, W. Vanhoof, and M. Codish.Pos(T) : Analyzing dependencies in typed logic programs.Perspectives of System Informatics, 4th International Andrei Ershov Memorial Conference, PSI 2001, Revised Papers (Bjørner, D. and Broy, M. and Zalumin, A.V., eds.), vol 2244, LNCS, pp. 406-420, 2001
W. Vanhoof.Binding-time analysis by constraint solving: a modular and higher-order approach for Mercury.Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, November 2000, Proceedings (M. Parigot and A. Voronkov, eds.), vol 1955, Lecture Notes in Artificial Intelligence, pp. 399-416, 2000
W. Vanhoof, and M. Bruynooghe.Binding-time analysis for Mercury.Proceedings of the 16th International Conference on Logic Programming (De Schreye, Danny, ed.), MIT Press. pp. 500-514, 1999
W. Vanhoof, B. Martens, D. De Schreye, and K. De Vlaminck.Specialising the other way around.Logic Programming, Proceedings of 1998 Joint International Conference and Symposium on Logic Programming (JICSLP'98) (Jaffar, J., ed.), pp. 279-293, MIT Press. 1998
W. Vanhoof, D. De Schreye, and B. Martens.A Framework for bottom up specialisation of logic programs.Principles of Declarative Programming, Proceedings of Joint International Symposium PLILP/ALP'98 (Palamidessi, C. and Glaser, H. and Meinke, K., eds.), vol 1490, LNCS, pp. 54-72, 1998
W. Vanhoof, and B. Martens.To parse or not to parse.Logic Program Synthesis and Transformation, Proceedings of the 7th International Workshop LOPSTR'97 (Fuchs, N., ed.), vol 1463, LNCS, pp. 314-333, 1998
| Contributions as editor |
|
P.Y. Schobbens, W. Vanhoof and G. Schwanen.18th Belgium-Netherlands Conference on Artificial Intelligence.October 5-6 2006, Namur, Belgium
W. Vanhoof and S. Hernandez.WLPE'06: Workshop on Logic-based Methods in Programming Environments.ICLP/FLoC'06 workshop. Seattle, Washington, August 16 2006.
P. Hill and W. Vanhoof.WLPE 2007 : Workshop on Logic-based Methods in Programming Environments.ICLP'07 workshop. Porto, Portugal, September 13 2007.
| Contributions at international conferences (abstract only) and workshops |
|
F. Degrave and W. Vanhoof.Towards a normal form for Mercury programs.Preproceedings of LOPSTR 2007, Copenhagen, Denmark
F. Degrave and W. Vanhoof.A control flow graph for Mercury.Proceedings of CICLOPS 2007. Porto, Portugal
A. Serebrenik and W. Vanhoof.Fingerprinting Logic Programs.Workshop on Logic-based Methods in Programming Environments (WLPE2006). Seattle, USA, August 2006
N. Mweze, W. Vanhoof.Automatic Generation of Test Inputs for Mercury Programs (extended abstract).Pre-proceedings of LOPSTR 2006. Venice, Italy, July 2006.
M. Codish, S. Genaim, M. Bruynooghe, J. Gallagher, and W. Vanhoof.One Loop at a Time.6th International Workshop on Termination, WST'03, Valencia, Spain, June 13-14, 2003
N. Mazur, G. Janssens, and W. Vanhoof.Collecting potential optimisations.Logic Based Program Synthesis and Transformation, LOPSTR 2002, Revised Selected Papers (Leuschel, M., ed.), vol 2664, LNCS, pp. 109--110, 2003
W. Vanhoof, and M. Bruynooghe.Bottom-up transformation for programs with procedural control.LOPSTR 2002, Preproceedings of the International Workshop on Logic Based Program Development and Transformation (Leuschel, M. and Bueno, F., eds.), pp. 234-250, 2002
N. Mazur, G. Janssens, and W. Vanhoof.Collecting potential optimisations.LOPSTR 2002, Preproceedings of the International Workshop on Logic Based Program Development and Transformation (Leuschel, M. and Bueno, F., eds.), pp. 115-120, 2002
W. Vanhoof, and M. Bruynooghe.When size does matter - Termination analysis for typed logic programs.Pre-Proceedings, LOPSTR'01 : Logic-based Program Synthesis and Transformation (Pettorossi, A., ed.), pp. 67-76, 2001
M. Bruynooghe, W. Vanhoof, and M. Codish.Pos(T) : Analyzing dependencies in typed logic programs.Perspectives of System Informatics (Proceedings of Andrei Ershov Fourth International Conference), Preliminary Proceedings (Dines Bjorner and Manfred Broy and Alexandre Zamulin, eds.), pp. 212-218, 2001
W. Vanhoof, and M. Bruynooghe.Binding-time Annotations Without Binding-time Analysis.Fifth international workshop on termination, WST'01, Utrecht, The Netherlands, May 20-21, 2001
W. Vanhoof, and M. Bruynooghe.Towards a modular binding-time analysis for higher-order Mercury.Pre-Proceedings of Tenth International Workshop on Logic-based Program Synthesis and Transformation, 2000 (Kung-Kiu Lau, ed.), pp. 55-63, 2000
W. Vanhoof, and M. Bruynooghe.Binding-time analysis for Mercury.Pre-Proceedings of the 9th International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR'99) (Bossi, A., ed.), pp. 1-10, 1999
W. Vanhoof, and M. Bruynooghe.Towards modular binding-time analysis for first-order Mercury.Proceedings of the Workshop on Optimization and Implementation of Declarative Languages (Leuschel, Michael, ed.), pp. 1-9, 1999
W. Vanhoof, D. De Schreye, and B. Martens.Bottom up specialisation: towards general foundations.Logic Program Synthesis and Transformation, Pre-proceedings of LOPSTR'98 (Flener, P., ed.), pp. 114-121, 1998
W. Vanhoof.Bottom up information propagation for partial deduction.Proceedings of the International Workshop on Specialization of Declarative Programs and its Applications, Port Jefferson, Long Island, New York, U.S.A. (M. Leuschel, ed.), pp. 73-82, 1997
W. Vanhoof, and B. Martens.To parse or not to parse (Extended Abstract).Pre-Proceedings of the 7th International Workshop on Logic Program Synthesis and Transformation (N. Fuchs, ed.), pp. 1-19, 1997
W. Vanhoof, D. De Schreye, and B. Martens.Bottom up specialisation of logic programs.8th International Workshop on Logic Program Synthesis and Transformation, LOPSTR'98, Manchester, UK, June 1998
W. Vanhoof, D. De Schreye, and B. Martens.A framework for bottom-up specialisation of logic programs.Netherlands/Belgium Conference on Artificial Intelligence, NAIC'98, Amsterdam, The Netherlands, 18-19 November 1998
| Contributions at other conferences, not published or only as abstract |
|
W. Vanhoof>.Using types to obtain fine-grained size- and rigidity information.Termination Day: Logic Programming meets Term Rewriting. Leuven, November 3, 2003.
W. Vanhoof.Java programmeren: een inleiding.Lerarenopleiding, KHLeuven, September 26, 2001, unpublished
W. Vanhoof, and M. Bruynooghe.Binding-time annotations without binding-time analysis.F.N.R.S. meeting on Validation and Verification of Formal Descriptions, ULB, Brussel, June 6, 2001, Fundamental Computer Science FNRS Contact Group
W. Vanhoof.Java: van afstandsbediening tot afstandsbankieren.KHLeuven, departement lerarenopleiding, September 27, 2000
| Thesis |
|
W. Vanhoof.Techniques for on- and off-line specialisation of logic programs.Ph.D. Thesis, Department of Computer Science, K.U.Leuven, Leuven, Belgium, June, 2001, Pages: xiv+323+xxxiii
| Technical Reports |
|
M. Bruynooghe, M. Codish, S. Genaim and W. Vanhoof.A note on the reuse of the results of a termination analysis based on polymorphic types.Report CW 383 Department of Computer Science, K.U.Leuven, 2003
N. Mazur, G. Janssens and W. Vanhoof.Collecting Potential Optimisations.Report CW 357 Department of Computer Science, K.U.Leuven, 2003
W. Vanhoof and B. Martens.To Parse or Not to Parse.Report CW 251 Department of Computer Science, K.U.Leuven, 1997