Harald Søndergaard

Graeme Gange, Jorge A. Navas, Peter J. Stuckey, Harald Søndergaard, Peter Schachte: Unbounded Model-Checking with Interpolation for Regular Language Constraints. TACAS 2013: 277-291

Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey: Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code. APLAS 2012: 115-130

Lee Naish, Harald Søndergaard, Benjamin Horsfall: Logic Programming: From Underspecification to Undefinedness. CATS 2012: 49-58

Matthew Davis, Peter Schachte, Zoltan Somogyi, Harald Søndergaard: Towards region-based memory management for Go. MSPC 2012: 58-67

Peter Schachte, Harald Søndergaard, Leigh Whiting, Kevin Henshall: Information loss in knowledge compilation: A comparison of Boolean envelopes. Artif. Intell. 174(9-10): 585-596 (2010)

Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: An Algorithm for Affine Approximation of Binary Decision Diagrams. Chicago J. Theor. Comput. Sci. 2010 (2010)

Andy King, Harald Søndergaard: Automatic Abstraction for Congruences. VMCAI 2010: 197-213

Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Boolean Affine Approximation with Binary Decision Diagrams. CATS 2009: 119-127

Harald Søndergaard: Learning from and with peers: the different roles of student peer reviewing. ITiCSE 2009: 31-35

Trevor Hansen, Peter Schachte, Harald Søndergaard: State Joining and Splitting for the Symbolic Execution of Binaries. RV 2009: 76-92

Andy King, Harald Søndergaard: Inferring Congruence Equations Using SAT. CAV 2008: 281-293

Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Binary Decision Diagrams for Affine Approximation. CoRR abs/0804.0066 (2008)

Brian Herlihy, Peter Schachte, Harald Søndergaard: Un-Kleene Boolean equation Solving. Int. J. Found. Comput. Sci. 18(2): 227-250 (2007)

Peter Schachte, Harald Søndergaard: Boolean Approximation Revisited. SARA 2007: 329-343

Brian Herlihy, Peter Schachte, Harald Søndergaard: Boolean equation solving as graph traversal. CATS 2006: 123-132

Peter Schachte, Harald Søndergaard: Closure Operators for ROBDDs. VMCAI 2006: 1-16

Alistair Moffat, Baden Hughes, Harald Søndergaard, Paul Gruba: Making Connections: First Year Transition for Computer Science and Software Engineering Students. ACE 2005: 229-238

Paul Gruba, Alistair Moffat, Harald Søndergaard, Justin Zobel: What Drives Curriculum Change? ACE 2004: 109-117

Michael Codish, Harald Søndergaard: Meta-circular Abstract Interpretation in Prolog. The Essence of Computation 2002: 109-134

Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Exception analysis for non-strict languages. ICFP 2002: 98-109

Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149

Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Boolean Constraints for Binding-Time Analysis. PADO 2001: 39-62

Paul Gruba, Harald Søndergaard: Transforming Communication Skills Instruction: The Conference Approach. ACSC 2000: 88-94

Michael Codish, Harald Søndergaard, Peter J. Stuckey: Sharing and groundness dependencies in logic programs. ACM Trans. Program. Lang. Syst. 21(5): 948-976 (1999)

Linda Stern, Harald Søndergaard, Lee Naish: A strategy for managing content complexity in algorithm animation. ITiCSE 1999: 127-130

Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey, Harald Søndergaard: Differential Methods in Logic Program Analysis. J. Log. Program. 35(1): 1-37 (1998)

Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard: Two Classes of Boolean Functions for Dependency Analysis. Sci. Comput. Program. 31(1): 3-45 (1998)

Kim Marriott, Harald Søndergaard, Peter J. Stuckey: A Practical Object-Oriented Analysis Engine for CLP. Softw., Pract. Exper. 28(2): 199-224 (1998)

Tihomir Gabric, Kevin Glynn, Harald Søndergaard: Strictness Analysis as Finite-Domain Constraint Solving. LOPSTR 1998: 255-270

Michael Codish, Harald Søndergaard: The Boolean Logic of Set Sharing Analysis. PLILP/ALP 1998: 89-101

James Bailey, Lobel Crnogorac, Kotagiri Ramamohanarao, Harald Søndergaard: Abstract Interpretation of Active Rules and its Use in Termination Analysis. ICDT 1997: 188-202

Chris Speirs, Zoltan Somogyi, Harald Søndergaard: Termination Analysis for Mercury. SAS 1997: 160-171

Harald Søndergaard, A. John Hurst (Eds.): Proceedings of the ACM SIGCSE 2nd Australasian Conference on Computer Science Education, ACSE 1997, Melbourne, Victoria, Australia, 1997. ACM International Conference Proceeding Series 2, ACM 1997, isbn 0-89791-958-0

Roy Johnston, Alistair Moffat, Harald Søndergaard, Peter J. Stuckey: Low-contact learning in a first year programming course. ACSE 1996: 19-26

Harald Søndergaard: Immediate Fixpoints and Their Use in Groundness Analysis. FSTTCS 1996: 359-370

Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard: A Comparison of Three Occur-Check Analysers. SAS 1996: 159-173

Andrew D. Kelly, Kim Marriott, Harald Søndergaard, Peter J. Stuckey: Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs. SAS 1996: 385-386

Andrew D. Kelly, Andrew D. Macdonald, Kim Marriott, Harald Søndergaard, Peter J. Stuckey, Roland H. C. Yap: An Optimizing Compiler for CLP(R). CP 1995: 222-239

Kim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994)

Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard: Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. SAS 1994: 266-280

Kim Marriott, Harald Søndergaard: Precise and Efficient Groundness Analysis for Logic Programs. LOPLAS 2(1-4): 181-196 (1993)

Kim Marriott, Harald Søndergaard: Difference-List Transformation for Prolog. New Generation Comput. 11(2): 125-157 (1993)

Harald Søndergaard, Peter Sestoft: Non-Determinism in Functional Languages. Comput. J. 35(5): 514-523 (1992)

Kim Marriott, Harald Søndergaard: Bottom-Up Dataflow Analysis of Normal Logic Programs. J. Log. Program. 13(2&3): 181-204 (1992)

Kim Marriott, Harald Søndergaard: Analysis of Constraint Logic Programs. NACLP 1990: 531-547

Kim Marriott, Harald Søndergaard, Philip W. Dart: A Characterization of Non-Floundering Logic Programs. NACLP 1990: 661-680

Harald Søndergaard, Peter Sestoft: Referential Transparency, Definiteness and Unfoldability. Acta Inf. 27(6): 505-517 (1989)

Neil D. Jones, Peter Sestoft, Harald Søndergaard: Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. Lisp and Symbolic Computation 2(1): 9-50 (1989)

Kim Marriott, Harald Søndergaard: On prolog and the occur check problem. SIGPLAN Notices 24(5): 76-82 (1989)

Kim Marriott, Harald Søndergaard: Semantics-Based Dataflow Analysis of Logic Programs. IFIP Congress 1989: 601-606

Peter Sestoft, Harald Søndergaard: A bibliography on partial evaluation. SIGPLAN Notices 23(2): 19-26 (1988)

Kim Marriott, Harald Søndergaard: Bottom-up Abstract Interpretation of Logic Programs. ICLP/SLP 1988: 733-748

Neil D. Jones, Peter Sestoft, Harald Søndergaard: MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). MFPS 1987: 386-413

Harald Søndergaard: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. ESOP 1986: 327-338

Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140