|
|
College of Computer and Information
Science
Northeastern
University
360
Huntington Avenue
Boston,
Massachusetts
02115
Office: 202
West Village H, room 344
Phone: ++1-617-373-3100
Email: wahl[ -- ät --
]ccs.neu.edu |
|
 |
NEW: I am
organizing the FMCAD
2013 Student Forum, an opportunity for
graduate students to present their (possibly
early-stage, unfinished) research to the
Formal Methods community. The submission
deadline June 2.
NEW: I have several positions
for ambitious NEU undergraduate students
to participate in research projects. These
positions give you the chance to gain
initial experience in graduate-level
research, which will likely be beneficial
in job applications such as for Co-op. The
positions also provide financial support.
Before inquiring, check that you
- are an NEU CS or
ECE student, sophomore or above,
- have done very
well in introductory CS or ECE courses
(ideally, CS 2800),
- are willing to set
aside a non-trivial amount of time for
the research (e.g. you cannot be on
Co-op the semester you plan to work with
me), and
- bring the
enthusiasm necessary to take on stuff
that is likely far beyond what you have
been taught in classes so far.
If you
satisfy these criteria, send me an email
with a brief motivation statement.
What I've
been up to:
Conference program or organizing
committees:
Brief bio:
- 2011 - present: Assistant Professor,
Northeastern University, College of
Computer and Information Science
- 2009 - 2011: Research Assistant, Oxford
University, Department of Computer Science
(formerly "Computing Laboratory"), UK
- 2007 - 2009: Lecturer and Postdoc, Swiss
Federal Institute of Technology (ETH),
Zurich, Switzerland
- 2007, 2005: Ph.D. & M.S., University
of Texas, Austin (supervised by E. Allen
Emerson, who co-won the 2007
ACM
Turing Award)
- 1998: Invited Researcher, Advanced
Telecommunications Research (ATR), Nara,
Japan
- 1997: University Diploma in Informatics,
Würzburg, Germany
Awards:
General research interests:
- Software verification, such as using
predicate abstraction, SAT- and SMT
solvers, decision procedures,
interpolation;
- Infinite-state system verification, such
as modeling and analyzing arbitrarily
replicated multi-threaded programs via
counter systems and Petri nets;
- Automata theory in formal verification,
such as for LTL model checking
If you are a student and the above sound
appealing to you (or you think they do, but
you are not sure what they mean), read more
about my current research under the links
provided on the left. Then drop me an email or
come by.
Research sponsors:
|
|
