Elsa L. Gunter

Curriculum Vita

10 January 2000

RESEARCH INTERESTS

Software engineering; formal methods; design and use of automated and interactive theorem provers; mathematical semantics of programming languages; 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, 
Phone: +1 908 582 5613     Fax: +1 908 582 5857
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

SYSTEMS DESIGN AND IMPLEMENTATION TEACHING EXPERIENCE TEACHING APPROACH TEACHING INTERESTS STUDENT SUPERVISIONS PROGRAM COMMITTEES AND OTHER REFEREEING
        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

RESEARCH GRANTS RESEARCH PROGRAM
        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 am working on better integration of HOL90, and possibly related theorem provers, with model checkers, such as Mocha and SPIN.

REFEREED PUBLICATIONS

1.
Carl A. Gunter, Elsa L. Gunter, Michael Jackson, and Pamela Zave.

A reference model for requirements and specifications.
IEEE Software, 2000.
To appear, ftp address: www.cis.upenn.edu/~hol/papers/refmod.ps.
2.
Elsa Gunter and Doron Peled.

Path exploration tool.
In Rance Cleaveland, editor, Tools and Algorithms for Construction and Analysis of Systems, 5th International Conference, TACAS '99, volume 1579 of Lecture Notes in Computer Science, pages 405-419, Amsterdam, The Netherlands, 1999. Springer.
3.
Elsa L. Gunter.

Adding external decision procedures to HOL90 securely.
In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics 11th International Conference TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 143-152, Canberra, Australia, September 1998. Springer.
4.
Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gunter, Michael Jackson, Davor Obradovic, and Pamela Zave.

The Village Telephone System: A case study in formal software engineering.
In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics 11th International Conference TPHOLs '98, volume 1479 of Lecture Notes in Computer Science, pages 49-66, Canberra, Australia, September 1998. Springer.
5.
Elsa L. Gunter.

Building hol90 everywhere easily (well almost).
In Jim Grundy and Malcolm Newey, editors, Theorem Proving in Higher Order Logics: Emerging Trends, 11th International Conference, TPHOLs'98, Supplementary Proceedings, volume 98-08 of Joint Computer Science Technical Report, pages 85-94, Canberra, Australia, September 1998. Dept of CS, Fac of Engr and Inf Tech Comp Sci Lab, Research Sch of Inf Sci's and Engr.
6.
Elsa L. Gunter and Amy Felty, editors.

Tenth International Conference on Theorem Proving in Higher Order Logics, volume 1275. Springer-Verlag Lecture Notes in Computer Science, August 1997.
7.
Elsa L. Gunter and Savitri Maharaj.

Studying the ML module system in HOL.
The Computer Journal, 38(2):142-151, 1995.
8.
Elsa Gunter and Leonid Libkin.

Interfacing hol90 with a functional query language.
In E.T. Schubert, editor, Proc. of the Internat. Workshop on Higher Order Logic Theorem Proving, volume 971, pages 328-339. Springer-Verlag, Lecture Notes in Computer Science, September 1995.
9.
Elsa L. Gunter and Savitri Maharaj.

Studying the ML module system in HOL.
In Thomas F. Melham and Juanito Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, volume 859 of Lecture Notes in Computer Science, pages 346-361. Springer-Verlag, September 1994.
10.
Elsa L. Gunter and Leonid Libkin.

OR-SML: A functional database programming language for disjunctive information and its applications.
In D. Karagiannis, editor, Proceedings of 5th International Conference on Database and Expert Systems Applications (DEXA'94), volume 856 of Lecture Notes in Computer Science, pages 641-650. Springer-Verlag, September 1994.
11.
Elsa L. Gunter.

A broader class of trees for recursive type definitions for HOL.
In Jeffery Joyce and Carl Seger, editors, Higher Order Logic Theorem Proving and Its Applications, volume 780 of Lecture Notes in Computer Science, pages 141-154. Springer-Verlag, February 1994.
12.
Elsa L. Gunter and Myra VanInwegen.

HOL-ML.
In Jeffery Joyce and Carl Seger, editors, Higher Order Logic Theorem Proving and Its Applications, volume 780 of Lecture Notes in Computer Science, pages 61-73. Springer-Verlag, February 1994.
13.
C. A. Gunter, E. L. Gunter, and D. B. MacQueen.

Computing ML equality kinds using abstract interpretation.
Information and Computation, 107(2):303-323, December 1993.
14.
Elsa L. Gunter.

Why we can't have SML style datatype declarations in HOL.
In L. J. M. Claese and M. J. C. Gordon, editors, Higher Order Logic Theorem Proving and Its Applications, volume A-20 of IFIP Transactions, pages 561-568. North-Holland Press, September 1992.
15.
Carl A. Gunter, Elsa L. Gunter, and David B. MacQueen.

An abstract interpretation for ML equality kinds.
In T. Ito and A. R. Meyer, editors, Theoretical Aspects of Computer Software International Conference TACS '91, volume 526 of Lecture Notes in Computer Science, pages 112-130, Sendai, Japan, September 1991. Springer.
16.
Richard Gerber, Elsa L. Gunter, and Insup Lee.

Implementing a real-time process algebra in HOL.
In Myla Archer, Jeffery J. Joyce, Karl N. Levitt, and Philip J. Windley, editors, HOL Theorem Proving System and Its Applications, pages 144-154. IEEE Computer Society Press, August 1991.
17.
Amy Felty, Elsa L Gunter, Dale Miller, and Frank Pfenning.

Tutorial on lambda prolog.
In Mark E Stickel, editor, 10th International Conference on Automated Deduction Proceedings, Lecture Notes in Computer Science, page 682. Springer-Verlag, July 1990.
18.
Elsa L. Gunter.

Pseudo-retract functors for local lattices and bifinite l-domains.
In Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science. Springer-Verlag, 1989.
19.
Elsa L. Gunter.

Extensions to logic programming motivated by the construction of a generic theorem prover.
In P. Schoeder-Heister, editor, Extension of Logic Programming, volume 475 of Lecture Notes in Artificical Intelligence, pages 223-245. Springer-Verlag, December 1989.
20.
Elsa L. Gunter.

HOL case study: Modular arithmetic.
In Michael J. C. Gordon, editor, The HOL System: Tutorial, volume 2, chapter 9, pages 233-345. Cambridge Research Centre, SRI International, 1989.
21.
Elsa L. Gunter.

M-groups with Sylow towers.
Proceedings of the American Mathematical Society, 105(3):555-563, March 1989.
22.
A. Felty, E. Gunter, J. Hannan, D. Miller, G. Nadathur, and A. Scedrov.

$\lambda$-prolog: an extended logic programming language.
In E Lusk and R Overbeek, editors, 9th International Conference on Automated Deduction Proceedings, Lecture Notes in Computer Science, pages 754-755. Springer-Verlag, May 1988.
23.
Elsa L. Gunter.

Pseudo-Monomial Characters and Pseudo-M-Groups.
PhD thesis, University of Wisconsin - Madison, January 1987.
REFERENCES

Upon request.



Elsa Gunter