Person: Harald Søndergaard

DBLP: S=oslash=ndergaard:Harald

Contributed to:

2015

2014

2013

2013

2013

2013

2010

2009

2008

2006

2002

2001

1999

1998

1998

1997

1996

1994

1990

1988

1986

1985

2017

Wrote 25 papers:

ICLP-J-2015-GangeNSSS #horn clause #program analysis #program transformation #representation

Horn clauses as an intermediate representation for program analysis and transformation (GG, JAN, PS, HS, PJS), pp. 526–542.

LOPSTR-2014-CornishGNSSS #array #program transformation #source code

Analyzing Array Manipulating Programs by Program Transformation (JRMC, GG, JAN, PS, HS, PJS), pp. 3–20.

CADE-2013-GangeSSS #composition #constraints #difference

Solving Difference Constraints over Modular Arithmetic (GG, HS, PJS, PS), pp. 215–230.

ICLP-J-2013-GangeNSSS #constraints #logic programming

Failure tabled constraint logic programming by interpolation (GG, JAN, PS, HS, PJS), pp. 593–607.

SAS-2013-GangeNSSS #abstract domain #abstract interpretation

Abstract Interpretation over Non-lattice Abstract Domains (GG, JAN, PS, HS, PJS), pp. 6–24.

TACAS-2013-GangeNSSS #bound #constraints #model checking #regular expression

Unbounded Model-Checking with Interpolation for Regular Language Constraints (GG, JAN, PJS, HS, PS), pp. 277–291.

VMCAI-2010-KingS #abstraction #automation

Automatic Abstraction for Congruences (AK, HS), pp. 197–213.

ITiCSE-2009-Sondergaard #learning #student

Learning from and with peers: the different roles of student peer reviewing (HS), pp. 31–35.

CAV-2008-KingS #congruence #equation #satisfiability #using

Inferring Congruence Equations Using SAT (AK, HS), pp. 281–293.

VMCAI-2006-SchachteS

Closure Operators for ROBDDs (PS, HS), pp. 1–16.

ICFP-2002-GlynnSSS #analysis #exception #strict

Exception analysis for non-strict languages (KG, PJS, MS, HS), pp. 98–109.

ICLP-2001-CodishGSS #analysis

Higher-Precision Groundness Analysis (MC, SG, HS, PJS), pp. 135–149.

ITiCSE-1999-SternSN #algorithm #animation #complexity

A strategy for managing content complexity in algorithm animation (LS, HS, LN), pp. 127–130.

ALP-PLILP-1998-CodishS #analysis #logic #set

The Boolean Logic of Set Sharing Analysis (MC, HS), pp. 89–101.

LOPSTR-1998-GabricGS #analysis #constraints #strict #theorem proving

Strictness Analysis as Finite-Domain Constraint Solving (TG, KG, HS), pp. 255–270.

SAS-1997-SpeirsSS #analysis #termination

Termination Analysis for Mercury (CS, ZS, HS), pp. 160–171.

SAS-1996-CrnogoracKS #comparison

A Comparison of Three Occur-Check Analysers (LC, ADK, HS), pp. 159–173.

SAS-1996-KellyMSS #analysis #constraints #incremental #logic programming #source code

Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (ADK, KM, HS, PJS), pp. 385–386.

SAS-1994-ArmstrongMSS #algebra #analysis #dependence #performance #representation

Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation (TA, KM, PS, HS), pp. 266–280.

NACLP-1990-MarriottS #analysis #constraints #logic programming #source code

Analysis of Constraint Logic Programs (KM, HS), pp. 531–547.

NACLP-1990-MarriottSD #logic programming #source code

A Characterization of Non-Floundering Logic Programs (KM, HS, PWD), pp. 661–680.

JICSCP-1988-MarriottS88 #abstract interpretation #bottom-up #logic programming #source code

Bottom-up Abstract Interpretation of Logic Programs (KM, HS), pp. 733–748.

ESOP-1986-Sondergaard #abstract interpretation #logic programming #reduction #source code

An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction (HS), pp. 327–338.

RTA-1985-JonesSS #compilation #empirical #generative #partial evaluation

An Experiment in Partial Evaluation: The Generation of a Compiler Generator (NDJ, PS, HS), pp. 124–140.

ASE-2017-AlatawiSM #abstract interpretation #execution #performance #symbolic computation

Leveraging abstract interpretation for efficient dynamic symbolic execution (EA, HS, TM0), pp. 619–624.