Douglas R. Troeger

Department of Computer Science

Education

A.B. (Philosophy), Brown University
Sc.B. (Chemistry), Brown University
M.S. (Mathematics), Stevens Institute of Technology
Ph.D, Stevens Institute of Technology.  Advisor: Stephen L. Bloom.  Thesis: Subdirectly Irreducible Iteration Theories
 

Experience

Department Chair (from 2000)

Current Principal, New York City Group Theory Cooperative, City College (from 2004)
Research Scientist, Center for Algorithms and Interactive Scientific Software, City College (from 2003)
Adjunct Professor, Computer Science, Stevens Institute of Technology (from 1998)
Doctoral Faculty, Computer Science, Graduate Center of the City University of New York (from 1991)

Assistant, then Associate Professor,  School of Computer and Information Science, Syracuse University.
Assistant Professor, Department of Pure and Applied Mathematics, Stevens Institute of Technology.
Senior Research Technician, then Chemist, Chemical Physics Division, Allied Chemical Corporation

Research Interests

Computational Group Theory, Computer Algebra, Functional Languages, Programming Language Semantics.

Recent Abstract

Recent Papers

Virtually Free-by-Cyclic One-Relator Groups. I., Aspects of Infinite Groups, World Scientific, B. Fine and G. Rosenberger eds. , to appear (with G. Baumslag)

Reflections on the Residual Finiteness of One-Relator Groups,  Groups, Geometry and Dynamics,  Vol.1 No. 3, pp. 209-219, 2007 (with G. Baumslag and C. F. Miller)

Recent Grant

Formal and Mathematical Foundations Grant ,   Parametric Computation in Axiom: Towards Indefinite Symbolic Computing, co-PI (NSF 2004 - 2006), with G. Baumslag, S. Cleary, T. Daly, and W. Sit

Earlier Journal Papers

The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System, CLEI Electronic Journal, Volume 5, Number 1, June 2002, Special Issue of Best Papers presented at  First Iberoamerican Conference on Software Engineering and Knowledge Engineering (with M. Morazan and M. Nash).
Step Bisimulation is Pomset Equivalence on a Parallel Language without Explicit Internal Choice, Mathematical Structures in Computer Science, Vol 3, pp. 25-62 (1993).

A Logical Characterization of Observation Equivalence, Theoretical Computer Science, Vol. 35, pp. 43-53, 1985 (with S.L. Bloom).

Weak Equivalence in a Class of Structured Program Schemes, Journal of Computer and System Sciences, Vol. 29, pp. 99-117 (1984).

An Axiomatization of D-Scheme Strong Equivalence, Journal of Computer and System Sciences, Vol. 27, pp. 221-224 (1983).

Metric Iteration Theories, Fundamenta Informaticae, Vol.5, pp. 187-216 (1982).

A Characterization of Congruences on Algebraic and Iteration Theories, Fundamenta Informaticae, Vol. 5, pp. 77-100 (1982)

Earlier Conference Papers - Research

Paging in a Distributed Virtual Memory, Trends in Functional Programming, Volume 3: Selected papers from the 3rd Scottish Functional Programming Workshop, August 2001 Kevin Hammond and Sharon Curtis, editors; Intellect, Bristol, UK, pp. 75 - 86 (with M. Morazan and M. Nash).

Designing an All-Software Based Distributed Virtual Memory: The Paging Performance of the MT Stack, Proc. 1st Ibero-American Symposium on Software Engineering and Knowledge Engineering (JIISIC'01), June 13-15, 2001, Buenos Aires, Argentina, pp. 109 -- 120 (with M. Morazan and M. Nash)

A Case Study of Lisp Memory Paging in a Distributed Virtual Memory System for Functional Languages, Proceedings of the Fifth Brazilian Symposium on Programming Languages, May 23 - 25, 2001, pages 80 - 95  (with M. Morazan).

The MT Architecture and Allocation Algorithm, Trends in Functional Programming, Volume 1: Selected Papers from the First Annual Scottish Functional Programming Workshop, University of Stirling, Bridge of Allan, Scotland, August 1999 (Phil Trinder, Greg Michaelson, and Hans-Wolfgang Loidl, editors; Intellect, pub.), pp. 96 -- 103 (With M. Morazan).

Earlier Book Chapter, Conference Papers, Panel and Invited Tutorial - Teaching and Mentoring

Structural Requisites for Undergraduate Mentoring at CCNY, Proceedings of the ADMI Symposium, May 29 -- June 1, 1997, Washington, D. C., pp 254 -- 261 (with J. Barba).

Formal Methods and Design, and Collaborative Learning, in the First Computer Science Course, invited chapter in the Volume: "Access and Empowerment: The Quantitative Gatekeeper Courses", E. Willemsen and J. Gainen, eds., New Directions for Teaching and Learning, Number 61, Spring 1995.

Formal Methods in the Undergraduate Computer Science Curriculum, Proc. 26th Annual SIGCSE Technical Symposium on Computer Science Education, Nashville, Tennessee, March 2 - 4, 1995, pp. 398 - 399 (with H. C. Cunningham, R. Davis and H. Walker)

Formal Methods in CS1, invited tutorial, Proc. 25th Annual SIGCSE Technical Symposium on Computer Science Education, Phoenix, Arizona, March 10-11, 1994, p. 378.

The Center for Minorities in Information Processing Systems at City College, Proceedings of the Engineering Pipeline National Conference, Houston, September 24-26, 1992, pp. 124-132, (with J. Barba).

Earlier Grants

Institutional Reform Grant,  co-Project Manager (NSF  1997 - 1999), with J. Barba, D. Gosser, D. Lemmons, E. Smiley, C. Watkins, D. Weiss, and Y. Moses.

Instrumentation and Laboratory  Infrastructure Grant,   Formal Methods and Object Oriented Programming, co-PI (NSF 1996 - 1998), with D. McCracken.

Model Institution for Excellence Planning Grant,  co-PI (NSF 1994 - 1995), with J. Barba.

Fund for the Improvement of Postsecondary Education    Formal Methods in the First Computer Science Course, PI  (U.S. Department of Education 1994 - 1997), with G. Bloom and S. Lucci.

Educational Infrastructure Grant   Formal Methods in Undergraduate Computer Science, Senior Investigator  (NSF 1993 - 1996), with R.Decker, S. Hirschfield, P. Mulry, C. Nevison and H. Walker.

Minority Institution Infrastructure Grant,   The Center for Minorities in Information Processing Systems, co-PI and co-Director (NSF 1991 - 1997), with J. Barba, M. Basu, and D. McCracken.

Workshops Organized

Teaching Formal Methods: Curriculum Development Workshop, at Hamilton College, Clinton, NY, July 30 - Agust 5, 1994 (NSF-sponsored, with P. Mulry and H. Walker)

Formal Methods in the Early Computer Science Curriculum: an Informal Workshop, at the Graduate Center of the City University of New York, September 16, 1995.  NSF and U.S. Department of Education sponsored (with D. Arnow).

Formal Methods in the Computer Science Curriculum, at Stevens Institute of Technology, July 24 -- 25, 1996 NSF sponsored  (with P. Mulry and H. Walker).

The 21st Century Engineering Consortium, Melbourne, Fla, March 18 -- 19, 1998, U.S. Airforce sponsored (with P. Alexander,      B. Andriamanalimanana, A.  Barbour, S. Chin , G. Gopalakrishnan,  S. Johnson , M. Nassif, R.Paragi , and P. Windley).

Doctoral Student

Marco Morazan, Department of Mathematics and Computer Science, Seton Hall University.  Thesis: Towards Fast Functional Languages via Distributed Virtual Memory, CUNY, September 1999.
 

Courses Taught

I have conducted classes at City College, the Graduate Center of the City University, Syracuse University, Stevens Institute of Technology and the off-campus centers of Syracuse University at IBM Endicott, IBM Poughkeepsie and Rome Air Force Base.  Courses taught include Algorithms, Automata and Formal Languages, Calculus, Computability, Computer Architecture, Data Structures, Introduction to Computer Science, Mathematical Logic, Operating Systems, Programming Languages, Programming Language Paradigms, Software Design, and a variety of graduate courses having to do with programming language semantics and its application to program proving, specification and transformation.

Professional Societies

Association for Computing Machinery, European Association for Theoretical Computer Science, and the Mathematical Association of America.