| Feature Range Analysis | 0 | 0.34 | 2021 |
| Selecting Stable Safe Configurations for Systems Modelled by Neural Networks with ReLU Activation | 0 | 0.34 | 2020 |
| Range Analysis and Applications to Root Causing | 0 | 0.34 | 2019 |
| Symbolic trajectory evaluation for word-level verification: theory and implementation. | 1 | 0.35 | 2017 |
| Predicate Elimination for Preprocessing in First-Order Theorem Proving. | 2 | 0.38 | 2016 |
| Word-Level Symbolic Trajectory Evaluation | 1 | 0.36 | 2015 |
| EPR-based k-induction with Counterexample Guided Abstraction Refinement. | 0 | 0.34 | 2015 |
| EPR-based bounded model checking at word level | 3 | 0.44 | 2012 |
| Preprocessing techniques for first-order clausification. | 4 | 0.41 | 2012 |
| Implicative simultaneous satisfiability and applications | 6 | 0.45 | 2011 |
| Encoding industrial hardware verification problems into effectively propositional logic | 7 | 0.47 | 2010 |
| A compositional theory for post-reboot observational equivalence checking of hardware | 8 | 0.56 | 2009 |
| Verifying equivalence of memories using a first order logic theorem prover | 6 | 0.45 | 2009 |
| Assume-guarantee validation for STE properties within an SVA environment | 1 | 0.37 | 2009 |
| On formal equivalence verification of hardware | 0 | 0.34 | 2008 |
| Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification | 14 | 0.73 | 2007 |
| Post-reboot Equivalence and Compositional Verification of Hardware | 6 | 0.55 | 2006 |
| Encoding RTL Constructs for MathSAT: a Preliminary Report | 14 | 0.88 | 2006 |
| Simultaneous SAT-Based model checking of safety properties | 11 | 0.57 | 2005 |
| The conflict-free reduction geometry | 2 | 0.35 | 2005 |
| Expression reduction systems and extensions: an overview | 7 | 0.46 | 2005 |
| Theoretical framework for compositional sequential hardware equivalence verification in presence of design constraints | 17 | 1.22 | 2004 |
| SAT-Based Methods for Sequential Hardware Equivalence Verification without Synchronization | 11 | 0.74 | 2003 |
| Stable computational semantics of conflict-free rewrite systems (partial orders with duplication) | 1 | 0.34 | 2003 |
| An Abstract Concept of Optimal Implementation | 3 | 0.38 | 2003 |
| Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus | 1 | 0.35 | 2002 |
| An Abstract Böhm-normalization | 4 | 0.40 | 2002 |
| Relating conflict-free stable transition and event models via redex families | 9 | 0.47 | 2002 |
| Uniform Normalisation beyond Orthogonality | 4 | 0.46 | 2001 |
| On the longest perpetual reductions in orthogonal expression reduction systems | 16 | 1.05 | 2001 |
| An Enhanced Cut-points Algorithm in Formal Equivalence Verification | 8 | 1.05 | 2001 |
| Perpetuality and uniform normalization in orthogonal rewrite systems | 11 | 0.68 | 2001 |
| A syntactical analysis of normalization | 1 | 0.36 | 2000 |
| Stable results and relative normalization | 6 | 0.44 | 2000 |
| Normalization of Typable Terms by Superdevelopments | 6 | 0.54 | 1998 |
| The Geometry of Orthogonal Reduction Spaces | 5 | 0.44 | 1997 |
| Relating Conflict-Free Stable Transition and Event Models (Extended Abstract) | 3 | 0.38 | 1997 |
| Perpetuality and Uniform Normalization | 6 | 0.52 | 1997 |
| Relative Normalization in Deterministic Residual Structures | 17 | 0.68 | 1996 |
| Discrete Normalization and Standardization in Deterministic Residual Structures | 8 | 0.52 | 1996 |
| Minimal Relative Normalization in Orthogonal Expression Reduction Systems | 2 | 0.38 | 1996 |
| Context-sensitive Conditional Expression Reduction Systems | 10 | 0.65 | 1995 |
| Relative Normalization in Orthogonal Expression Reduction Systems | 14 | 0.72 | 1994 |
| On Higher Order Recursive Program Schemes | 17 | 0.87 | 1994 |
| Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems | 11 | 0.79 | 1994 |
| Optimal Normalization in Orthogonal Term Rewriting Systems | 19 | 1.05 | 1993 |
| beta-reductions and beta developments of lambda terms with the least number of steps | 4 | 0.43 | 1988 |
