Harald Søndergaard

J. Autom. Reason., 2019

Constraint Programming for Dynamic Symbolic Execution of JavaScript.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Optimal Bounds for Floating-Point Addition in Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

Dissecting Widening: Separating Termination from Information.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

An iterative approach to precondition inference using constrained Horn clauses.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2018

Reference Abstract Domains and Applications to String Analysis.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Precondition Inference via Partitioning of Initial States.

[BibT_eX]

[DOI]

CoRR, 2018

Symbolic Execution with Invariant Inlay: Evaluating the Potential.

[BibT_eX]

[DOI]

Proceedings of the 25th Australasian Software Engineering Conference, 2018

2017

Combining String Abstract Domains for JavaScript Analysis: An Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Leveraging abstract interpretation for efficient dynamic symbolic execution.

[BibT_eX]

[DOI]

Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

2016

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

An Abstract Domain of Uninterpreted Functions.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Exploiting Sparsity in Difference-Bound Matrices.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 23rd International Symposium, 2016

Generating source inputs for metamorphic testing using dynamic symbolic execution.

[BibT_eX]

[DOI]

Proceedings of the 1st International Workshop on Metamorphic Testing, 2016

A Bit-Vector Solver with Word-Level Propagation.

[BibT_eX]

[DOI]

Wenxi Wang

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Compositional Symbolic Execution: Incremental Solving Revisited.

[BibT_eX]

[DOI]

Yude Lin

Proceedings of the 23rd Asia-Pacific Software Engineering Conference, 2016

2015

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

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2015

A Tool for Intersecting Context-Free Grammars and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Optimisation and Relaxation for Multiagent Planning in the Situation Calculus.

[BibT_eX]

[DOI]

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

Compositional Symbolic Execution Using Fine-Grained Summaries.

[BibT_eX]

[DOI]

Yude Lin

Proceedings of the 24th Australasian Software Engineering Conference, 2015

Using Metamorphic Testing to Improve Dynamic Symbolic Execution.

[BibT_eX]

[DOI]

Proceedings of the 24th Australasian Software Engineering Conference, 2015

2014

Truth versus information in logic programming.

[BibT_eX]

[DOI]

Lee Naish

Theory Pract. Log. Program., 2014

Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2014

Synthesizing Optimal Switching Lattices.

[BibT_eX]

[DOI]

Graeme Gange

ACM Trans. Design Autom. Electr. Syst., 2014

Four-Valued Reasoning and Cyclic Circuits.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2014

A Partial-Order Approach to Array Content Analysis.

[BibT_eX]

[DOI]

CoRR, 2014

Analyzing Array Manipulating Programs by Program Transformation.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Fragment-Based Planning Using Column Generation.

[BibT_eX]

[DOI]

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

2013

Failure tabled constraint logic programming by interpolation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2013

Unbounded Model-Checking with Interpolation for Regular Language Constraints.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Abstract Interpretation over Non-lattice Abstract Domains.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 20th International Symposium, 2013

A low overhead method for recovering unused memory inside regions.

[BibT_eX]

[DOI]

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

Solving Difference Constraints over Modular Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

2012

Collaborative learning through formative peer review: pedagogy, programs and potential.

[BibT_eX]

[DOI]

Raoul A. Mulder

Comput. Sci. Educ., 2012

Towards region-based memory management for Go.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Lee Naish

Benjamin Horsfall

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

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

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2010

An Algorithm for Affine Approximation of Binary Decision Diagrams.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2010

Information loss in knowledge compilation: A comparison of Boolean envelopes.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Automatic Abstraction for Congruences.

[BibT_eX]

[DOI]

Andy King

Proceedings of the Verification, 2010

2009

State Joining and Splitting for the Symbolic Execution of Binaries.

[BibT_eX]

[DOI]

Trevor Hansen

Proceedings of the Runtime Verification, 9th International Workshop, 2009

Learning from and with peers: the different roles of student peer reviewing.

[BibT_eX]

[DOI]

Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2009

Boolean Affine Approximation with Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2009, 2009

2008

Binary Decision Diagrams for Affine Approximation

[BibT_eX]

[DOI]

CoRR, 2008

Inferring Congruence Equations Using SAT.

[BibT_eX]

[DOI]

Andy King

Proceedings of the Computer Aided Verification, 20th International Conference, 2008

2007

Un-Kleene Boolean equation Solving.

[BibT_eX]

[DOI]

Brian Herlihy

Int. J. Found. Comput. Sci., 2007

Boolean Approximation Revisited.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2007

2006

Closure Operators for ROBDDs.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2006

Boolean equation solving as graph traversal.

[BibT_eX]

[DOI]

Brian Herlihy

Proceedings of the Theory of Computing 2006, 2006

2005

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

[BibT_eX]

[DOI]

Proceedings of the Seventh Australasian Computing Education Conference (ACE 2005), 2005

2004

What Drives Curriculum Change?

[BibT_eX]

[DOI]

Proceedings of the Sixth Australasian Computing Education Conference (ACE 2004), 2004

2002

Exception analysis for non-strict languages.

[BibT_eX]

[DOI]

Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP '02), 2002

Meta-circular Abstract Interpretation in Prolog.

[BibT_eX]

[DOI]

Michael Codish

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001

A Constructivist Approach to Communication Skills Instruction in Computer Science.

[BibT_eX]

[DOI]

Paul Gruba

Comput. Sci. Educ., 2001

Boolean Constraints for Binding-Time Analysis.

[BibT_eX]

[DOI]

Proceedings of the Programs as Data Objects, Second Symposium, 2001

Higher-Precision Groundness Analysis.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 17th International Conference, 2001

2000

Transforming Communication Skills Instruction: The Conference Approach.

[BibT_eX]

[DOI]

Paul Gruba

Proceedings of the 23rd Australasian Computer Science Conference (ACSC 2000), 31 January, 2000

1999

Sharing and groundness dependencies in logic programs.

[BibT_eX]

[DOI]

Michael Codish

ACM Trans. Program. Lang. Syst., 1999

A strategy for managing content complexity in algorithm animation.

[BibT_eX]

[DOI]

Linda Stern

Lee Naish

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.

[BibT_eX]

[DOI]

Maria J. García de la Banda

Softw. Pract. Exp., 1998

Two Classes of Boolean Functions for Dependency Analysis.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1998

Differential Methods in Logic Program Analysis.

[BibT_eX]

[DOI]

J. Log. Program., 1998

The Boolean Logic of Set Sharing Analysis.

[BibT_eX]

[DOI]

Michael Codish

Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Strictness Analysis as Finite-Domain Constraint Solving.

[BibT_eX]

[DOI]

Tihomir Gabric

Kevin Glynn

Proceedings of the Logic Programming Synthesis and Transformation, 1998

1997

Termination Analysis for Mercury.

[BibT_eX]

[DOI]

Chris Speirs

Zoltan Somogyi

Proceedings of the Static Analysis, 4th International Symposium, 1997

Abstract Interpretation of Active Rules and its Use in Termination Analysis.

[BibT_eX]

[DOI]

James Bailey

Lobel Crnogorac

Kotagiri Ramamohanarao

Proceedings of the Database Theory, 1997

1996

Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, Third International Symposium, 1996

A Comparison of Three Occur-Check Analysers.

[BibT_eX]

[DOI]

Lobel Crnogorac

Andrew D. Kelly

Proceedings of the Static Analysis, Third International Symposium, 1996

Immediate Fixpoints and Their Use in Groundness Analysis.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

Low-contact learning in a first year programming course.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCSE 1st Australasian Conference on Computer Science Education, 1996

1995

An Optimizing Compiler for CLP(R).

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 1995

1994

Denotational Abstract Interpretation of Logic Programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

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

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, First International Static Analysis Symposium, 1994

1993

Difference-List Transformation for Prolog.

[BibT_eX]

[DOI]

New Gener. Comput., 1993

Precise and Efficient Groundness Analysis for Logic Programs.

[BibT_eX]

[DOI]

LOPLAS, 1993

1992

Bottom-Up Dataflow Analysis of Normal Logic Programs.

[BibT_eX]

[DOI]

J. Log. Program., 1992

Non-Determinism in Functional Languages.

[BibT_eX]

[DOI]

Comput. J., 1992

1990

Referential Transparency, Definiteness and Unfoldability.

[BibT_eX]

[DOI]

Acta Informatica, 1990

A Characterization of Non-Floundering Logic Programs.

[BibT_eX]

Philip W. Dart

Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

Analysis of Constraint Logic Programs.

[BibT_eX]

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.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1989

Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation.

[BibT_eX]

LISP Symb. Comput., 1989

Semantics-Based Dataflow Analysis of Logic Programs.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

A bibliography on partial evaluation.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1988

Bottom-up Abstract Interpretation of Logic Programs.

[BibT_eX]

Proceedings of the Logic Programming, 1988

1987

MIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1986

An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.

[BibT_eX]

[DOI]

Proceedings of the ESOP 86, 1986

1985

An experiment in partial evaluation: the generation of a compiler generator.

[BibT_eX]

[DOI]