Harald Søndergaard

According to our database1, Harald Søndergaard
  • authored at least 84 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Combining String Abstract Domains for JavaScript Analysis: An Evaluation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
A complete refinement procedure for regular separability of context-free languages.
Theor. Comput. Sci., 2016

An Abstract Domain of Uninterpreted Functions.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Exploiting Sparsity in Difference-Bound Matrices.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Generating source inputs for metamorphic testing using dynamic symbolic execution.
Proceedings of the 1st International Workshop on Metamorphic Testing, 2016

A Bit-Vector Solver with Word-Level Propagation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Compositional Symbolic Execution: Incremental Solving Revisited.
Proceedings of the 23rd Asia-Pacific Software Engineering Conference, 2016

2015
Horn clauses as an intermediate representation for program analysis and transformation.
TPLP, 2015

Horn Clauses as an Intermediate Representation for Program Analysis and Transformation.
CoRR, 2015

A Tool for Intersecting Context-Free Grammars and Its Applications.
Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Optimisation and Relaxation for Multiagent Planning in the Situation Calculus.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Compositional Symbolic Execution Using Fine-Grained Summaries.
Proceedings of the 24th Australasian Software Engineering Conference, 2015

Using Metamorphic Testing to Improve Dynamic Symbolic Execution.
Proceedings of the 24th Australasian Software Engineering Conference, 2015

2014
Truth versus information in logic programming.
TPLP, 2014

Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.
ACM Trans. Program. Lang. Syst., 2014

Synthesizing Optimal Switching Lattices.
ACM Trans. Design Autom. Electr. Syst., 2014

Four-Valued Reasoning and Cyclic Circuits.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2014

A Complete Refinement Procedure for Regular Separability of Context-Free Languages.
CoRR, 2014

A Partial-Order Approach to Array Content Analysis.
CoRR, 2014

Analyzing Array Manipulating Programs by Program Transformation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Fragment-Based Planning Using Column Generation.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Failure tabled constraint logic programming by interpolation.
TPLP, 2013

Truth versus information in logic programming
CoRR, 2013

Unbounded Model-Checking with Interpolation for Regular Language Constraints.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Abstract Interpretation over Non-lattice Abstract Domains.
Proceedings of the Static Analysis - 20th International Symposium, 2013

A low overhead method for recovering unused memory inside regions.
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

Solving Difference Constraints over Modular Arithmetic.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
Collaborative learning through formative peer review: pedagogy, programs and potential.
Computer Science Education, 2012

Towards region-based memory management for Go.
Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012

Logic Programming: From Underspecification to Undefinedness.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2010
An Algorithm for Affine Approximation of Binary Decision Diagrams.
Chicago J. Theor. Comput. Sci., 2010

Information loss in knowledge compilation: A comparison of Boolean envelopes.
Artif. Intell., 2010

Automatic Abstraction for Congruences.
Proceedings of the Verification, 2010

2009
State Joining and Splitting for the Symbolic Execution of Binaries.
Proceedings of the Runtime Verification, 9th International Workshop, 2009

Learning from and with peers: the different roles of student peer reviewing.
Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2009

Boolean Affine Approximation with Binary Decision Diagrams.
Proceedings of the Theory of Computing 2009, 2009

2008
Binary Decision Diagrams for Affine Approximation
CoRR, 2008

Inferring Congruence Equations Using SAT.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007
Un-Kleene Boolean equation Solving.
Int. J. Found. Comput. Sci., 2007

Boolean Approximation Revisited.
Proceedings of the Abstraction, 2007

2006
Closure Operators for ROBDDs.
Proceedings of the Verification, 2006

Boolean equation solving as graph traversal.
Proceedings of the Theory of Computing 2006, 2006

2005
Making Connections: First Year Transition for Computer Science and Software Engineering Students.
Proceedings of the Seventh Australasian Computing Education Conference (ACE 2005), 2005

2004
What Drives Curriculum Change?
Proceedings of the Sixth Australasian Computing Education Conference (ACE 2004), 2004

2002
Exception analysis for non-strict languages.
Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Meta-circular Abstract Interpretation in Prolog.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
A Constructivist Approach to Communication Skills Instruction in Computer Science.
Computer Science Education, 2001

Boolean Constraints for Binding-Time Analysis.
Proceedings of the Programs as Data Objects, Second Symposium, 2001

Higher-Precision Groundness Analysis.
Proceedings of the Logic Programming, 17th International Conference, 2001

2000
Transforming Communication Skills Instruction: The Conference Approach.
Proceedings of the 23rd Australasian Computer Science Conference (ACSC 2000), 31 January, 2000

1999
Sharing and groundness dependencies in logic programs.
ACM Trans. Program. Lang. Syst., 1999

A strategy for managing content complexity in algorithm animation.
Proceedings of the 4th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 1999

1998
A Practical Object-Oriented Analysis Engine for CLP.
Softw., Pract. Exper., 1998

Two Classes of Boolean Functions for Dependency Analysis.
Sci. Comput. Program., 1998

Differential Methods in Logic Program Analysis.
J. Log. Program., 1998

The Boolean Logic of Set Sharing Analysis.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Strictness Analysis as Finite-Domain Constraint Solving.
Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997
Termination Analysis for Mercury.
Proceedings of the Static Analysis, 4th International Symposium, 1997

Abstract Interpretation of Active Rules and its Use in Termination Analysis.
Proceedings of the Database Theory, 1997

1996
Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs.
Proceedings of the Static Analysis, Third International Symposium, 1996

A Comparison of Three Occur-Check Analysers.
Proceedings of the Static Analysis, Third International Symposium, 1996

Immediate Fixpoints and Their Use in Groundness Analysis.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Low-contact learning in a first year programming course.
Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1995
An Optimizing Compiler for CLP(R).
Proceedings of the Principles and Practice of Constraint Programming, 1995

1994
Denotational Abstract Interpretation of Logic Programs.
ACM Trans. Program. Lang. Syst., 1994

Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation.
SAS, 1994

1993
Difference-List Transformation for Prolog.
New Generation Comput., 1993

Precise and Efficient Groundness Analysis for Logic Programs.
LOPLAS, 1993

1992
Bottom-Up Dataflow Analysis of Normal Logic Programs.
J. Log. Program., 1992

Non-Determinism in Functional Languages.
Comput. J., 1992

1990
Referential Transparency, Definiteness and Unfoldability.
Acta Inf., 1990

A Characterization of Non-Floundering Logic Programs.
Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

Analysis of Constraint Logic Programs.
Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

1989
On prolog and the occur check problem.
SIGPLAN Notices, 1989

Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation.
Lisp and Symbolic Computation, 1989

Semantics-Based Dataflow Analysis of Logic Programs.
IFIP Congress, 1989

1988
A bibliography on partial evaluation.
SIGPLAN Notices, 1988

Bottom-up Abstract Interpretation of Logic Programs.
Proceedings of the Logic Programming, 1988

1987
MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract).
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1986
An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.
Proceedings of the ESOP 86, 1986

1985
An experiment in partial evaluation: the generation of a compiler generator.
SIGPLAN Notices, 1985

An Experiment in Partial Evaluation: The Generation of a Compiler Generator.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985


  Loading...