Back to Elsa Gunter's Home Page.
REFEREED PUBLICATIONS
- Carl A. Gunter, Elsa L. Gunter, Michael Jackson, and Pamela Zave.
A reference model for requirements and specifications.
IEEE Software, 2000.
To appear,
(
postscript,
postscript of expanded version,
postscript of ICRE2000 extended abstract,
short abstract).
- 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-Verlag LNCS.
(
postscript,
abstract)
- 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-Verlag LNCS.
(
postscript,
abstract)
- 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-Verlag LNCS.
(
postscript,
abstract)
- 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.
(
postscript,
abstract)
- Elsa L. Gunter and Amy Felty, editors.
Tenth International Conference on Theorem Proving in Higher
Order Logics, volume 1275.
Springer-Verlag LNCS, August 1997.
- Elsa L. Gunter and Savitri Maharaj.
Studying the ML module system in HOL.
The Computer Journal, 38(2):142-151, 1995.
(
postscript,
abstract)
- 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 LNCS, September 1995.
(
postscript,
abstract)
- 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 LNCS, September 1994.
(
postscript,
abstract)
- 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 LNCS,
September 1994.
(
postscript,
abstract)
- 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 LNCS, February 1994.
(
postscript,
abstract)
- 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 LNCS, February 1994.
(
postscript,
abstract)
- 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.
(
postscript,
abstract)
- Elsa L. Gunter.
Why we can't have SML style datatype declarations in HOL.
In L. J. M. Claesen 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.
(
postscript,
abstract)
- 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-Verlag LNCS.
(
postscript,
abstract)
- 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.
(
postscript,
abstract)
- 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 LNCS, July 1990.
- 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 LNCS, 1989.
(
postscript,
abstract)
- 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 LNCS, December 1989.
(
postscript,
abstract)
- 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.
(
postscript,
abstract)
- Elsa L. Gunter.
M-groups with Sylow towers.
Proceedings of the American Mathematical Society,
105(3):555-563, March 1989.
- A. Felty, E. Gunter, J. Hannan, D. Miller, G. Nadathur, and A. Scedrov.
-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 LNCS, May 1988.
- Elsa L. Gunter.
Pseudo-Monomial Characters and Pseudo-M-Groups.
PhD thesis, University of Wisconsin - Madison, January 1987.
Back to Elsa Gunter's Home Page.
Elsa Gunter
2000-01-03