Department of Computing

Jacob Howe

Senior Lecturer

Photo of Dr Jacob Howe Dr Jacob Howe
Senior Lecturer
Room: A309B
Department of Computing
School of Informatics
City University
London EC1V OHB

jacob@soi.city.ac.uk
tel: +44 20 7040 4045
fax: +44 20 7040 8587

Research and Responsiblities

I am a Senior Lecturer in the Department of Computing at City University London and am a member of the programming languages and systems research group. I have a BSc in Mathematics, an MSc in Philosphy & History of Science and a PhD in Computer Science.

My research interests are centred on static program analysis and 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. Projects I am involved in include the EPSRC project VIP: Verification with Integer Polyhedra.

PhD Scholarships

City University London is currently advertising a large number of PhD scholarships. If you are interested in studying for PhD with me, please contact me to discuss a proposal.

Forthcoming events

I am on the Programme Committee for PPDP'2012.

Key Publications

  • A Pearl of SAT and SMT Solving in Prolog. Howe, J. M. and King, A. Theoretical Computer Science. Forthcoming.
  • Quadtrees as an Abstract Domain. Howe, J. M., King, A. and Lawrence-Jones, C.. Electronic Notes in Theoretical Computer Science 267(1):89-100, 2010.
  • A Pearl on SAT solving in Prolog. Howe, J. M. and King, A. In International Symposium on Functional and Logic Programming, pages 165-174. Lecture Notes in Computer Scince, volume 6009. Springer, 2010. Link to solver.
  • Logahedra: a New Weakly Relational Domain. Howe, J. M. and King, A. In Automated Technology for Verification and Analysis, pages 306-320. Lecture Notes in Computer Science, volume 5799, Springer, 2009.
  • Integer Polyhedra for Program Analysis. Charles, P. J., Howe, J. M. and King, A. In Algorithmic Aspects in Information and Management, pages 85-99. Lecture Notes in Computer Science volume 5564, Springer, 2009.
  • Efficient Groundness Analysis in Prolog. Howe, J. M. and King, A. Theory and Practice of Logic Programming. 3(1):95-124, 2003.
  • Positive Boolean Functions as Multiheaded Clauses. Howe, J. M. and King, A. In International Conference on Logic Programming, volume 2237 of Lecture Notes in Computer Science, pages 120-134. Springer, 2001.

    • [Full publications list]

    Software

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