Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Harald Søndergaard
2010 – today
- 2013
[c39]Graeme Gange, Harald Søndergaard, Peter J. Stuckey, Peter Schachte: Solving Difference Constraints over Modular Arithmetic. CADE 2013: 215-230
[c38]Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey: Abstract Interpretation over Non-lattice Abstract Domains. SAS 2013: 6-24
[c37]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
[i2]Lee Naish, Harald Søndergaard: Truth versus information in logic programming. CoRR abs/1305.0141 (2013)- 2012
[c36]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
[c35]Lee Naish, Harald Søndergaard, Benjamin Horsfall: Logic Programming: From Underspecification to Undefinedness. CATS 2012: 49-58
[c34]Matthew Davis, Peter Schachte, Zoltan Somogyi, Harald Søndergaard: Towards region-based memory management for Go. MSPC 2012: 58-67- 2010
[j16]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)
[j15]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)
[c33]
2000 – 2009
- 2009
[c32]Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Boolean Affine Approximation with Binary Decision Diagrams. CATS 2009: 119-127
[c31]Harald Søndergaard: Learning from and with peers: the different roles of student peer reviewing. ITiCSE 2009: 31-35
[c30]Trevor Hansen, Peter Schachte, Harald Søndergaard: State Joining and Splitting for the Symbolic Execution of Binaries. RV 2009: 76-92- 2008
[c29]
[i1]Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: Binary Decision Diagrams for Affine Approximation. CoRR abs/0804.0066 (2008)- 2007
[j14]Brian Herlihy, Peter Schachte, Harald Søndergaard: Un-Kleene Boolean equation Solving. Int. J. Found. Comput. Sci. 18(2): 227-250 (2007)
[c28]- 2006
[c27]Brian Herlihy, Peter Schachte, Harald Søndergaard: Boolean equation solving as graph traversal. CATS 2006: 123-132
[c26]- 2005
[c25]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
[c24]Paul Gruba, Alistair Moffat, Harald Søndergaard, Justin Zobel: What Drives Curriculum Change? ACE 2004: 109-117- 2002
[c23]Michael Codish, Harald Søndergaard: Meta-circular Abstract Interpretation in Prolog. The Essence of Computation 2002: 109-134
[c22]Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Exception analysis for non-strict languages. ICFP 2002: 98-109- 2001
[c21]Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey: Higher-Precision Groundness Analysis. ICLP 2001: 135-149
[c20]Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard: Boolean Constraints for Binding-Time Analysis. PADO 2001: 39-62- 2000
[c19]Paul Gruba, Harald Søndergaard: Transforming Communication Skills Instruction: The Conference Approach. ACSC 2000: 88-94
1990 – 1999
- 1999
[j13]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)
[c18]Linda Stern, Harald Søndergaard, Lee Naish: A strategy for managing content complexity in algorithm animation. ITiCSE 1999: 127-130- 1998
[j12]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)
[j11]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)
[j10]Kim Marriott, Harald Søndergaard, Peter J. Stuckey: A Practical Object-Oriented Analysis Engine for CLP. Softw., Pract. Exper. 28(2): 199-224 (1998)
[c17]Tihomir Gabric, Kevin Glynn, Harald Søndergaard: Strictness Analysis as Finite-Domain Constraint Solving. LOPSTR 1998: 255-270
[c16]Michael Codish, Harald Søndergaard: The Boolean Logic of Set Sharing Analysis. PLILP/ALP 1998: 89-101- 1997
[c15]James Bailey, Lobel Crnogorac, Kotagiri Ramamohanarao, Harald Søndergaard: Abstract Interpretation of Active Rules and its Use in Termination Analysis. ICDT 1997: 188-202
[c14]Chris Speirs, Zoltan Somogyi, Harald Søndergaard: Termination Analysis for Mercury. SAS 1997: 160-171
[e1]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- 1996
[c13]Roy Johnston, Alistair Moffat, Harald Søndergaard, Peter J. Stuckey: Low-contact learning in a first year programming course. ACSE 1996: 19-26
[c12]
[c11]Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard: A Comparison of Three Occur-Check Analysers. SAS 1996: 159-173
[c10]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
[c9]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
[j9]Kim Marriott, Harald Søndergaard, Neil D. Jones: Denotational Abstract Interpretation of Logic Programs. ACM Trans. Program. Lang. Syst. 16(3): 607-648 (1994)
[c8]Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard: Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. SAS 1994: 266-280- 1993
[j8]Kim Marriott, Harald Søndergaard: Precise and Efficient Groundness Analysis for Logic Programs. LOPLAS 2(1-4): 181-196 (1993)
[j7]Kim Marriott, Harald Søndergaard: Difference-List Transformation for Prolog. New Generation Comput. 11(2): 125-157 (1993)- 1992
[j6]Harald Søndergaard, Peter Sestoft: Non-Determinism in Functional Languages. Comput. J. 35(5): 514-523 (1992)
[j5]Kim Marriott, Harald Søndergaard: Bottom-Up Dataflow Analysis of Normal Logic Programs. J. Log. Program. 13(2&3): 181-204 (1992)- 1990
[c7]
[c6]Kim Marriott, Harald Søndergaard, Philip W. Dart: A Characterization of Non-Floundering Logic Programs. NACLP 1990: 661-680
1980 – 1989
- 1989
[j4]Harald Søndergaard, Peter Sestoft: Referential Transparency, Definiteness and Unfoldability. Acta Inf. 27(6): 505-517 (1989)
[j3]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)
[j2]Kim Marriott, Harald Søndergaard: On prolog and the occur check problem. SIGPLAN Notices 24(5): 76-82 (1989)
[c5]Kim Marriott, Harald Søndergaard: Semantics-Based Dataflow Analysis of Logic Programs. IFIP Congress 1989: 601-606- 1988
[j1]Peter Sestoft, Harald Søndergaard: A bibliography on partial evaluation. SIGPLAN Notices 23(2): 19-26 (1988)
[c4]Kim Marriott, Harald Søndergaard: Bottom-up Abstract Interpretation of Logic Programs. ICLP/SLP 1988: 733-748- 1987
[c3]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
[c2]Harald Søndergaard: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. ESOP 1986: 327-338- 1985
[c1]Neil D. Jones, Peter Sestoft, Harald Søndergaard: An Experiment in Partial Evaluation: The Generation of a Compiler Generator. RTA 1985: 124-140
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team



