Associate Professor Harald Sondergaard

  • Room: Level: 08 Room: 8.16
  • Building: Doug McDonell Building
  • Campus: Parkville

Research interests

  • Boolean functions (Data structures and algorithms for Boolean functions)
  • Fixed point theory (Lattices; Order; Algorithms)
  • Program transformation (Compilation; Partial evaluation)
  • Programming languages (Programming language semantics; Declarative programming)
  • Software verification
  • Static analysis of software (Abstract interpretation)

Personal webpage

http://people.eng.unimelb.edu.au/harald/

Biography

Harald Søndergaard is a Professor in the School of Computing and Information Systems at the University of Melbourne. His primary research areas are software reliability and security, program analysis, software verification, and declarative programming languages.

Harald received an MSc in Computer Science in 1987 and a PhD in 1989, both from the University of Copenhagen. He has been a member of academic staff at the University of Melbourne since 1990, serving as Deputy Head of Department in 2002-2003, as Associate Dean (Learning) in the Engineering Faculty from November 2001 to June 2006, and as Assistant Dean (Teaching Quality) in the Melbourne School of Engineering from July 2007 to June 2009. 

Harald has received national awards for teaching excellence (the inaugural CORE Teaching Award 2007 and a citation from the Australian Learning and Teaching Council in the same year) in addition to many local university awards.  He has been a member of the University's Teaching and Learning Development Committee for more than a decade and he publishes regularly on engineering and computer science education.

Recent publications

  1. Amadini, R.; Andrlon, M.; Gange, G.; Schachte, P.; Søndergaard, H.; Stuckey, PJ. Constraint Programming for Dynamic Symbolic Execution of JavaScript. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2019, Vol. 11494 LNCS, pp. 1-19. DOI: 10.1007/978-3-030-19212-9_1
  2. Kafle, B.; Gallagher, JP.; Gange, G.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. An iterative approach to precondition inference using constrained Horn clauses. Theory and Practice of Logic Programming. CAMBRIDGE UNIV PRESS. 2018, Vol. 18, Issue 3-4, pp. 553-570. DOI: 10.1017/S1471068418000091
  3. Amadini, R.; Gange, G.; Gauthier, F.; Jordan, A.; Schachte, P.; Sondergaard, H.; Stuckey, PJ.; Zhang, C. Reference Abstract Domains and Applications to String Analysis. Fundamenta Informaticae. IOS PRESS. 2018, Vol. 158, Issue 4, pp. 297-326. DOI: 10.3233/FI-2018-1650
  4. Alatawi, E.; Miller, T.; Sondergaard, H. Symbolic Execution with Invariant Inlay: Evaluating the Potential. 2018 25th Australasian Software Engineering Conference (ASWEC). IEEE. 2018, pp. 26-30. DOI: 10.1109/ASWEC.2018.00012
  5. Wang, W.; Søndergaard, H.; Stuckey, PJ. Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation. Journal of Automated Reasoning. Springer Nature. 2018. DOI: 10.1007/s10817-018-9493-1
  6. Kafle, B.; Gange, G.; Schachte, P.; Søndergaard, H.; Stuckey, PJ. A benders decomposition approach to deciding modular linear integer arithmetic. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer. 2017, Vol. 10491 LNCS, pp. 380-397. DOI: 10.1007/978-3-319-66263-3_24
  7. Amadini, R.; Jordan, A.; Gange, G.; Gauthier, F.; Schachte, P.; Sondergaard, H.; Stuckey, PJ.; Zhang, C. Combining String Abstract Domains for JavaScript Analysis: An Evaluation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). SPRINGER INTERNATIONAL PUBLISHING AG. 2017, Vol. 10205, pp. 41-57. DOI: 10.1007/978-3-662-54577-5_3
  8. Alatawi, E.; Sondergaard, H.; Miller, T. Leveraging abstract interpretation for efficient dynamic symbolic execution. 2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE Press. 2017, pp. 619-625. DOI: 10.1109/ASE.2017.8115672
  9. Mendoza, A.; Sondergaard, H.; Venables, A. Making sense of a learning management system's quiz analytics in understanding students' learning difficulties. . Australasian Association for Engineering Education. 2017, pp. 112-119.
  10. Wang, W.; Sondergaard, H.; Stuckey, P. A bit-vector solver with word-level propagation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2016, Vol. LNCS 9676, pp. 374-391. DOI: 10.1007/978-3-319-33954-2_27
  11. Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. A complete refinement procedure for regular separability of context-free languages. Theoretical Computer Science. ELSEVIER SCIENCE BV. 2016, Vol. 625, pp. 1-24. DOI: 10.1016/j.tcs.2016.01.026
  12. Gange, G.; Navas Laserna, J.; Schachte, P.; Sondergaard, H.; Stuckey, P. An abstract domain of uninterpreted functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin Heidelberg. 2016, Vol. LNCS 9583, pp. 85-103. DOI: 10.1007/978-3-662-49122-5
  13. Lin, Y.; Miller, T.; Sondergaard, H. Compositional Symbolic Execution: Incremental Solving Revisited. Proceedings - Asia-Pacific Software Engineering Conference, APSEC. IEEE. 2016, pp. 273-280. DOI: 10.1109/APSEC.2016.49
  14. Gange, G.; Navas, J.; Schachte, P.; Sondergaard, H.; Stuckey, P. Exploiting Sparsity in Difference-Bound Matrices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin Heidelberg. 2016, Vol. 9837, pp. 189-211. DOI: 10.1007/978-3-662-53413-7_10
  15. Alatawi, E.; Miller, T.; Sondergaard, H. Generating source inputs for metamorphic testing using dynamic symbolic execution. Proceedings of the 1st International Workshop on Metamorphic Testing - MET '16. Association for Computing Machinery (ACM). 2016, Vol. 16, pp. 19-25. DOI: 10.1145/2896971.2896980
  16. Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. A tool for intersecting context-free grammars and its applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2015, Vol. 9058, pp. 422-428. DOI: 10.1007/978-3-319-17524-9_31
  17. Cornish, JRM.; Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. Analyzing Array Manipulating Programs by Program Transformation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2015, Vol. 8981, pp. 3-20. DOI: 10.1007/978-3-319-17822-6_1
  18. Lin, Y.; Miller, T.; Sondergaard, H. Compositional symbolic execution using fine-grained summaries. 2015 24th Australasian Software Engineering Conference. IEEE. 2015, pp. 213-222. DOI: 10.1109/ASWEC.2015.32
  19. Gange, G.; Navas Laserna, J.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. Horn Clauses As an Intermediate Representation for Program Analysis and Transformation. Theory and Practice of Logic Programming. Cambridge University Press. 2015, Vol. 15, Issue 4-5, pp. 526-542. DOI: 10.1017/S1471068415000204
  20. Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss. ACM Transactions on Programming Languages and Systems. Association for Computing Machinery. 2015, Vol. 37, Issue 1, pp. 1:1-1:35. DOI: 10.1145/2651360

View a full list of publications on the University of Melbourne’s ‘Find An Expert’ profile