Symbolic Execution with Invariant Inlay: Evaluating the Potential | 0 | 0.34 | 2018 |
Precondition Inference via Partitioning of Initial States. | 0 | 0.34 | 2018 |
An iterative approach to precondition inference using constrained Horn clauses. | 0 | 0.34 | 2018 |
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic. | 0 | 0.34 | 2017 |
Combining String Abstract Domains For Javascript Analysis: An Evaluation | 2 | 0.38 | 2017 |
Generating source inputs for metamorphic testing using dynamic symbolic execution. | 1 | 0.36 | 2016 |
Exploiting Sparsity in Difference-Bound Matrices. | 5 | 0.43 | 2016 |
Compositional Symbolic Execution: Incremental Solving Revisited. | 0 | 0.34 | 2016 |
A Bit-Vector Solver With Word-Level Propagation | 4 | 0.43 | 2016 |
Horn Clauses as an Intermediate Representation for Program Analysis and Transformation | 6 | 0.55 | 2015 |
Using Metamorphic Testing to Improve Dynamic Symbolic Execution | 1 | 0.37 | 2015 |
Compositional Symbolic Execution Using Fine-Grained Summaries | 2 | 0.38 | 2015 |
A Tool for Intersecting Context-Free Grammars and Its Applications. | 0 | 0.34 | 2015 |
A Partial-Order Approach to Array Content Analysis. | 0 | 0.34 | 2014 |
Analyzing Array Manipulating Programs by Program Transformation. | 2 | 0.37 | 2014 |
Fragment-Based Planning Using Column Generation. | 2 | 0.37 | 2014 |
Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss | 6 | 0.44 | 2014 |
A Complete Refinement Procedure for Regular Separability of Context-Free Languages. | 1 | 0.37 | 2014 |
Synthesizing Optimal Switching Lattices | 5 | 0.52 | 2014 |
Four-Valued Reasoning and Cyclic Circuits. | 1 | 0.37 | 2014 |
Solving difference constraints over modular arithmetic | 5 | 0.41 | 2013 |
Truth versus information in logic programming. | 2 | 0.37 | 2013 |
Unbounded model-checking with interpolation for regular language constraints | 6 | 0.47 | 2013 |
Failure tabled constraint logic programming by interpolation. | 8 | 0.45 | 2013 |
Abstract Interpretation over Non-lattice Abstract Domains. | 7 | 0.45 | 2013 |
A low overhead method for recovering unused memory inside regions | 0 | 0.34 | 2013 |
Logic programming: from underspecification to undefinedness | 0 | 0.34 | 2012 |
Towards region-based memory management for Go | 1 | 0.38 | 2012 |
Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code. | 10 | 0.59 | 2012 |
Collaborative Learning Through Formative Peer Review: Pedagogy, Programs And Potential | 8 | 0.73 | 2012 |
Information loss in knowledge compilation: A comparison of Boolean envelopes | 1 | 0.35 | 2010 |
An Algorithm for Affine Approximation of Binary Decision Diagrams. | 2 | 0.39 | 2010 |
Boolean affine approximation with binary decision diagrams | 0 | 0.34 | 2009 |
Learning from and with peers: the different roles of student peer reviewing | 13 | 1.12 | 2009 |
State Joining and Splitting for the Symbolic Execution of Binaries | 17 | 0.76 | 2009 |
Binary Decision Diagrams for Affine Approximation | 0 | 0.34 | 2008 |
Inferring Congruence Equations Using SAT | 12 | 0.59 | 2008 |
Un-Kleene Boolean Equation Solving | 1 | 0.38 | 2007 |
Boolean Approximation Revisited | 4 | 0.43 | 2007 |
Closure operators for ROBDDs | 4 | 0.42 | 2006 |
Boolean equation solving as graph traversal | 0 | 0.34 | 2006 |
Making connections: first year transition for computer science and software engineering students | 1 | 0.38 | 2005 |
Meta-circular abstract interpretation in prolog | 8 | 0.62 | 2002 |
Higher-Precision Groundness Analysis | 4 | 0.43 | 2001 |
Boolean Constraints for Binding-Time Analysis | 6 | 0.45 | 2001 |
Transforming communication skills instruction: the conference approach | 1 | 0.42 | 2000 |
Sharing and groundness dependencies in logic programs | 29 | 0.94 | 1999 |
The Boolean Logic of Set Sharing Analysis | 4 | 0.42 | 1998 |
A practical object-oriented analysis engine for CLP | 4 | 0.40 | 1998 |
Differential methods in logic program analysis | 10 | 0.53 | 1998 |