Publication List

Edited Volumes

• Gill, A. & Hage, J. (2012). 23rd International Symposium, IFL 2011, Lawrence, Kansas, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), volume 7257. Go There
• Hage, J. & Morazán, M. T. (2011). 22nd International Symposium, IFL 2010, Alphen aan den Rijn, The Netherlands, September 1-3, 2010, Revised Selected Papers. Lecture Notes in Computer Science (LNCS), volume 6647. Go There

International Journals

• Hage, J. (2012). Subgroup Switching of Skew Gain Graphs. Fundamenta Informaticae, 116(1-4), 111-122, IOS Press.
• Bodlaender, H. & Hage, J. (2012). On switching classes, NLC-width, cliquewidth and treewidth. Theoretical Computer Science, 429(0), 30-35, Science Direct Download.
• Holdermans, S. & Hage, J. (2011). Making ``Stricterness'' More Relevant, extended version of the PEPM '10 paper, Higher Order Symbolic Computation, 23(3), 315-335, Springer Download
• Boustani, N. el & Hage, J. (2011). Improving Type Error Messages for Generic Java, extended version of the PEPM '09 paper, Higher Order Symbolic Computation, Volume 24, Issue 1, 3-39, Springer. Download
• Hage, J., & Heeren, B.J. (2009). Strategies for Solving Constraints in Type and Effect Systems. Electronic Notes in Theoretical Computer Science, 236, 163-183. Journal version of the Proceedings of 3rd Views On Designing Complex Architectures (VODCA '08).
• Hage, J. & Harju, T. (2007). Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discussiones Mathematicae Graph Theory, 27(3), 471-483.
• Ehrenfeucht, A., Hage, J., Harju, T., & Rozenberg, G. (2006). The embedding problem for switching classes of graphs. Fundamenta Informaticae, 74, 1-17.
• Hage, J., & Harju, T. (2004). A characterization of acyclic switching classes using forbidden subgraphs. SIAM Journal on Discrete Mathematics, 18, 159-176.
• Hage, J. (2003). Enumerating submultisets of multisets. Information Processing Letters, 85, 221-226.
• Hage, J., Harju, T., & Welzl, E. (2003). Euler graphs, triangle-free graphs and bipartite graphs in swithing classes. Fundamenta Informaticae, 58, 23-37.
• Ehrenfeucht, A., Hage, J., Harju, T., & Rozenberg, G. (2000). Pancyclicity in switching classes. Information Processing Letters, 73, 153-156.
• Hage, J., & Harju, T. (2000). The size of switching classes with skew gains. Discrete Math., 215, 81-92.
• Hage, J. (1999). The membership problem for switching classes with skew gains. Fundamenta Informaticae, 39, 375-387.
• Hage, J., & Harju, T. (1998). Acyclicity of switching classes. European J. Combin., 19, 321-327.

International conferences and workshops with published proceedings

• Hage, J., Vermeer, B. & Verburg, G. (2013). Plagiarism Detection for Haskell with Holmes. Accepted for CSERC 2013, Arnhem, the Netherlands.
• Polychniatis, T., Bouwers, E., Visser, J., Hage, J. & Jansen, S. (2013). Detecting Cross-language Dependencies Generically. ERA Track Proceedings of the 17th European Conference on Software Maintenance and Reengineering (CSMR '13), Genova, Italy, pages 349-352.
• Weijers, J., Hage, J, & Holdermans, S. (2013). Security Type Error Diagnosis for Higher-Order Polymorphic Languages. Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM '13), Rome, Italy, pages 3 - 12. Recipient Best Paper Award
• Khadka, R., Reijnders, G., Saeidi, A., Jansen, S., & Hage, J. (2011). A method engineering based legacy to SOA migration method. Proceedings of the 27th IEEE International Conference on Software Maintenance (ICSM'11), Williamsburg, USA, pages 163-172.
• Khadka, R., Jansen, S., Saeidi, A., Hage, J. & Helms, R. (2011). An Evaluation of Service Frameworks for the Management of Service Eco Systems. Proceedings of the 15th Pacific Asia Conference on Information System (PACIS'11), Brisbane, Australia.
• Alves, T., Hage, J. & Rademaker, P. (2011). A Comparative Study of Code Query Technologies. 11th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM), Williamsburg, USA, pages 145-154.
• Hage, J., Rademaker, P. & Van Vugt, N. (2011). Plagiarism detection for Java: a tool comparison. In Marko van Eekelen, Peter Sloep and Gerrit van der Veer, editors, Proceedings of the 1st Computer Science Education Research Conference, CSERC '11, Heerlen, The Netherlands, April 7-8, pages 33-46, ACM Digital Library, 2011.
• Holdermans, S. & Hage, J. (2010). Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators. In Paul Hudak and Stephanie Weirich, editors, Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, Baltimore, Maryland, USA, September 27–29, 2010, pages 63–74. ACM Press, 2010. [ pdf ]
• Holdermans, S. & Hage, J. (2010). On the Rôle of Minimal Typing Derivations in Type-driven Program Transformation, In Claus Braband and Pierre-Etienne Moreau, editors, Proceedings of the Tenth Workshop on Language Descriptions, Tools and Applications, LDTA 2010, Paphos, Cyprus, March 27–28, 2010. ACM Press, 2010.
• Boustani, N. el & Hage, J. (2010). Corrective Hints for Type Incorrect Generic Java Programs, Proceedings of the ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM '10), (pp. 5-14). ACM Press.
• Holdermans, S. & Hage, J. (2010). Making ``Stricterness'' More Relevant. Proceedings of the ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation (PEPM '10), (pp. 121-130). ACM Press.
• Boustani, N. el & Hage, J. (2009). Improving Type Error Messages for Generic Java, Proceedings of the ACM SIGPLAN 2009 Workshop on Partial Evaluation and Program Manipulation (PEPM '09), (pp. 131-140). ACM Press.
• Hage, J, & Keeken, P. van (2009). Neon: a Library for Language Usage Analysis, Proceedings of the 1st Conference on Software Language Engineering (SLE '08), (pp. 35--53). Lecture Notes in Computer Science volume 5452. Spring Verlag.
• Dolstra, E., Hage, J., Heeren, B., Holdermans, S., Jeuring, J., Löh, A., Löh, C., Middelkoop, A., Rodriguez, A., & Van Schie, J. (2008). Report on the tenth ICFP programming contest. Proceedings of the 13th ACM SIGPLAN international conference on Functional programming (ICFP '08), (pp. 397-408). ACM Press.
• Hage, J., & Holdermans, S. (2008). Heap recycling for lazy languages. Proceedings of the ACM SIGPLAN 2008 Workshop on Partial Evaluation and Program Manipulation (PEPM '08), (pp. 189-198). ACM Press.
• Hage, J., Holdermans, S., & Middelkoop, A. (2007). A generic usage analysis with subeffect qualifiers. In R. Hinze & N. Ramsey (Eds.), Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming (ICFP '07), (pp. 235-246). ACM Press.
• Hage, J., & Heeren, B.J. (2007). Heuristics for type error discovery and recovery. In Z. Horváth, V. Zsók & A. Butterfield (Eds.), Proceedings of Implementation of Functional Languages (IFL '06), LNCS 4449 (pp. 199-216). Heidelberg: Springer-Verlag.
• Heeren, B.J., & Hage, J. (2005). Type class directives. In M. Hermenegildo & D. Cabeza (Eds.), Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL '05), LNCS 3350 (pp. 253-267). Berlin: Springer-Verlag.
• Ehrenfeucht, A., Hage, J., Harju, T., & Rozenberg, G. (2004). Embedding in switching classes with skew gains. In H. Ehrig, G. Engels, F. Parisi-Presicce, & G. Rozenberg (Eds.), Graph Transformations, Second International Conference (ICGT '04), LNCS 3256 (pp. 257-270). Springer-Verlag.
• Heeren, B.J., Hage, J., & Swierstra, S.D. (2003). Constraint based type inferencing in Helium. In M.-C. Silaghi & M. Zanker (Eds.), Workshop Proceedings of Immediate Applications of Constraint Programming (pp. 59-80). Cork.
• Heeren, B.J., Hage, J., & Swierstra, S.D. (2003). Scripting the type inference process. In Eighth ACM Sigplan International Conference on Functional Programming (ICFP '03) (pp. 3-13). New York: ACM Press.
• Hage, J., Harju, T., & Welzl, E. (2002). Euler graphs, triangle-free graphs and bipartite graphs in swithing classes. In A. Corradini, H. Ehrig, H-J. Kreowski & G. Rozenberg (Eds.), First International Conferrence on Graph Transformation (ICGT '02) LNCS 2505, (pp. 148-160). Berlin: Springer Verlag.
• Ehrenfeucht, A., Hage, J., Harju, T., & Rozenberg, G. (2000). Complexity issues in switching of graphs. In H. Ehrig, G. Engels, H.-J. Kreowski, & G. Rozenberg (Eds.), Theory And Application Of Graph Transformations (TAGT '98), LNCS 1764 (pp. 59-70). Berlin: Springer Verlag.

Book chapters

• Khadka, R., Saeidi, A., Hage, J., Jansen, S. & Idu, A. (2012). Legacy to SOA Evolution: A Systematic Literature Review, accepted for the book Migrating to SOA and Cloud Environments: Challenges in Service Oriented Architecture and Cloud Computing Environments, A. D. Ionita, G. Lewis & M. Litoiu (editors).
• Hage, J. & Harju, T. (2009). On Involutions Arising From Graphs. In A. Condon, D. Harel, J. Kok, A. Salomaa & E. Winfree (Eds.), Algorithmic Bioprocesses (pp. 632-630). Berlin: Springer Verlag.

Other refereed papers

• Hage, J. (2007, April). Programmeerplagiaatdetectie met Marble. TINFON Tijdschrijft voor Informaticaonderwijs, 16(1) pp. 4-8.

Theses and dissertations

• Hage, J. (2001, September 26). Structural Aspects of Switching Classes. LIACS (152 pag.) (Leiden). Promotor: G. Rozenberg. (PhD Thesis)
• Hage, J. (1994). ARL and PR2, reversible languages. Leiden: Leiden University. (MSc Thesis)

You can also look at the Metis overview of my publications.

-- JurriaanHage