Harald Sondergaard

Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation

W Wang, H Søndergaard, PJ Stuckey

Journal article  |  2019  |  Journal of Automated Reasoning

We develop an idea originally proposed by Michel and Van Hentenryck of how to perform bit-vector constraint propagation on the wor..

Optimal Bounds for Floating-Point Addition in Constant Time

Mak Andrlon, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Conference Proceedings  |  2019  |  2019 IEEE 26th Symposium on Computer Arithmetic (ARITH)

Reasoning about floating-point numbers is notoriously difficult, owing to the lack of convenient algebraic properties such as asso..

Dissecting widening: Separating termination from information

G Gange, JA Navas, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2019  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Constraint Programming for Dynamic Symbolic Execution of JavaScript

R Amadini, M Andrlon, G Gange, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2019  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

© 2019, Springer Nature Switzerland AG. Dynamic Symbolic Execution (DSE) combines concrete and symbolic execution, usually for the..

An iterative approach to precondition inference using constrained Horn clauses

Bishoksan Kafle, John P Gallagher, Graeme Gange, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Journal article  |  2018  |  Theory and Practice of Logic Programming

Reference Abstract Domains and Applications to String Analysis

Roberto Amadini, Graeme Gange, Francois Gauthier, Alexander Jordan, Peter Schachte, Harald Sondergaard, Peter J Stuckey, Chenyi Zhang

Journal article  |  2018  |  Fundamenta Informaticae

Symbolic Execution with Invariant Inlay: Evaluating the Potential

Eman Alatawi, Tim Miller, Harald Sondergaard

Conference Proceedings  |  2018  |  2018 25th Australasian Software Engineering Conference (ASWEC)

Making sense of a learning management system's quiz analytics in understanding students' learning difficulties

A Mendoza, H Sondergaard, A Venables

Conference Proceedings  |  2017

Combining String Abstract Domains for JavaScript Analysis: An Evaluation

Roberto Amadini, Alexander Jordan, Graeme Gange, Francois Gauthier, Peter Schachte, Harald Sondergaard, Peter J Stuckey, Chenyi Zhang

Conference Proceedings  |  2017  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A benders decomposition approach to deciding modular linear integer arithmetic

B Kafle, G Gange, P Schachte, H Søndergaard, PJ Stuckey

Conference Proceedings  |  2017  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

© Springer International Publishing AG 2017. Verification tasks frequently require deciding systems of linear constraints over mod..

Leveraging abstract interpretation for efficient dynamic symbolic execution

E Alatawi, H Sondergaard, T Miller

Conference Proceedings  |  2017  |  2017 32nd IEEE/ACM International Conference on Automated Software Engineering (ASE)

Dynamic Symbolic Execution (DSE) is a technique to automatically generate test inputs by executing a program with concrete and sym..

A complete refinement procedure for regular separability of context-free languages

Graeme Gange, Jorge A Navas, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Journal article  |  2016  |  Theoretical Computer Science

A bit-vector solver with word-level propagation

W Wang, H SONDERGAARD, P Stuckey

Conference Proceedings  |  2016  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have p..

An abstract domain of uninterpreted functions

G Gange, J Navas Laserna, P Schachte, H SONDERGAARD, P Stuckey

Conference Proceedings  |  2016  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Exploiting Sparsity in Difference-Bound Matrices

G Gange, J Navas, P Schachte, H SONDERGAARD, P Stuckey

Conference Proceedings  |  2016  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Compositional Symbolic Execution: Incremental Solving Revisited

Y Lin, T Miller, H SONDERGAARD

Conference Proceedings  |  2016  |  2016 23rd Asia-Pacific Software Engineering Conference (APSEC)

Generating source inputs for metamorphic testing using dynamic symbolic execution

E Alatawi, T Miller, H SONDERGAARD

Conference Proceedings  |  2016  |  Proceedings of the 1st International Workshop on Metamorphic Testing - MET '16

Using metamorphic testing to improve dynamic symbolic execution

E Alatawi, T Miller, H SONDERGAARD

Conference Proceedings  |  2015  |  2015 24th Australasian Software Engineering Conference

Analyzing Array Manipulating Programs by Program Transformation

JRM Cornish, G Gange, JA Navas, P Schachte, H SONDERGAARD, PJ Stuckey

Conference Proceedings  |  2015  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss

G Gange, JA Navas, P Schachte, H Sondergaard, PJ Stuckey

Journal article  |  2015  |  ACM Transactions on Programming Languages and Systems

Optimisation and Relaxation for Multiagent Planning in the Situation Calculus

TO Davies, AR Pearce, PJ Stuckey, H SONDERGAARD

Conference Proceedings  |  2015  |  Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Compositional symbolic execution using fine-grained summaries

Y Lin, T Miller, H SONDERGAARD

Conference Proceedings  |  2015  |  2015 24th Australasian Software Engineering Conference

Horn Clauses As an Intermediate Representation for Program Analysis and Transformation

G Gange, J Navas Laserna, P Schachte, H SONDERGAARD, PJ Stuckey

Journal article  |  2015  |  Theory and Practice of Logic Programming

A tool for intersecting context-free grammars and its applications

G Gange, JA Navas, P Schachte, H Sondergaard, PJ Stuckey

Conference Proceedings  |  2015  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Synthesizing Optimal Switching Lattices

Graeme Gange, Harald Søndergaard, Peter J Stuckey

Journal article  |  2014  |  ACM Transactions on Design Automation of Electronic Systems

Truth versus information in logic programming

Lee Naish, Harald Sondergaard

Journal article  |  2014  |  Theory and Practice of Logic Programming

Four-Valued Reasoning and Cyclic Circuits

Graeme Gange, Benjamin Horsfall, Lee Naish, Harald Sondergaard

Journal article  |  2014  |  IEEE Transactions on Computer - Aided Design of Integrated Circuits and Systems

Fragment-Based Planning Using Column Generation

TO Davies, AR Pearce, PJ Stuckey, H Sondergaard

Conference Proceedings  |  2014  |  Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling

Failure tabled constraint logic programming by interpolation

Graeme Gange, Jorge A Navas, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Journal article  |  2013  |  Theory and Practice of Logic Programming

A Low Overhead Method for Recovering Unused Memory Inside Regions

M DAVIS, P Schachte, Z Somogyi, HC Sondergaard

Conference Proceedings  |  2013  |  Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

Unbounded model-checking with interpolation for regular language constraints

G Gange, JA Navas, PJ Stuckey, H Sondergaard, P Schachte

Conference Proceedings  |  2013  |  Tools and Algorithms for the Construction and Analysis of Systems

Solving Difference Constraints over Modular Arithmetic

G Gange, H Sondergaard, PJ Stuckey, P Schachte

Conference Proceedings  |  2013  |  Automated Deduction - CADE-24

Abstract Interpretation over Non-Lattice Abstract Domains

G Gange, JA Navas, P Schachte, H Sondergaard, PJ Stuckey

Conference Proceedings  |  2013  |  Static Analysis

Collaborative learning through formative peer review: Pedagogy, programs and potential

H Søndergaard, RA Mulder

Journal article  |  2012  |  Computer Science Education

Logic programming: From underspecification to undefinedness

L Naish, H Søndergaard, B Horsfall

Conference Proceedings  |  2012  |  Conferences in Research and Practice in Information Technology Series: Theory of Computing 2012

Towards region-based memory management for go

M Davis, P Schachte, Z Somogyi, H Søndergaard

Conference Proceedings  |  2012  |  Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code

JA Navas, P Schachte, H Sondergaard, PJ Stuckey

Conference Proceedings  |  2012  |  APLAS 2012: Proceedings of the 10th Asian Symposium on Programming Languages and Systems

Information loss in knowledge compilation: A comparison of Boolean envelopes

Peter Schachte, Harald Sondergaard, Leigh Whiting, Kevin Henshall

Journal article  |  2010  |  Artificial Intelligence

An algorithm for affine approximation of binary decision diagrams

K Henshall, P Schachte, H SONDERGAARD, L Whiting

Journal article  |  2010  |  Chicago Journal of Theoretical Computer Science

Automatic Abstraction for Congruences

A King, H Sondergaard

Conference Proceedings  |  2010  |  Lecture Notes in Computer Science: Verification, Model Checking and Abstract Interpretation 11th International Conference, VMCAI

Places for learning engineering: A preliminary report on informal learning spaces

RL Chang, L Stern, H Sondergaard, R Hadgraft

Conference Proceedings  |  2009  |  Proceedings of the Research in Engineering Education Symposium 2009

Boolean affine approximation with binary decision diagrams

K Henshall, P Schachte, H Søndergaard, L Whiting

Conference Proceedings  |  2009  |  Theory of Computing 2009: Proceedings of the Fifteenth Computing: The Australasian Theory Symposium (CATS 2009)

Learning from and with peers

Harald Sondergaard

Journal article  |  2009  |  ACM SIGCSE Bulletin

State Joining and Splitting for the Symbolic Execution of Binaries

TA HANSEN, P SCHACHTE, H SONDERGAARD

Conference Proceedings  |  2009  |  Lecture Notes in Computer Science: Runtime Verification

Symbolic execution can be used to explore the possible run-time states of a program. It makes use of a concept of "state" where a ..

Learning from and with Peers: The Different Roles of Student Peer Reviewing

H SONDERGAARD

Conference Proceedings  |  2009  |  Proceedings of the 2009 ACM SIGSE Annual Conference on Innovation and Technology in Computer Science Education

Inferring congruence equations using SAT

A King, H SONDERGAARD

Conference Proceedings  |  2008  |  Computer Aided Verification (Lecture Notes in Computer Science)

This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of..

Un-kleene boolean equation solving

Brian Herlihy, Peter Schachte, Harald Sondergaard

Journal article  |  2007  |  International Journal of Foundations of Computer Science

Boolean approximation revisited

P SCHACHTE, H SONDERGAARD

Conference Proceedings  |  2007  |  Abstraction, Reformulation and Approximation - 7th International Symposium, SARA 2007

Closure Operators for ROBDDs

P SCHACHTE, H SONDERGAARD

Conference Proceedings  |  2006  |  Verification, Model Checking, and Abstract Interpretation

Boolean equation solving as graph traversal

B HERLIHY, P SCHACHTE, H SONDERGAARD

Conference Proceedings  |  2006  |  Proceedings of the 12th Computing: The Australasian Theory Symposium

We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are ..

Making Connections: First Year Transition for Computer Science and Software Engineering Students

A Moffat, BM HUGHES, HC SONDERGAARD, PA GRUBA

Conference Proceedings  |  2005  |  Proceedings of the Seventh Australasian Computing Education Conference

What Drives Curriculum Change?

PA GRUBA, A Moffat, HC SONDERGAARD

Conference Proceedings  |  2004  |  Computing Education 2004: Sixth Australasian Computing Education Conference

Effective Feedback to Small and Large Classes

HC SONDERGAARD, DA THOMAS

Conference Proceedings  |  2004  |  Proceedings of the 34th Annual ASEE/IEEE Frontiers in Education Conference

Exception analysis for non-strict languages

K Glynn, PJ Stuckey, M Sulzmann, H Sondergaard

Report  |  2002  |  ACM Sigplan Notices

Meta-circular abstract interpretation in prolog

M Codish, H Sondergaard

Book Chapter  |  2002  |  Lecture Notes in Artificial Intelligence

Exception analysis for non-strict languages

K GLYNN, P STUCKEY, M SULZMANN, H SONDERGAARD

Conference Proceedings  |  2002  |  Proceedings of the 7th International Conference on Functional Programming

A constructivist approach to communication skills instruction in computer science

P Gruba, H Søndergaard

Journal article  |  2001  |  Computer Science Education

Proceeding of the 3rd Internationa ACM SIGPLAN Conference on Prinicples and Practice of Declarative Programming: Preface

H Søndergaard

Conference Proceedings  |  2001  |  Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Higher-Precision Groudness Analysis

M CODISH, S GENAIM, HC SONDERGAARD, PJ STUCKEY

Conference Proceedings  |  2001  |  Lecture Notes in Computer Science

Boolean Constraints for Binding-Time Analysis

K GLYNN, PJ STUCKEY, M SULZMANN, HC SONDERGAARD

Conference Proceedings  |  2001  |  Lecture Notes in Computer Science

To achieve acceptable accuracy, many program analyses for functional programs are “property polymorphic”. That is, they can infer ..

Transforming communication skills instruction: The conference approach

P Gruba, H Søndergaard

Conference Proceedings  |  2000  |  Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518)

Sharing and groundness dependencies in logic programs

M Codish, H Sondergaard, PJ Stuckey

Journal article  |  1999  |  ACM Transactions on Programming Languages and Systems

Immediate fixpoints for strictness analysis

K Glynn, H SONDERGAARD

Conference Proceedings  |  1999

A strategy for managing content complexity in algorithm animation

L Stern, H Sondergaard, L Naish

Conference Proceedings  |  1999  |  ACM SIGCSE Bulletin

Strictness analysis as finite-domain constraint solving

T Gabric, K Glynn, H Sondergaard

Conference Proceedings  |  1999  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Strategy for managing content complexity in algorithm animation

L Stern, H Sondergaard, L Naish

Conference Proceedings  |  1999  |  Poceedings of the Conference on Integrating Technology into Computer Science Education, ITiCSE

Two classes of Boolean functions for dependency analysis

T Armstrong, K Marriott, P Schachte, H Sondergaard

Journal article  |  1998  |  Science of Computer Programming

Differential methods in logic program analysis

MG de la Banda, K Marriott, P Stuckey, H Sondergaard

Journal article  |  1998  |  The Journal of Logic Programming

A practical object-oriented analysis engine for CLP

AD Kelly, K Marriott, H Sondergaard, PJ Stuckey

Journal article  |  1998  |  Software: Practice and Experience

The boolean logic of set sharing analysis

M Codish, H Søndergaard

Conference Proceedings  |  1998  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A generic object-oriented incremental analyser for constraint logic programs

A Kelly, K Marriott, H SONDERGAARD, P Stuckey

Conference Proceedings  |  1997

Abstract interpretation of active rules and its use in termination analysis

J Bailey, L Crnogorac, K Ramamohanarao, H Sondergaard

Conference Proceedings  |  1997  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Termination analysis for mercury

C Speirs, Z Somogyi, H Søndergaard

Conference Proceedings  |  1997  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Low-contact learning in a first year programming course

R Johnston, A Moffat, H Søndergaard, P Stuckey

Conference Proceedings  |  1996  |  Proceedings of the first Australasian conference on Computer science education - ACSE '96

Immediate fixpoints and their use in groundness analysis

H Søndergaard

Conference Proceedings  |  1996  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A comparison of three occur-check analysers

L Crnogorac, AD Kelly, H Søndergaard

Conference Proceedings  |  1996  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Two applications of an incremental analysis engine for (Constraint) logic programs

AD Kelly, K Marriott, H Søndergaard, PJ Stuckey

Conference Proceedings  |  1996  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Guest editors' foreword

P Sestoft, H Søndergaard

Journal article  |  1995  |  Lisp and Symbolic Computation

An optimizing compiler for CLP(R)

AD Kelly, A Macdonald, K Marriott, H Søndergaard, PJ Stuckey, RHC Yap

Conference Proceedings  |  1995  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DENOTATIONAL ABSTRACT INTERPRETATION OF LOGIC PROGRAMS

K MARRIOTT, H SONDERGAARD, ND JONES

Journal article  |  1994  |  ACM Transactions on Programming Languages and Systems

Optimizing compilation for CLP(R)

K Marriott, H SONDERGAARD, P Stuckey, R Yap

Conference Proceedings  |  1994

Boolean functions for dependency analysis: Algebraic properties and efficient representation

T Armstrong, K Marriott, P Schachte, H Søndergaard

Conference Proceedings  |  1994  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Precise and Efficient Groundness Analysis for Logic Programs

K Marriott, H Søndergaard

Journal article  |  1993  |  ACM Letters on Programming Languages and Systems

DIFFERENCE-LIST TRANSFORMATION FOR PROLOG

K MARRIOTT, H SONDERGAARD

Journal article  |  1993  |  New Generation Computing

Definiteness analysis for CLP(R)

H SONDERGAARD, N Baker

Conference Proceedings  |  1993

On propagation-based analysis of logic programs

H SONDERGAARD, K Marriott

Conference Proceedings  |  1993

NONDETERMINISM IN FUNCTIONAL LANGUAGES

H SONDERGAARD, P SESTOFT

Journal article  |  1992  |  The Computer Journal

BOTTOM-UP DATA-FLOW ANALYSIS OF NORMAL LOGIC PROGRAMS

K MARRIOTT, H SONDERGAARD

Journal article  |  1992  |  The Journal of Logic Programming

A GENERAL-THEORY FOR ABSTRACTION

R CREMONINI, K MARRIOTT, H SONDERGAARD

Conference Proceedings  |  1990  |  AI 90

Abstract interpretation of logic programs: The denotational approach

K Marriott, H SONDERGAARD

Conference Proceedings  |  1990

A CHARACTERIZATION OF NON-FLOUNDERING LOGIC PROGRAMS

K MARRIOTT, H SONDERGAARD, P DART

Conference Proceedings  |  1990  |  LOGIC PROGRAMMING : PROCEEDINGS OF THE 1990 NORTH AMERICAN CONFERENCE

ANALYSIS OF CONSTRAINT LOGIC PROGRAMS

K MARRIOTT, H SONDERGAARD

Conference Proceedings  |  1990  |  LOGIC PROGRAMMING : PROCEEDINGS OF THE 1990 NORTH AMERICAN CONFERENCE

REFERENTIAL TRANSPARENCY, DEFINITENESS AND UNFOLDABILITY

H SONDERGAARD, P SESTOFT

Journal article  |  1990  |  Acta Informatica

ON PROLOG AND THE OCCUR CHECK PROBLEM

K MARRIOTT, H SONDERGAARD

Journal article  |  1989  |  ACM SIGPLAN Notices

Mix: A self-applicable partial evaluator for experiments in compiler generation

ND Jones, P Sestoft, H Søndergaard

Journal article  |  1989  |  Lisp and Symbolic Computation

Semantics-based dataflow analysis of logic programs

H SONDERGAARD, K Marriott

Conference Proceedings  |  1989

A BIBLIOGRAPHY ON PARTIAL EVALUATION

P SESTOFT, H SONDERGAARD

Journal article  |  1988  |  ACM SIGPLAN Notices

MIX - A SELF-APPLICABLE PARTIAL EVALUATOR FOR EXPERIMENTS IN COMPILER GENERATION

ND JONES, P SESTOFT, H SONDERGAARD

Journal article  |  1988  |  LECTURE NOTES IN COMPUTER SCIENCE

Bottom-up abstract interpretation of logic programs

K Marriott, H SONDERGAARD

Conference Proceedings  |  1988

Extended abstract of MIX: A self-applicable partial evaluator for experiments in compiler generation

ND Jones, P Sestoft, H Søndergaard

Conference Proceedings  |  1988  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A semantics-based framework for the abstract interpretation of Prolog

ND Jones, H SONDERGAARD

Book Chapter  |  1987

AN APPLICATION OF ABSTRACT INTERPRETATION OF LOGIC PROGRAMS - OCCUR CHECK REDUCTION

H SONDERGAARD

Conference Proceedings  |  1986  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

AN EXPERIMENT IN PARTIAL EVALUATION - THE GENERATION OF A COMPILER GENERATOR

ND JONES, P SESTOFT, H SONDERGAARD

Conference Proceedings  |  1985  |  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

AN EXPERIMENT IN PARTIAL EVALUATION - THE GENERATION OF A COMPILER GENERATOR

ND JONES, P SESTOFT, H SONDERGAARD

Journal article  |  1985  |  ACM SIGPLAN Notices

Kevin Henshall, Peter Schachte, Harald Sondergaard, Leigh Whiting

Journal article  |  Chicago Journal of Theoretical Computer Science