ÆÈ·Î¿ì
Harald S©ªndergaard
Harald S©ªndergaard
Computing and Information Systems, The University of Melbourne
unimelb.edu.auÀÇ À̸ÞÀÏ È®ÀÎµÊ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
Mix: A self-applicable partial evaluator for experiments in compiler generation
ND Jones, P Sestoft, H S©ªndergaard
Lisp and Symbolic Computation 2 (1), 9-50, 1989
4261989
An experiment in partial evaluation: The generation of a compiler generator
N Jones, P Sestoft, H S©ªndergaard
Rewriting techniques and applications, 124-140, 1985
3601985
An application of abstract interpretation of logic programs: Occur check reduction
H S©ªndergaard
ESOP 86, 327-338, 1986
1741986
A semantics-based framework for the abstract interpretation of Prolog
ND Jones, H S©ªndergaard
S. Abramsky and C. Hankin (eds), Abstract Interpretation of Declarative ¡¦, 1987
1711987
Precise and efficient groundness analysis for logic programs
K Marriott, H S©ªndergaard
ACM Letters on Programming Languages and Systems 2 (1-4), 181-196, 1993
1591993
Referential transparency, definiteness and unfoldability
H S©ªndergaard, P Sestoft
Acta Informatica 27, 505-517, 1990
1291990
Denotational abstract interpretation of logic programs
K Marriott, H S©ªndergaard, ND Jones
ACM Transactions on Programming Languages and Systems (TOPLAS) 16 (3), 607-648, 1994
1271994
Non-determinism in functional languages
H S©ªndergaard, P Sestoft
The Computer Journal 35 (5), 514-523, 1992
1271992
Two classes of Boolean functions for dependency analysis
T Armstrong, K Marriott, P Schachte, H S©ªndergaard
Science of Computer Programming 31 (1), 3-45, 1998
1261998
Collaborative learning through formative peer review: Pedagogy, programs and potential
H S©ªndergaard, RA Mulder
Computer Science Education 22 (4), 343-367, 2012
982012
Boolean functions for dependency analysis: Algebraic properties and efficient representation
T Armstrong, K Marriott, P Schachte, H S©ªndergaard
Static Analysis: First International Static Analysis Symposium, SAS'94 Namur ¡¦, 1994
961994
Bottom-up abstract interpretation of logic programs
K Marriott, H S©ªndergaard
ICLP/SLP, 733-748, 1988
961988
State joining and splitting for the symbolic execution of binaries
T Hansen, P Schachte, H S©ªndergaard
RV 9, 76-92, 2009
872009
Semantics-based dataflow analysis of logic programs
K Marriott, H S©ªndergaard
IFIP Congress, 601-606, 1989
791989
What drives curriculum change?
P Gruba, A Moffat, H S©ªndergaard, J Zobel
Proceedings of the Sixth Conference on Australasian Computing Education ¡¦, 2004
782004
Analysis of constraint logic programs
K Marriott, H S©ªndergaard
Proceedings of the 1990 North American Conference on Logic Programing, 531-547, 1990
781990
Termination analysis for Mercury
C Speirs, Z Somogyi, H S©ªndergaard
Static Analysis: 4th International Symposium, SAS'97 Paris, France ¡¦, 1997
661997
A strategy for managing content complexity in algorithm animation
L Stern, H S©ªndergaard, L Naish
ACM SIGCSE Bulletin 31 (3), 127-130, 1999
601999
Sharing and groundness dependencies in logic programs
M Codish, H S©ªndergaard, PJ Stuckey
ACM Transactions on Programming Languages and Systems (TOPLAS) 21 (5), 948-976, 1999
561999
Notes for a tutorial on abstract interpretation of logic programs
K Marriott, H S©ªndergaard
North American Conference on Logic Programming, Cleveland, Ohio, USA, 1989
541989
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20