Harald Sondergaard

Teaching Simple Constructive Proofs with Haskell Programs

M Farrugia-Roberts, B Jeffries, H Søndergaard

Conference Proceedings  |  2022  |  Electronic Proceedings in Theoretical Computer Science, EPTCS

In recent years we have explored using Haskell alongside a traditional mathematical formalism in our large-enrolment university co..

Programming to Learn: Logic and Computation from a Programming Perspective

M Farrugia-Roberts, B Jeffries, H Søndergaard

Conference Proceedings  |  2022  |  Annual Conference on Innovation and Technology in Computer Science Education, ITiCSE

Programming problems are commonly used as a learning and assessment activity for learning to program. We believe that programming ..

String Abstract Domains and Their Combination

H Søndergaard

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

We survey recent developments in string static analysis, with an emphasis on how string abstract domains can be combined. The pape..

Transformation-Enabled Precondition Inference

Bishoksan Kafle, Graeme Gange, Peter J Stuckey, Peter Schachte, Harald Sondergaard

Journal article  |  2021  |  THEORY AND PRACTICE OF LOGIC PROGRAMMING

Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a nov..

A Fresh Look at Zones and Octagons

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

Journal article  |  2021  |  ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS

Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numeric..

Lightweight Nontermination Inference with CHCs

Bishoksan Kafle, Graeme Gange, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Book Chapter  |  2021  |  Lecture Notes in Computer Science

Non-termination is an unwanted program property (considered a bug) for some software systems, and a safety property for other syst..

Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study

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

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

Given a portfolio of algorithms, the goal of Algorithm Selection (AS) is to select the best algorithm(s) for a new, unseen problem..

Disjunctive Interval Analysis

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

Book Chapter  |  2021  |  Lecture Notes in Computer Science

We revisit disjunctive interval analysis based on the Boxes abstract domain. We propose the use of what we call range decision dia..

Abstract interpretation, symbolic execution and constraints

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

Conference Proceedings  |  2020  |  OpenAccess Series in Informatics

String constraint solving: past, present and future

Roberto Amadini, Graeme Gange, Peter Schachte, Harald Sondergaard, Peter J Stuckey

Conference Proceedings  |  2020  |  24th European Conference on Artificial Intelligence, Proceedings

String constraint solving is an important emerging field, given the ubiquity of strings over different fields such as formal analy..