The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Harald Søndergaard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Harald Søndergaard, Peter Sestoft
    Non-Determinism in Functional Languages. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1992, v:35, n:5, pp:514-523 [Journal]
  2. Kim Marriott, Harald Søndergaard, Neil D. Jones
    Denotational Abstract Interpretation of Logic Programs. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:607-648 [Journal]
  3. Paul Gruba, Alistair Moffat, Harald Søndergaard, Justin Zobel
    What Drives Curriculum Change? [Citation Graph (0, 0)][DBLP]
    ACE, 2004, pp:109-117 [Conf]
  4. Alistair Moffat, Baden Hughes, Harald Søndergaard, Paul Gruba
    Making Connections: First Year Transition for Computer Science and Software Engineering Students. [Citation Graph (0, 0)][DBLP]
    ACE, 2005, pp:229-238 [Conf]
  5. Paul Gruba, Harald Søndergaard
    Transforming Communication Skills Instruction: The Conference Approach. [Citation Graph (0, 0)][DBLP]
    ACSC, 2000, pp:88-94 [Conf]
  6. Michael Codish, Harald Søndergaard
    Meta-circular Abstract Interpretation in Prolog. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:109-134 [Conf]
  7. Andrew D. Kelly, Andrew D. Macdonald, Kim Marriott, Harald Søndergaard, Peter J. Stuckey, Roland H. C. Yap
    An Optimizing Compiler for CLP(R). [Citation Graph (0, 0)][DBLP]
    CP, 1995, pp:222-239 [Conf]
  8. Harald Søndergaard
    An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction. [Citation Graph (0, 0)][DBLP]
    ESOP, 1986, pp:327-338 [Conf]
  9. Harald Søndergaard
    Immediate Fixpoints and Their Use in Groundness Analysis. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:359-370 [Conf]
  10. James Bailey, Lobel Crnogorac, Kotagiri Ramamohanarao, Harald Søndergaard
    Abstract Interpretation of Active Rules and its Use in Termination Analysis. [Citation Graph (0, 11)][DBLP]
    ICDT, 1997, pp:188-202 [Conf]
  11. Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard
    Exception analysis for non-strict languages. [Citation Graph (0, 0)][DBLP]
    ICFP, 2002, pp:98-109 [Conf]
  12. Michael Codish, Samir Genaim, Harald Søndergaard, Peter J. Stuckey
    Higher-Precision Groundness Analysis. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:135-149 [Conf]
  13. Kim Marriott, Harald Søndergaard
    Bottom-up Abstract Interpretation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICLP/SLP, 1988, pp:733-748 [Conf]
  14. Kim Marriott, Harald Søndergaard
    Semantics-Based Dataflow Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:601-606 [Conf]
  15. Tihomir Gabric, Kevin Glynn, Harald Søndergaard
    Strictness Analysis as Finite-Domain Constraint Solving. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1998, pp:255-270 [Conf]
  16. Neil D. Jones, Peter Sestoft, Harald Søndergaard
    MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFPS, 1987, pp:386-413 [Conf]
  17. Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, Harald Søndergaard
    Boolean Constraints for Binding-Time Analysis. [Citation Graph (0, 0)][DBLP]
    PADO, 2001, pp:39-62 [Conf]
  18. Michael Codish, Harald Søndergaard
    The Boolean Logic of Set Sharing Analysis. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:89-101 [Conf]
  19. Neil D. Jones, Peter Sestoft, Harald Søndergaard
    An Experiment in Partial Evaluation: The Generation of a Compiler Generator. [Citation Graph (0, 0)][DBLP]
    RTA, 1985, pp:124-140 [Conf]
  20. Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard
    Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation. [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:266-280 [Conf]
  21. Lobel Crnogorac, Andrew D. Kelly, Harald Søndergaard
    A Comparison of Three Occur-Check Analysers. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:159-173 [Conf]
  22. Andrew D. Kelly, Kim Marriott, Harald Søndergaard, Peter J. Stuckey
    Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:385-386 [Conf]
  23. Chris Speirs, Zoltan Somogyi, Harald Søndergaard
    Termination Analysis for Mercury. [Citation Graph (0, 0)][DBLP]
    SAS, 1997, pp:160-171 [Conf]
  24. Kim Marriott, Harald Søndergaard
    Analysis of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    NACLP, 1990, pp:531-547 [Conf]
  25. Kim Marriott, Harald Søndergaard, Philip W. Dart
    A Characterization of Non-Floundering Logic Programs. [Citation Graph (0, 0)][DBLP]
    NACLP, 1990, pp:661-680 [Conf]
  26. Peter Schachte, Harald Søndergaard
    Closure Operators for ROBDDs. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2006, pp:1-16 [Conf]
  27. Harald Søndergaard, Peter Sestoft
    Referential Transparency, Definiteness and Unfoldability. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:27, n:6, pp:505-517 [Journal]
  28. Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey, Harald Søndergaard
    Differential Methods in Logic Program Analysis. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1998, v:35, n:1, pp:1-37 [Journal]
  29. Kim Marriott, Harald Søndergaard
    Bottom-Up Dataflow Analysis of Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:13, n:2&3, pp:181-204 [Journal]
  30. Neil D. Jones, Peter Sestoft, Harald Søndergaard
    Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation. [Citation Graph (0, 0)][DBLP]
    Lisp and Symbolic Computation, 1989, v:2, n:1, pp:9-50 [Journal]
  31. Kim Marriott, Harald Søndergaard
    Precise and Efficient Groundness Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    LOPLAS, 1993, v:2, n:1-4, pp:181-196 [Journal]
  32. Kim Marriott, Harald Søndergaard
    Difference-List Transformation for Prolog. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1993, v:11, n:2, pp:125-157 [Journal]
  33. Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard
    Two Classes of Boolean Functions for Dependency Analysis. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1998, v:31, n:1, pp:3-45 [Journal]
  34. Kim Marriott, Harald Søndergaard
    On prolog and the occur check problem. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1989, v:24, n:5, pp:76-82 [Journal]
  35. Peter Sestoft, Harald Søndergaard
    A bibliography on partial evaluation. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1988, v:23, n:2, pp:19-26 [Journal]
  36. Kim Marriott, Harald Søndergaard, Peter J. Stuckey
    A Practical Object-Oriented Analysis Engine for CLP. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:2, pp:199-224 [Journal]
  37. Michael Codish, Harald Søndergaard, Peter J. Stuckey
    Sharing and groundness dependencies in logic programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:5, pp:948-976 [Journal]
  38. Peter Schachte, Harald Søndergaard
    Boolean Approximation Revisited. [Citation Graph (0, 0)][DBLP]
    SARA, 2007, pp:329-343 [Conf]

  39. Boolean equation solving as graph traversal. [Citation Graph (, )][DBLP]


  40. Inferring Congruence Equations Using SAT. [Citation Graph (, )][DBLP]


  41. Automatic Abstraction for Congruences. [Citation Graph (, )][DBLP]


  42. Learning from and with peers: the different roles of student peer reviewing. [Citation Graph (, )][DBLP]


  43. A strategy for managing content complexity in algorithm animation. [Citation Graph (, )][DBLP]


  44. State Joining and Splitting for the Symbolic Execution of Binaries. [Citation Graph (, )][DBLP]


  45. Low-contact learning in a first year programming course. [Citation Graph (, )][DBLP]


  46. Information loss in knowledge compilation: A comparison of Boolean envelopes. [Citation Graph (, )][DBLP]


  47. Binary Decision Diagrams for Affine Approximation [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002