Software verification is not dead, but it needs a new way to express mathematics (with W. F. Ogden)
Proceedings of the RESOLVE Workshop. 2006. 

A project approach to programming language theory
in Proceedings of the CCSC:MW Conference. 2006.

Constructing an Efficient and Easily Distributable Virtual Tour (with N. Schmidt)
in Proceedings of MCURCSM, October 2005. 

Profiles: A Compositional Mechanism for Performance Specification (with W. F. Ogden and M. Sitaraman)
in Technical Report RSRG-04-03, Department of Computer Science, Clemson University, Clemson, SC 29634-0974, June 2004.

Multiple implementations for component based software using Java interfaces
in The Journal of Computing Sciences in Colleges 19(1). 2003. 

Essential Mathematics for Computer Science (with Todd Feil)
Prentice-Hall. 2003. 

Derivation Schemes in Twin Open Set Logic (with M. Westmoreland)
in Collsion-Based Computing, A. Adamatzky, editor, Springer-Verlag, 201-229,
2002.

When Theory Meets Practice:  Enriching the CS Curriculum through Industrial Case Studies
in Proceedings of the 15th Conference on Software Engineering Education and Training, February 2002. 

Performance Specification of Reusable Software Components (with M. Sitaraman)
in Proceedings of ACM Symposium on Software Reusability, May 2001.

Incorporating Mathematics into the First Year CS Program:  A New Approach to CS2 (with T. Feil)
in Proceedings of the Midwest Computing Conference, September 2001.

Modular Verification of Performance Correctness (with W.F.Ogden and M. Sitaraman)
in Proceedings of Specification and Verification Workshop at OOPSLA, October 2001.

Collision models for multiple-value logic gates (with M. Westmoreland)
in Multiple-Valued Logic journal, June 2000. 

Teaching and Learning through Industrial Partnerships
accepted by the Conference on College Teaching and Learning , April 1999.
(an invited paper).

Phase Space Logics for analysis of physical models of computation (with M. Westmoreland)
in PhysicaD, fall, 1998. 

There's a Better Way to Define the Correct Realization Notion (with W. Ogden)
in Proceedings of the Workshop on Reusable Software, March 1997.

Symbolic Computation in CS2
in Proceedings of International Conference on Computers in Education, June 1996.

Use of Laboratories in Computer Science Education: Guidelines for Good Practice (with others)
in Journal for SIGCSE, October 1996.   Applications of Non-Standard Logic to the Billiard Ball Model of Computation (with M. Westmoreland)
in Proceedings of PhysComp, November 1996.

Using Symbolic Computation for Teaching Data Structures and Algorithm Analysis
in SIGCSE Bulletin, December 1996. 

Trees as Inductive Structures
in Computer Science Education Journal, Winter, 1994.

Implementing Components in RESOLVE (with P. Bucci, J. Hollingsworth, and B. Weide)
in ACM Software Engineering Notes, October 1994.

A Modular System for Verification of Functionality and Performance
Correctness
in West Virginia University TR 93-5, May 1993.

On Modularity and Tightness of Real-Time Verification (with M. Sitaraman)
in Tenth IEEE Workshop on Real-Time Operating Systems and Software, pages 109-115. May 1993.

Student Designed Machines for A Theory of Computation Course
in SIGCSE Bulletin, September 1992.

Proof Rules for Modules
in OSU-CISRC-3/90TR7, March 1990.  

Termination Rules for While Loops and Recursive Procedures
in OSU-CISRC-10/89 TR 48, October 1989.

Thesis: The Role of Verification in Software Reusability
1988.