Name
Affiliation
Papers
HARALD SØNDERGAARD
NICTA Victoria Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Vic. 3010 Australia
71
Collaborators
Citations 
PageRank 
63
858
79.52
Referers 
Referees 
References 
913
1063
942
Search Limit
1001000
Title
Citations
PageRank
Year
Symbolic Execution with Invariant Inlay: Evaluating the Potential00.342018
Precondition Inference via Partitioning of Initial States.00.342018
An iterative approach to precondition inference using constrained Horn clauses.00.342018
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.00.342017
Combining String Abstract Domains For Javascript Analysis: An Evaluation20.382017
Generating source inputs for metamorphic testing using dynamic symbolic execution.10.362016
Exploiting Sparsity in Difference-Bound Matrices.50.432016
Compositional Symbolic Execution: Incremental Solving Revisited.00.342016
A Bit-Vector Solver With Word-Level Propagation40.432016
Horn Clauses as an Intermediate Representation for Program Analysis and Transformation60.552015
Using Metamorphic Testing to Improve Dynamic Symbolic Execution10.372015
Compositional Symbolic Execution Using Fine-Grained Summaries20.382015
A Tool for Intersecting Context-Free Grammars and Its Applications.00.342015
A Partial-Order Approach to Array Content Analysis.00.342014
Analyzing Array Manipulating Programs by Program Transformation.20.372014
Fragment-Based Planning Using Column Generation.20.372014
Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss60.442014
A Complete Refinement Procedure for Regular Separability of Context-Free Languages.10.372014
Synthesizing Optimal Switching Lattices50.522014
Four-Valued Reasoning and Cyclic Circuits.10.372014
Solving difference constraints over modular arithmetic50.412013
Truth versus information in logic programming.20.372013
Unbounded model-checking with interpolation for regular language constraints60.472013
Failure tabled constraint logic programming by interpolation.80.452013
Abstract Interpretation over Non-lattice Abstract Domains.70.452013
A low overhead method for recovering unused memory inside regions00.342013
Logic programming: from underspecification to undefinedness00.342012
Towards region-based memory management for Go10.382012
Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.100.592012
Collaborative Learning Through Formative Peer Review: Pedagogy, Programs And Potential80.732012
Information loss in knowledge compilation: A comparison of Boolean envelopes10.352010
An Algorithm for Affine Approximation of Binary Decision Diagrams.20.392010
Boolean affine approximation with binary decision diagrams00.342009
Learning from and with peers: the different roles of student peer reviewing131.122009
State Joining and Splitting for the Symbolic Execution of Binaries170.762009
Binary Decision Diagrams for Affine Approximation00.342008
Inferring Congruence Equations Using SAT120.592008
Un-Kleene Boolean Equation Solving10.382007
Boolean Approximation Revisited40.432007
Closure operators for ROBDDs40.422006
Boolean equation solving as graph traversal00.342006
Making connections: first year transition for computer science and software engineering students10.382005
Meta-circular abstract interpretation in prolog80.622002
Higher-Precision Groundness Analysis40.432001
Boolean Constraints for Binding-Time Analysis60.452001
Transforming communication skills instruction: the conference approach10.422000
Sharing and groundness dependencies in logic programs290.941999
The Boolean Logic of Set Sharing Analysis40.421998
A practical object-oriented analysis engine for CLP40.401998
Differential methods in logic program analysis100.531998
  • 1
  • 2