![]() | 2010 | |
---|---|---|
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Andy King, Harald Søndergaard: Automatic Abstraction for Congruences. VMCAI 2010: 197-213 |
2009 | ||
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard: Learning from and with peers: the different roles of student peer reviewing. ITiCSE 2009: 31-35 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Trevor Hansen, Peter Schachte, Harald Søndergaard: State Joining and Splitting for the Symbolic Execution of Binaries. RV 2009: 76-92 |
2008 | ||
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Andy King, Harald Søndergaard: Inferring Congruence Equations Using SAT. CAV 2008: 281-293 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Binary Decision Diagrams for Affine Approximation CoRR abs/0804.0066: (2008) |
2007 | ||
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Schachte, Harald Søndergaard: Boolean Approximation Revisited. SARA 2007: 329-343 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Brian Herlihy, Peter Schachte, Harald Søndergaard: Un-Kleene Boolean equation Solving. Int. J. Found. Comput. Sci. 18(2): 227-250 (2007) |
2006 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Brian Herlihy, Peter Schachte, Harald Søndergaard: Boolean equation solving as graph traversal. CATS 2006: 123-132 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Schachte, Harald Søndergaard: Closure Operators for ROBDDs. VMCAI 2006: 1-16 |
2005 | ||
39 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
2004 | ||
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Gruba, Alistair Moffat, Harald Søndergaard, Justin Zobel: What Drives Curriculum Change? ACE 2004: 109-117 |
2002 | ||
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Exception analysis for non-strict languages. ICFP 2002: 98-109 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Harald Søndergaard: Meta-circular Abstract Interpretation in Prolog. The Essence of Computation 2002: 109-134 |
2001 | ||
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Boolean Constraints for Binding-Time Analysis. PADO 2001: 39-62 |
2000 | ||
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul Gruba, Harald Søndergaard: Transforming Communication Skills Instruction: The Conference Approach. ACSC 2000: 88-94 |
1999 | ||
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Linda Stern, Harald Søndergaard, Lee Naish: A strategy for managing content complexity in algorithm animation. ITiCSE 1999: 127-130 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
1998 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Tihomir Gabric, Kevin Glynn, Harald Søndergaard: Strictness Analysis as Finite-Domain Constraint Solving. LOPSTR 1998: 255-270 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Codish, Harald Søndergaard: The Boolean Logic of Set Sharing Analysis. PLILP/ALP 1998: 89-101 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard, Peter J. Stuckey: A Practical Object-Oriented Analysis Engine for CLP. Softw., Pract. Exper. 28(2): 199-224 (1998) |
1997 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard, A. John Hurst: Proceedings of the ACM SIGCSE 2nd Australasian Conference on Computer Science Education, ACSE 1997, Melbourne, Victoria, Australia, 1997 ACM 1997 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | James Bailey, Lobel Crnogorac, Kotagiri Ramamohanarao, Harald Søndergaard: Abstract Interpretation of Active Rules and its Use in Termination Analysis. ICDT 1997: 188-202 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Chris Speirs, Zoltan Somogyi, Harald Søndergaard: Termination Analysis for Mercury. SAS 1997: 160-171 |
1996 | ||
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Roy Johnston, Alistair Moffat, Harald Søndergaard, Peter J. Stuckey: Low-contact learning in a first year programming course. ACSE 1996: 19-26 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard: Immediate Fixpoints and Their Use in Groundness Analysis. FSTTCS 1996: 359-370 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard: A Comparison of Three Occur-Check Analysers. SAS 1996: 159-173 |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
1995 | ||
18 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
1994 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard: Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. SAS 1994: 266-280 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994) |
1993 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Precise and Efficient Groundness Analysis for Logic Programs. LOPLAS 2(1-4): 181-196 (1993) |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Difference-List Transformation for Prolog. New Generation Comput. 11(2): 125-157 (1993) |
1992 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard, Peter Sestoft: Non-Determinism in Functional Languages. Comput. J. 35(5): 514-523 (1992) |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Bottom-Up Dataflow Analysis of Normal Logic Programs. J. Log. Program. 13(2&3): 181-204 (1992) |
1990 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Analysis of Constraint Logic Programs. NACLP 1990: 531-547 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard, Philip W. Dart: A Characterization of Non-Floundering Logic Programs. NACLP 1990: 661-680 |
1989 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Semantics-Based Dataflow Analysis of Logic Programs. IFIP Congress 1989: 601-606 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard, Peter Sestoft: Referential Transparency, Definiteness and Unfoldability. Acta Inf. 27(6): 505-517 (1989) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: On prolog and the occur check problem. SIGPLAN Notices 24(5): 76-82 (1989) |
1988 | ||
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Kim Marriott, Harald Søndergaard: Bottom-up Abstract Interpretation of Logic Programs. ICLP/SLP 1988: 733-748 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Peter Sestoft, Harald Søndergaard: A bibliography on partial evaluation. SIGPLAN Notices 23(2): 19-26 (1988) |
1987 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
1986 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Harald Søndergaard: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. ESOP 1986: 327-338 |
1985 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140 |