Professor Immerman is one of the key developers of an active research program called descriptive complexity, an approach he is currently applying to research in model checking, database theory, and computational complexity theory.
Articles
First-Order and Temporal Logics for Nested Words (with Rajeev Alur, Marcelo Arenas, Pablo Barcelo, Kousha Etessami, and Leonid Libkin), Departmental Papers (CIS) (2008)
Nested words are a structured model of execution paths in procedural programs, reflecting their call...
On the Unusual Effectiveness of Logic in Computer Science (with Joseph Y. Halpern, Robert Harper, Phokion G. Kolaitis, Moshe Y. Vardi, and Victor Vianu), Computer Science Department (2001)
In 1960, E.P.Wigner, a joint winner of the 1963 Nobel Prize for Physics, published a...
Other
Framework for Analyzing Garbage Collection (with Matthew Hertz and J. Eliot B. Moss), Computer Science Department Faculty Publication Series (2002)
While the design of garbage collection algorithms has come of age, the analysis of these...