| Two variables per linear inequality as an abstract domain A Simon, A King, JM Howe Logic Based Program Synthesis and Transformation: 12th International …, 2003 | 131 | 2003 |
| Proof search issues in some non-classical logics JM Howe PQDT-Global, 1998 | 67 | 1998 |
| Detecting cross-site scripting attacks using machine learning FA Mereani, JM Howe International conference on advanced machine learning technologies and …, 2018 | 60 | 2018 |
| Logahedra: A new weakly relational domain JM Howe, A King International Symposium on Automated Technology for Verification and …, 2009 | 45 | 2009 |
| A pearl on SAT and SMT solving in Prolog JM Howe, A King Theoretical Computer Science 435, 43-55, 2012 | 33 | 2012 |
| Two loop detection mechanisms: a comparison JM Howe International Conference on Automated Reasoning with Analytic Tableaux and …, 1997 | 29 | 1997 |
| A pearl on SAT solving in Prolog JM Howe, A King International Symposium on Functional and Logic Programming, 165-174, 2010 | 26 | 2010 |
| Efficient groundness analysis in Prolog JM Howe, A King Theory and Practice of Logic Programming 3 (1), 95-124, 2003 | 26 | 2003 |
| Positive Boolean functions as multiheaded clauses JM Howe, A King Logic Programming: 17thInternational Conference, ICLP 2001 Paphos, Cyprus …, 2001 | 24 | 2001 |
| The two variable per inequality abstract domain A Simon, A King Higher-Order and Symbolic Computation 23, 87-143, 2010 | 23 | 2010 |
| Analysing logic programs by reasoning backwards JM Howe, A King, L Lu Program Development in Computational Logic: A Decade of Research Advances in …, 2004 | 20 | 2004 |
| Proof search in lax logic JM Howe Mathematical Structures in Computer Science 11 (4), 573-588, 2001 | 14 | 2001 |
| Preventing cross-site scripting attacks by combining classifiers F Mereani, JM Howe SCITEPRESS 1, 135-143, 2018 | 13 | 2018 |
| Theory propagation and rational-trees E Robbins, JM Howe, A King Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013 | 13 | 2013 |
| Worst-case groundness analysis using definite Boolean functions S Genaim, M Codish, JM Howe Theory and Practice of Logic Programming 1 (5), 611-615, 2001 | 12 | 2001 |
| Implementing groundness analysis with definite Boolean functions JM Howe, A King Programming Languages and Systems: 9th European Symposium on Programming …, 2000 | 12 | 2000 |
| Integer polyhedra for program analysis PJ Charles, JM Howe, A King Algorithmic Aspects in Information and Management: 5th International …, 2009 | 11 | 2009 |
| Exact and approximate rule extraction from neural networks with Boolean features F Mereani, JM Howe Proceedings of the 11th International Joint Conference on Computational …, 2019 | 10 | 2019 |
| Polyhedral analysis using parametric objectives JM Howe, A King International Static Analysis Symposium, 41-57, 2012 | 10 | 2012 |
| Theory propagation and reification E Robbins, JM Howe, A King Science of Computer Programming 111, 3-22, 2015 | 9 | 2015 |
