People
  1. Students
  2. Alumni
  3. Honorary Graduates
  4. Academic Experts
People

Contact Information

Contact

Visit Jacob Howe

A309E, College Building

null

Postal Address

City, University of London
Northampton Square
London
EC1V 0HB
United Kingdom

About

Overview

My research lies in the area of Software and Systems Engineering. In particular I have interests in mathematical logic, declarative programming, constraint solving and computational geometry. My work has two strands, one in developing the theoretical foundations of these areas, the other in applying them, particularly in static program analysis using abstract interpretation. Formally reasoning about code using abstract interpretation makes it an important tool for the software engineer interested in verification and security.

Qualifications

PhD Computer Science, University of St Andrews, 1998
MSc Philososphy & History of Science, University of London (LSE), 1995
BSc (Hons) Mathematics, University of Warwick, 1994

Employment

08/2007 - to date City University London, Senior Lecturer
10/2001 - 07/2007 City University London, Lecturer

Forthcoming and recent events

- LOPSTR 2014, PC member
- LOPSTR 2013, PC member
- WLPE'2013, PC member
- PADL'2013: Practical Aspects of Declarative Languages, PC Member
- PPDP'2012, PC member
- WLPE'2012, PC member

Software

SAT solver: this logic programming pearl is coded in 20 lines Prolog with additional code for an SMT solver.

Research

Research Interests

My research interests are centred on static program analysis, the development of the techniques used and building tools to apply this. In particular I am interested in applying geometrical and logical techniques to program analysis. I also have interests in logic programming, constraint solving and mathematical logic. Recent projects I have been involved in include the EPSRC project VIP: Verification with Integer Polyhedra.

Publications

Chapter

  1. Howe, J.M. and King, A. Polyhedral Analysis using Parametric Objectives. Nineteenth Static Analysis Symposium (pp. 41–57). Springer.

Conference Papers and Proceedings (10)

  1. Robbins, E., Howe, J.M. and King, A. (2013). Theory propagation and rational-trees. .
  2. Howe, J.M. and King, A. (2010). A pearl on SAT solving in Prolog. 10th International Symposium on Functional and Logic Programming 19-21 April, Sendai, Japan.
  3. Charles, P.J., Howe, J.M. and King, A. (2009). Integer polyhedra for program analysis. 5th International Conference, AAIM 2009 15-17 June, San Francisco, USA.
  4. Howe, J.M. and King, A. (2009). Logahedra: A new weakly relational domain. .
  5. Simon, A., King, A. and Howe, J.M. (2003). Two variables per linear inequality as an abstract domain. .
  6. Howe, J.M. and King, A. (2001). Positive Boolean Functions as Multiheaded Clauses. International Conference on Logic Programming 26 Nov 2001 – 1 Dec 2001, Cyprus.
  7. Howe, J.M. and King, A. (2000). Specialising Finite Domain Programs with Polyhedra. Logic Programming Synthesis and Transformation 1999 22 Sep 1999 – 24 Sep 1999, Venezia.
  8. Howe, J.M. and King, A. (1999). Specialising Finite Domain Programs Using Polyhedra. .
  9. Howe, J.M. (1997). Two Loop Detection Mechanisms: a Comparison. International Conference on Analytic Tableaux and Related Methods (TABLEAUX'97) 13-16 May, Pont-a-Mousson.
  10. Howe, J.M. and King, A. Implementing Groundness Analysis with Definite Boolean Functions. 9th European Symposium on Programming Languages and Systems .

Journal Articles (15)

  1. Howe, J.M., Robbins,, E. and King, A. (2017). Theory Learning with Symmetry Breaking. 19th International Symposium on Principles and Practice of Declarative Programming pp. 85–96. doi:10.1145/3131851.3131861.

    [publisher’s website]

  2. Robbins, E., Howe, J.M. and King, A. (2014). Theory propagation and reification. Science of Computer Programming, 111(1), pp. 3–22. doi:10.1016/j.scico.2014.05.013.
  3. Howe, J.M. and King, A. (2012). A pearl on SAT and SMT solving in Prolog. Theoretical Computer Science .
  4. Howe, J.M. and King, A. (2011). A Pearl on SAT Solving in Prolog (extended abstract). Logic Programming Newsletter, (3) .
  5. Howe, J.M., King, A. and Lawrence-Jones, C. (2010). Quadtrees as an abstract domain. Electronic Notes in Theoretical Computer Science, 267(1), pp. 89–100. doi:10.1016/j.entcs.2010.09.008.
  6. Howe, J.M., King, A. and Lu, L.J. (2004). Analysing logic programs by reasoning backwards. PROGRAM DEVELOPMENT IN COMPUTATIONAL LOGIC, 3049, pp. 152–188.
  7. Howe, J.M. and King, A. (2003). Three optimisations for sharing. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 3, pp. 243–257. doi:10.1017/S1471068402001497.
  8. Howe, J.M. and King, A. (2003). Efficient groundness analysis in Prolog. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 3, pp. 95–124. doi:10.1017/S1471068402001485.
  9. Howe, J.M. and King, A. (2003). Efficient Groundness Analysis in Prolog. TPLP, 3, pp. 95–124. doi:10.1017/S1471068402001485.
  10. Howe, J.M. and King, A. (2003). Three Optimisations for Sharing. TPLP, 3, pp. 243–257. doi:10.1017/S1471068402001497.
  11. Genaim, S., Codish, M. and Howe, J.M. (2001). Worst-case groundness analysis using definite Boolean functions. Theory and Practice of Logic Programming, 1(5), pp. 611–615.
  12. Genaim, S., Howe, J.M. and Codish, M. (2001). Theory and Practice of Logic Programming. Theory and Practice of Logic Programming, 1(5), pp. 611–615.
  13. Howe, J.M. (2001). Proof Search in Lax Logic. Mathematical Structures in Computer Science, 11(4), pp. 573–588.
  14. Genaim, S., Howe, J.M. and Codish, M. (2001). Worst-case groundness analysis using definite boolean functions. TPLP, 1, pp. 611–615. doi:10.1017/S1471068401001077.
  15. Howe, J.M. and King, A. (2000). Abstracting Numeric Constraints with Boolean Functions. Information Processing Letters, 75(1-2), pp. 17–23. doi:10.1016/S0020-0190(00)00081-8.

Reports (3)

  1. Howe, J.M., King, A. and Lawrence-Jones, C. (2010). Quadtrees as an Abstract Domain..
  2. Howe, J.M. and King, A. (2009). Closure Algorithms for Domains with Two Variables Per Inequality..
  3. Howe, J.M. and King, A. Widening BDDS. University of Kent.

Thesis/Dissertation

  1. Howe, J.M. Proof Search Issues in Some Non-Classical Logics. (PhD Thesis)

Education

Educational Leadership

Course Director for MSc in e-Business Systems
Course Director for BSc Computer Science

Modules Taught

IN1007: Programming in Java (bootcamp)
IN2009: Language Processors
IN3017: Theory of Computation
INM350: Programming with Java

Other Activities

Editorial Activity

  1. Forthcoming and Recent Events
    - LOPSTR 2013, (Madrid, Spain), Programme Committee member
    - WLPE'2013, (Istanbul, Turkey), Programme Committee member
    - PADL'2013: Practical Aspects of Declarative Languages, (Rome, Italy), Programme Committee Member
    - PPDP'2012, (Leuven, Belgium), Programme Committee member
    - WLPE'2012, (Budapest, Hungary), Programme Committee member
    .

Find us

City, University of London

Northampton Square

London EC1V 0HB

United Kingdom

Back to top

City, University of London is an independent member institution of the University of London. Established by Royal Charter in 1836, the University of London consists of 18 independent member institutions with outstanding global reputations and several prestigious central academic bodies and activities.