| Expression reduction systems Z Khasidashvili Proceedings of I. Vekua Institute of Applied Mathematics 36, 200-220, 1990 | 78 | 1990 |
| Encoding RTL constructs for MathSAT: a preliminary report M Bozzano, R Bruttomesso, A Cimatti, A Franzén, Z Hanna, ... Electronic Notes in Theoretical Computer Science 144 (2), 3-14, 2006 | 51 | 2006 |
| Optimal normalization in orthogonal term rewriting systems Z Khasidashvili International Conference on Rewriting Techniques and Applications, 243-258, 1993 | 51 | 1993 |
| Relative normalization in deterministic residual structures J Glauert, Z Khasidashvili Colloquium on Trees in Algebra and Programming, 180-195, 1996 | 43 | 1996 |
| Industrial strength SAT-based alignability algorithm for hardware equivalence verification D Kaiss, M Skaba, Z Hanna, Z Khasidashvili Formal Methods in Computer Aided Design (FMCAD'07), 20-26, 2007 | 40 | 2007 |
| The Church-Rosser theorem in orthogonal combinatory reduction systems Z Khasidashvili INRIA, 1992 | 39 | 1992 |
| Theoretical Framework for Compositional Sequential Hardware Equivalence Verification in Presence of Design Constraints Z Khasidashvili, M Skaba, D Kaiss, Z Hanna Proceedings of the International Conference on Computer Aided Design, IEEE, 2004 | 34 | 2004 |
| Encoding industrial hardware verification problems into effectively propositional logic M Emmer, Z Khasidashvili, K Korovin, A Voronkov Formal Methods in Computer Aided Design, 137-144, 2010 | 33 | 2010 |
| Relative normalization in orthogonal expression reduction systems J Glauert, Z Khasidashvili International Workshop on Conditional Term Rewriting Systems, 144-165, 1994 | 32 | 1994 |
| The longest perpetual reductions in orthogonal expression reduction systems Z Khasidashvili International Symposium on Logical Foundations of Computer Science, 191-203, 1994 | 32 | 1994 |
| Discrete normalization and standardization in deterministic residual structures Z Khasidashvili, J Glauert International Conference on Algebraic and Logic Programming, 135-149, 1996 | 27 | 1996 |
| Context-sensitive conditional expression reduction systems Z Khasidashvili, V Van Oostrom SEGRAGRA'95, Electronic Notes in Theoretical Computer Science 2, 167-176, 1995 | 27* | 1995 |
| On higher order recursive program schemes Z Khasidashvili Colloquium on Trees in Algebra and Programming, 172-186, 1994 | 27 | 1994 |
| β-reductions and β-developments of λ-terms with the least number of steps ZO Khasidashvili International Conference on Computer Logic, 105-111, 1988 | 27 | 1988 |
| Uniform normalisation beyond orthogonality Z Khasidashvili, M Ogawa, V van Oostrom Rewriting Techniques and Applications: 12th International Conference, RTA …, 2001 | 25 | 2001 |
| Preprocessing techniques for first-order clausification K Hoder, Z Khasidashvili, K Korovin, A Voronkov 2012 Formal Methods in Computer-Aided Design (FMCAD), 44-51, 2012 | 24 | 2012 |
| Perpetuality and uniform normalization in orthogonal rewrite systems Z Khasidashvili, M Ogawa, V van Oostrom Information and Computation 164 (1), 118-151, 2001 | 23 | 2001 |
| Simultaneous SAT-based model checking of safety properties Z Khasidashvili, A Nadel, A Palti, Z Hanna Hardware and Software, Verification and Testing: First International Haifa …, 2006 | 21 | 2006 |
| Expression reduction systems and extensions: An overview J Glauert, D Kesner, Z Khasidashvili Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated …, 2005 | 19 | 2005 |
| Predicate elimination for preprocessing in first-order theorem proving Z Khasidashvili, K Korovin Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016 | 18 | 2016 |
John GlauertProfessor of Computing Sciences, University of East Anglia, UK在 uea.ac.uk 的电子邮件经过验证
