| Optimal Bounds for Floating-Point Addition in Constant Time | 0 | 0.34 | 2019 |
| Constraint Programming for Dynamic Symbolic Execution of JavaScript. | 0 | 0.34 | 2019 |
| Compiling CP subproblems to MDDs and d-DNNFs. | 1 | 0.38 | 2019 |
| 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 |
| Exploiting Sparsity in Difference-Bound Matrices. | 5 | 0.43 | 2016 |
| Steiner Tree Problems with Side Constraints Using Constraint Programming. | 3 | 0.40 | 2016 |
| Weighted Spanning Tree Constraint With Explanations | 0 | 0.34 | 2016 |
| Adtpp: lightweight efficient safe polymorphic algebraic data types for C. | 0 | 0.34 | 2016 |
| A Bounded Path Propagator On Directed Graphs | 1 | 0.48 | 2016 |
| Horn Clauses as an Intermediate Representation for Program Analysis and Transformation | 6 | 0.55 | 2015 |
| Dauphin: A Signal Processing Language - Statistical Signal Processing Made Easy | 0 | 0.34 | 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 |
| 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 |
| Solving difference constraints over modular arithmetic | 5 | 0.41 | 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 |
| 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 |
| Controlling loops in parallel mercury code | 0 | 0.34 | 2012 |
| Estimating the overlap between dependent computations for automatic parallelization. | 2 | 0.41 | 2011 |
| 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 |
| ParaAJ: toward reusable and maintainable aspect oriented programs | 4 | 0.41 | 2009 |
| Boolean affine approximation with binary decision diagrams | 0 | 0.34 | 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 |
| A Secure Group Agreement (SGA) Protocol for Peer-to-Peer Applications | 24 | 1.12 | 2007 |
| QUIP: a protocol for securing content in peer-to-peer publish/subscribe overlay networks | 6 | 0.72 | 2007 |
| Secure random number agreement for peer-to-peer applications | 0 | 0.34 | 2007 |
| Un-Kleene Boolean Equation Solving | 1 | 0.38 | 2007 |
| Suitability of Object and Aspect Oriented Languages for Software Maintenance | 1 | 0.37 | 2007 |
| Closure operators for ROBDDs | 4 | 0.42 | 2006 |
| Size-Change termination analysis in k-bits | 6 | 0.48 | 2006 |
| Boolean equation solving as graph traversal | 0 | 0.34 | 2006 |
| Precise goal-independent abstract interpretation of constraint logic programs | 2 | 0.37 | 2003 |
| Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos | 21 | 0.83 | 1998 |
| Two classes of Boolean functions for dependency analysis | 65 | 2.00 | 1998 |
| Global Variables In Logic Programming | 3 | 0.40 | 1997 |
| Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation | 33 | 1.39 | 1994 |
