Since the 1980's I have been doing research in Computer Science. Typical keywords include: Program Analysis, Efficiency of Algorithms, Lower Bounds, Models of Computation, Computability.
My Annotated publication list gives an overview of my research and links to on-line available papers.
A few research presentations:
slides from
FOPARA 2013:
Ranking Functions for Linear-Constraint Loops
(corresponds to recent JACM paper with Samir Genaim).
slides from
STACS 2013: Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity .
Other presentations:
Simple programs that are hard to analyze, a presentation in honour of Neil Jones on the occasion of the SIGPLAN
Programming Languages Achievement Award
and video
Publicly accessible demo progams:
- Online demo program of my work with Samir Genaim on ranking functions for linear-constraint loops. The associated paper is a SIGPLAN CACM Research Highlights Nomination.
-
Download (for Windows) of a demo of the Decision algorithm polynomial (or linear) growth in bounded-loop programs.
There is also a set of example programs. And another one.
Full text of my book אלגוריתמים ותוכניות (Programs and Algorithms), an introductory course on the Theory of Computation using a programming-language oriented approach, following Neil D. Jones (whose original book is available on his web page).
My gmail address is the typical lastname.firstname (no hyphen in the last name).
