Curriculum Vitae
15 December 1999
Formal Methods; design and use of automated and interactive theorem provers; mathematical semantics of programming languages; software engineering; proof theory and type theory; order theory; finite solvable group theory.
ADDRESSES
| Office: | Bell Laboratories,
Lucent
Technologies, 600 Mountain Ave, Room 2C-481, Murray Hill, New Jersey
07974-0636, USA.
Email:elsa@research.bell-labs.com, Webpage: /who/elsa/index.html, Fax: +1 908 582 5857 Phone: +1 908 582 5613 |
| Home: | 1921 Panama Street, Philadelphia, PA 19103-6609, U.S.A. Phone: +1 215 732 7493 |
PERSONAL
Born 19 October, 1958 in Providence, R.I. Citizen of the United States.
Married to Carl A. Gunter.
EDUCATION
| Ph.D.: Mathematics, University of Wisconsin, Madison, January 1987, Thesis entitled Pseudo-Monomial Characters and Pseudo-M-Groups, Research Supervisor: I. Martin Isaacs; M.A.: Mathematics, University of Wisconsin, Madison, May 1981; B.A.: Mathematics, University of Chicago, June 1979 |
RESEARCH POSITIONS
| Fourth Annual HOL Users Meeting (1991); Lambda Prolog Workshop (1992); Fifth Annual HOL Users Meeting (1992); Twelfth Conference on Automated Deduction (CADE 1994); Seventh International Workshop on Higher Order Logic Theorem Proving and its Applications (1994); Eighth International Workshop on Higher Order Logic Theorem Proving and its Applications (1995); Ninth International Conference on Theorem Proving in Higher Order Logics (TPHOLs'96); Tenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs'97) (Chair); Eleventh International Conference on Theorem Proving in Higher Order Logics (TPHOLs'98); Twelfth International Conference on Theorem Proving in Higher Order Logics (TPHOLs'99); Thirteenth International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2000). | |
| Numerous journal articles, and NSF proposals; Member of an external review board for the Formal Methods department at TeleDanmark (1994); Member of NSF workshop on the future of automated deduction (1996) |
PATENT APPLICATIONS
| The focus of my research has been and continues to be on theorem proving with an automated assistant, and its application to reasoning about protocols, programs and programming language semantics. Theorem provers capable of supporting general mathematical reasoning offer the greatest flexibility for developing programming language semantics and for proving properties of programs. However, to be truly useful for such applications, much specialized infrastructure must be available as well. For the immediate future, I plan to apply automated theorem proving to reasoning about domain specific languages, particularly ones for networking and security. To support such reasoning, I plan to work on better integration of HOL90, or a related theorem prover, with model checkers, such as Mocha and SPIN. |
REFEREED PUBLICATIONS
Upon request.