Dr Jacob Howe
Department of Computer Science
School of Informatics
London EC1V OHB
tel: +44 20 7040 4045
fax: +44 20 7040 8587
Research and Responsiblities
I am a Senior Lecturer in the
at City University London
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, 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.
Forthcoming and Recent Events
PADL'2013: Practical Aspects of
, PC Member
Theory Propagation and Rational-Trees. Robbins, E., Howe, J. M. and King, A.
In Principles and Practice of Declarative Programming. ACM Press, 2013.
Polyhedral Analysis using Parametric Objectives. Howe, J. M. and King, A. In
Static Analysis Symposium, pages 41-57. Lecture Notes in Computer Science, volume 7460.
A Pearl of SAT and SMT Solving in Prolog. Howe, J. M. and King, A.
Theoretical Computer Science. 435:43-55, 2012.
Quadtrees as an Abstract Domain. Howe, J. M., King, A. and
Lawrence-Jones, C.. Electronic Notes in Theoretical Computer Science
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 Science, 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.
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,
[Full publications list]
: this logic programming pearl is
coded in 20 lines Prolog with additional code
for an SMT solver.