Vita Summary
David A. Schmidt
University Distinguished Professor Emeritus
Department of Computing and Information Sciences
Kansas State University
 Address:
 Engineering Hall
Manhattan, KS 66506 USA
Office telephone: +17855327912; fax: +17855327353
Home telephone: +17855371933
URL:
http://www.cis.ksu.edu/~schmidt;
Email: das at ksu.edu
Education

B.A., Mathematics, Fort Hays (Kansas) State University, 1975

M.S., Computer science, Kansas State University, 1977

Ph.D., Computer science, Kansas State University, 1981.
Advisor: Neil D. Jones; thesis title:
Compiler generation from lambda calculus definitions of programming
languages

Postdoctoral study, Computer science, Edinburgh University, Scotland, 198283.
Postdoctoral advisor: Robin Milner
Employment

Kansas State University, Manhattan, Kansas: Assistant professor,
computer science, June 1986July 1988; associate professor,
August 1988July 1994; professor, August 1994July 2003;
university distinguished professor, August 2003August 2015;
professor emeritus, September 2015.

Iowa State University, Ames, Iowa: Assistant professor, computer science,
Aug. 1984May 1986

University of Edinburgh, Edinburgh, Scotland: SERC research fellow,
computer science, Jan. 1982Dec. 1983

University of Aarhus, Aarhus, Denmark: Research asst., computer science,
Aug. 1979June 1980
Research interests

denotational and operational semantics

applications of abstract interpretation to
program analysis and validation
Research funding awards

Principal investigator, NSF CNS1219746,
Abstract semantic processing for script security,
September 2012  August 2015,
$226,935.

Principal investigator, NSF CNS0939431,
Abstract Parsing: Static analysis of dynamically
generated string output,
August 2009July 2012,
$299,327.

Subcontract principal investigator, with Alex Aiken, Thomas Henzinger,
George Necula, Ras Bodik, and David Wagner, Univ. California, Berkeley,
and Anindya Banerjee, KSU, NSF ITR0326577,
Languagebased software security,
October 2003September 2009, $135,000.
(Award total is $900,000.)

Subcontract principal investigator, with Alex Aiken, Thomas Henzinger,
and George Necula, Univ. California, Berkeley, NSF ITR0085949,
The Open Source Quality Project, Sept 2000Aug 2003, $245,823.
(Award total is $2,499,923.)

Subcontract principal investigator, with Daniel Jackson and Martin Rinard,
MIT, NSF ITR0086154,
Design Conformant Software, Sept 2000Aug 2005, $463,600.
(Award total is $3,700,000.)

Principal investigator,
NSF CCR9970679,
Static Analysis Based on Model Checking,
Sept. 1, 1999August 31, 2001,
$110,000.

Coprincipal investigator, with Matthew Dwyer and John Hatcliff,
NSF INT9981558,
Integrating Platforms for FiniteState Verification,
April 2000March 2002, $15,467.

Coprincipal investigator, with Matthew Dwyer and John Hatcliff,
NASA NAG21209,
Model Construction for FiniteState Verification,
April 1998March 2000, $440,000.

Coprincipal investigator, with Matthew Dwyer, Brian Howard, and Allen Stoughton,
National Science Foundation/DARPA Grant CCR9633388,
Logical Support for HighAssurance Software Evolution,
September 1996August 1998, $200,000.

Coprincipal investigator, with Allen Stoughton,
Office of Naval Research Grant N000149410866,
Type Theories in ML,
June 1994March 1996, $130,000.
Supplement, March 1996November 1996, $60,000.

Coprincipal investigator, with Allen Stoughton,
National Science Foundation Grant CCR9302962,
Analysis and Classification of Programming Languages,
September 1993January 1997, $221,000.

Coprincipal investigator, with Olivier Danvy,
National Science Foundation Grant CCR9102625,
Action Semantics and Partial Evaluation,
June 1991November 1993, $157,368.

Visiting fellow, University of Edinburgh,
Science and Engineering Research Council (Great Britain) Grant GR/G55464,
August 1991, 2,280 pounds sterling.

Principal investigator, National Science Foundation Grant INT9014042,
NSFINRIA Collaborative Program (travel),
March 1991 August 1994, $14,865.

Principal investigator, National Science Foundation Grant CCR8822378,
SemanticsDirected Compiler Synthesis,
June 1989 November 1991,
$157,000.

Coprincipal investigator, with A.C. Melton and G.E. Strecker, National
Science Foundation Grant DCR8604080,
Programming Language Semantics and Galois Connections,
July 1986 March 1988,
$121,000.
Funded Visiting Positions

École Polytechnique, Palaiseau, 200304

IRISA, Rennes, France, 2004

École Normale Superieure d'Ulm, Paris, 1998 and 2006

Aarhus University, Denmark, 1997

University of Glasgow, Scotland, 1989 and 1995

University of Copenhagen, Denmark, 1987 and 1993

Edinburgh University, Scotland, 1991 and 1992
Teaching Activities
Undergraduate:

Introductory computing 197677, 1984, 1986, 199799, 200508

Data structures 200005

Business data processing 1976

Discrete mathematics 1993

Logical foundations of programming 199396, 200812, 2014

Programming methodology and algorithms 1978

Software architecture 201314

Programminglanguage principles 1981, 1984, 1986, 1988, 2009, 2011, 2012, 2014

Denotational semantics 1982, 1983
Graduate:

Programming language principles 198690, 1990, 1992, 1993, 1995, 1996, 2011, 2012, 2013, 2014

Compiler construction 1981, 1984, 1989, 1992

Computability theory 1995

Operating systems 1981

Denotational semantics 1981, 1986, 1987, 199092

Data flow analysis 1987

Implementation of functional programming languages 1989

Mathematical logic 1991

Static analysis 2005
Supervising Activities
Postdoctoral students (funded by me)

SeWon Kim, Hanyang University, Jan.Feb. 2012.

Brian Howard, Stanford University, June 1994July 1996.

Juergen Koslowski, MacAllister University, Minnesota,
Aug. 1991Dec. 1992.

Michael Huth,
Tulane University, Aug. 1991June 1992.

Pascal Fradet, University of Rennes, France,
January 1988June 1990.
Ph.D. students

ElodieJane Sims, joint with École Polytechnique, France:
Pointer analysis and separation logic, 2007.

Gurvan le Guernic, joint with Univ. of Rennes, France:
Confidentiality enforcement using dynamic informatin flow analysis, 2007.

Husain Ibraheem,
Specification and implementation of a framework for
modular static program analysis, 1998.

Anindya Banerjee,
Binding principles in Algollike languages, 1995.

Adrian Fiech,
A denotational model for polymorphic lambda calculus with subtyping,
1993.

Karoline Malmkjaer,
Abstract interpretation of partial evaluation algorithms,
1993.

KyungGoo Doh,
Action semanticsdirected prototyping,
1992.

Dean Lass,
Detection of singlethreading properties in combinator notations,
1991.

Susan Even,
Type inference for action semantics,
1990.
Service Activities

Steering Committee Member:

Association for Computing Machinery Symposia for
Principles of Programming Languages (POPL), 200204

European Symposia on Theory and Practice of Computer Software (ETAPS),
200304

Conferences on Verification, Model Checking, and Abstract Interpretation (VMCAI), 2002

Static Analysis Symposia (SAS), 1996

Conferences on Mathematical Foundations of Programming Language Semantics
(MFPS), 19872003

Journal advisory board member:
Journal of Higher Order and Symbolic Computation

Editorial board member: Journal on Foundations and Trends in Programming Languages

General Chair:

Workshop on 30 years of Abstract Interpretation, San Francisco,
January 2008 (cochair with Roberto Giacobazzi)

Dagstuhl Seminar 03101: Reasoning about Shape, Schloss Dagstuhl, Germany,
2003 (cochair with Hanne Riis Nielson and Markus M"ullerOlm)

ACM Symposium Principles of Programming Languages, London, 2001
(cochair with Chris Hankin).

Static Analysis Symposium, Santa Barbara, California, 2000.

IEEE International Conference on Computer Languages, Chicago, 1998.

Conference on Mathematical Foundations
of Programming Semantics, New Orleans, 1987 (cochair with Mike Mislove),
2001 (cochair with Olivier Danvy and Mike Mislove).

Program Committee Chair:

Static Analysis Symposium, Deauville, France, 2012 (cochair with Antoine Miné)

Conference on Verification, Model Checking and Abstract Interpretation, 2011
(cochair with Ranjit Jhala)

European Symposium on Programming, Barcelona, 2004

Static Analysis Symposium, Aachen, Germany, 1996 (cochair with Radhia Cousot)

ACM Conference on Partial Evaluation and SemanticsBased
Program Manipulation, Copenhagen, 1993

Conference on Mathematical Foundations
of Programming Semantics, New Orleans, 1989 (cochair with Mike Mislove)

Program Committee Member:

Foundations of Computation Theory, 2007

Foundations of Software Science and Computation Structures, 2006

Asian Symposium on Programming Languages and Systems, 2005

International Conference on Automata, Languages, and Programming, 2002, 2008

Symposium on Computer Science Logic, 2004

International Conference on Software Engineering, 1999

Workshop on Practical Aspects of Declarative Languages, 1999

Static Analysis Symposium, 1998, 1999, 2000, 2001, 2007, 2008, 2012

Verification, Abstract Interpretation, and
Model Checking, 1998, 2001, 2002, 2004, 2010, 2011

European Symposium on Programming, 1998, 2002, 2003, 2004, 2005, 2012

IEEE International Conference on Computer Languages, 1994, 1998

Conference on Coordination Models and Languages, 1997

ACM Symp. Principles of Programming Languages, 1997

International Andrei Ershov Memorial Conference:
Perspectives of System Informatics,
1996, 1999, 2001, 2003, 2006, 2009, 2011

Conference on
Partial Evaluation
and SemanticsBased
Program Manipulation, 1991, 1993, 1995

Mathematical Foundations of Computer Science, 1993

Conference on Mathematical Foundations
of Programming Semantics, 1985, 1987, 1989, 1991

Workshop on Numerical and Symbolic Abstract Domains, 2005

Workshop on Algebraic Methodologies in Software
Technology, 1989, 1991

Local Arrangements Chair:

Tenth Conference on Mathematical Foundations of
Programming Semantics, Manhattan, Kansas, 1994.

Static Analysis Symposium, Santa Barbara, California, 2000.
Selected committee assignments:

Member, Departmental Undergraduate Studies Committee, 2003present

Member, Departmental Graduate Studies Committee, 19861994; committee head,
199294.

Departmental liaison to Farrell Library, 19861996.

Member, University Library Committee, 19871993.
Publications
(Note: My DBLP listing is available at
www.informatik.unitrier.de/~ley/db/indices/atree/s/Schmidt%3ADavid_A=.html
and my Google Scholar listing is at
http://scholar.google.com/scholar?hl=en&lr=&q=David+Schmidt&btnG=Search.
You'll pick up a few more papers by trying
http://scholar.google.com/scholar?hl=en&lr=&q=David+A+Schmidt&btnG=Search)

Authored textbooks:

Schmidt, D.A.
The Structure of Typed Programming Languages.
MIT Press, Cambridge, MA, 367 pages, 1994.

Schmidt, D.A.
Denotational Semantics: A Methodology for Language Development.
Allyn and Bacon, Inc., Boston, MA,
331 pages, 1986.

Schmidt, D.A.
Programming Principles in Java: Architectures and Interfaces.
ScottJones Publishers, Half Moon Bay, CA. Accepted for publication
but never printed at my request (I've given up on book publishers):
http://www.cis.ksu.edu/~schmidt/CIS200/home.html

Online undergraduate texts:

CS1, Pythonbased:
http://people.cis.ksu.edu/~schmidt/200s08/Lectures/

CS2 (data structures, Javabased):
http://people.cis.ksu.edu/~schmidt/300s05/Lectures/

Logical foundations of programming (Hoare logic and predicate logic):
http://people.cis.ksu.edu/~schmidt/301s14/Lectures/

Programminglanguage paradigms:
http://people.cis.ksu.edu/~schmidt/505f14/
Selected Edited Conference Proceedings:
Miné, Antoine, and Schmidt, D.A., editors.
Proc. Static Analysis Symposium.
Lecture Notes in Computer Science 7460, SpringerVerlag, Berlin, 2012
Jhala, R., and Schmidt, D.A., editors.
Proc. 12th International Conference on Verification, Model Checking, and Abstract Interpretation, Austin, TX,
Lecture Notes in Computer Science 6538, SpringerVerlag, 2011.
Schmidt, D.A., editor.
Proc. 2004 European Symposium on Programming,
Barcelona.
Lecture Notes in Computer Science 2986, SpringerVerlag, 2004.
Mogensen, T., Sudborough, I.H., and Schmidt, D.A.
The Essence of Computation: Complexity, Analysis, Transformation.
Lecture Notes in Computer Science 2566, SpringerVerlag, Berlin,
2002.
Cousot, R., and Schmidt, D.A., editors.
Proc. Third Static Analysis Symposium.
Lecture Notes in Computer Science 1145, SpringerVerlag, Berlin, 1996.
Brookes, S., Main, M., Melton, A., Mislove, M., and Schmidt, D.A., editors.
Proc. Ninth Conference on Mathematical Foundations of Programming
Semantics.
Lecture Notes in Computer Science 802, SpringerVerlag, Berlin, 1994.
Schmidt, D.A., editor.
Proc. ACM Symposium on Partial Evaluation and SemanticsBased Program
Manipulation.
Copenhagen, ACM Press, 1993.
Brookes, S., Main, M., Melton, A., Mislove, M., and Schmidt, D.A., editors.
Proc. Seventh Conference on Mathematical Foundations of Programming
Semantics.
Lecture Notes in Computer Science 598, SpringerVerlag, Berlin, 1992.
Journal Issues (Guest Editor):
Theoretical Computer Science, 1997. Special issue for
Tenth Conference on Mathematical Foundations of Programming Semantics.
Coeditor with Mike Mislove.
Science of Computer Programming, Vol. 35, 1999. Special issue for
Third Static Analysis Symposium. Coeditor with Radhia Cousot.
Selected Refereed and Invited papers:
(Note: papers from 1997 onwards
are available from
http://www.cis.ksu.edu/~schmidt/papers)
Schmidt, D.A. Guards, Failure, and Partiality: Dijkstra's GuardedCommand Language Formulated Topologically. In Semantics, Logics, and Calculi, C. Probst, C. Hankin, and R.R. Hansen, eds., Springer LNCS 9560, pp. 252271, 2016.
Kim, H., Doh, K.G., and Schmidt, D.A. Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing In Proc. 20th Static Analysis Symposium (SAS'13), M. Fahndrich and F. Logozzo, eds., Springer LNCS, 2013.
Doh, K.G., Kim, H., and Schmidt, D.A.
Abstract LRparsing.
In
Formal Modeling: Actors; Open Systems, Biological Systems: Festschrift for
Carolyn Talcott.
Springer LNCS 7000, 2011.
Schmidt, D.A.
InverseLimit and Topological Aspects of
Abstract Interpretation.
Theoretical Computer Science 540 (2012) 2342.
Schmidt, D.A.
Denotational semantics.
In 2012 Yearbook of Science and Technology,
McGrawHill, New York, 2012.
Doh, K.G., and Schmidt, D.A.
An action semantics based on two combinators.
In Semantics and Algebraic Specification,
J. Palsberg, ed. Springer LNCS 5700, 2009, pp. 274296.
Doh, K.G., Kim, H., and Schmidt, D.A. Abstract parsing:
static analysis of dynamically generated string output
using LRparsing technology.
Proc. 16th Static Analysis Symposium, Los Angeles,
August 2009, Springer LNCS 5673, pp. 256272.
Schmidt, D.A. Abstract interpretation from a topological perspective.
Proc. 16th Static Analysis Symposium, Los Angeles, August 2009, Springer LNCS 5673,
pp. 293308.
Schmidt, D.A.
Abstract interpretation from a denotational semantics perspective.
Proc. 25th Conf. Mathematical Foundations of Programming Semantics,
Oxford, Elsevier ENTCS
249 (2009) 1937.
Schmidt, D.A.
Internal and external logics of abstract interpretations.
Proc. Conf. Verification, Model Checking, and Abstract Interpretation (VMCAI'08),
Springer LNCS 4905, January 2008, pp. 263278.
Schmidt, D.A. Extracting program logics from abstract interpretations
defined by logical relations.
Proc. 23d Conf. Math. Foundations Prog. Semantics, Elsevier ENTCS 173(2007) 339356.
Le Guernic, G., Banerjee, A., Jensen, T., and Schmidt, D.A.
AutomataBased Confidentiality Monitoring.
Proc. 11th Asian Computing Science Conference on Secure Software
(ASIAN'06), Tokyo, Dec. 2006, Springer LNCS 4435.
Schmidt, D.A.
StateTransition Machines, Revisited.
J. Higher Order and Symbolic Computation 20 (2007) 319332.
Schmidt, D.A.
StateTransition Machines for LambdaCalculus Expressions.
J. Higher Order and Symbolic Computation 20 (2007) 333335.
Schmidt, D.A.
Comparing completeness properties of static analyses and their logics.
Proc. 2006 Asian Programming Languages and Systems Symposium (APLAS'06).
N. Kobayashi, ed. Springer LNCS 4279, pp. 183199.
Schmidt, D.A.
Underapproximating predicate transformers.
Proc. 2006 Static Analysis Symposium,
K. Yi, ed., Springer LNCS 4134, 2006, pp. 127143.
Schmidt, D.A.
A calculus of logical relations for over and underapproximating
static analyses.
Science of Computer Programming 641(2007) 2953.
Schmidt, D.A.
Closed and logical relations for over and underapproximation of powersets.
Proc.2004 Static Analysis Symposium,
R. Giacobazzi, ed., Springer LNCS, 3148, 2004, pp. 2237.
Huth, M.R.A., Jagadeesan, R., and Schmidt, D.A.
A domain equation for refinement of partial systems.
Mathematical Structures in Computer Science 144 (2004) 469505.
Schmidt, D.A.
Programming language semantics.
In
Computer Science Handbook, 2d ed.
Allen Tucker, ed.,
Chapman and Hall/CRC Press, Boca Raton, FL, 2004, pp. 98.198.19.
Schmidt, D.A.
Binary Relations for Program Abstraction.
In The Essence of Computation: Complexity, Analysis, Transformation,
Torben Mogensen, et al., eds. Springer LNCS 2566, 2002, pp. 245265.
Fiech, A., and Schmidt, D.A.
Polymorphic Lambda Calculus and Subtyping.
Theoretical Computer Science
278, 12 (2002) 111140.
Schmidt, D.A.
From Trace Sets to Modal Transition Systems by Stepwise Abstract Interpretation.
To appear, Proceedings Workshop on StructurePreserving Relations,
Amagasaki, Japan, 2001.
Masami Hagiya, Yoshiki Kinoshita, and John Power, eds.
Elsevier Electronic Notes in Theoretical Computer Science.
Schmidt, D.A.
Should UML Be Used for Declarative Programming?
Proc. ACM Conf. on Principles and Practice of Declarative Programming,
Florence, September 2001, pp. 13.
Huth, M., Jagadeesan, R., and Schmidt, D.A.
Modal transition systems: a foundation for threevalued program analysis.
European Symposium on Programming 2001, Genoa, Springer LNCS, pp 155169.
Schmidt, D.A.
Induction, Domains, Calculi: Strachey's Contributions to
ProgrammingLanguage Engineering.
Journal of Higher Order and Symbolic
Computation
131/2 (2000) 89102.
Schmidt, D.A.
Binary relations for abstraction and refinement. To
appear, Proc. Workshop on Refinement and Abstraction, Amagasaki, Japan, 1999,
M. Hagiya, Y. Kinoshita, and J. Power, eds.
Elsevier Electronic Notes in Theoretical Computer Science.
M"ullerOlm, M., Schmidt, D.A. and Steffen, B.
Model checking: a tutorial introduction.
Proc. 6th Static Analysis Symposium, G. File' and A. Cortesi, eds.,
Springer LNCS
1694, 1999, pp. 330354.
Schmidt, D.A.
A Return to Elegance: The Reapplication of Declarative Notation to
Software Design.
Proc. Workshop on Practical Aspects of Declarative Languages,
G. Gupta, ed., Springer LNCS 1551, 1999, pp. 360364.
Schmidt, D.A. and Steffen, B.
Dataflow analysis as model checking of abstract interpretations.
Proc. 5th Static Analysis Symposium, G. Levi. ed.,
Springer LNCS 1503, 1998.
Schmidt, D.A.
Dataflow analysis is model checking of abstract interpretations.
Proc. 25th ACM Symposium on Principles of Programming Languages,
San Diego, 1998.
Schmidt, D.A.
Tracebased abstract interpretation of operational semantics.
J. Lisp and Symbolic Computation 103 (1998) 237271.
Ibraheem, H., and Schmidt, D.A.,
Adapting BigStep Semantics to SmallStep Style: Coinductive
Interpretations and ``HigherOrder'' Derivations.''
Proc. 2d Workshop on HigherOrder Techniques in Operational Semantics,
C. Talcott, ed., Palo Alto, CA, Dec. 1997.
Elsevier Electronic Notes in Theoretical Computer Science
10 (1998).
http://www.elsevier.nl/cas/tree/store/tcs/free/entcs/store/tcs10/cover.sub.sht
Ibraheem, H., and Schmidt, D.A.,
Partial evaluation of higherorder natural semantics definitions,
Proc. Workshop on Specialization of Declarative Programs,
M. Leuschel, ed., Port Jefferson, NY, Oct. 1997.
Rapport 97/30, Datalogisk Institut, Copenhagen University.
Dwyer, M., and Schmidt, D.A.
Limiting state explosion with filterbased refinement,
Proc. 1st International Workshop on Verification, Model Checking and
Abstract Interpretation, Annalisa Bossi, ed., Port Jefferson, NY, Oct. 1997.
Report CS9714,
Dipartimento di Matematica Applicata ed Informatica,
Universita' Ca' Foscari di Venezia, Italy.
http://www.dsi.unive.it/~bossi/VMCAI.html
Schmidt, D.A.
Programming language semantics.
In
Encyclopedia of Computer Science, 4th Ed.,
Anthony Ralston, Edwin D. Reilly, and
David Hemmendinger
eds.,
Macmillan Publishers, London, 2000.
Schmidt, D.A.
On the Need for a Popular Formal Semantics.
Proc. ACM Conference on Strategic Directions in Computing Research,
Boston.
ACM SIGPLAN Notices 321 (1997) 115116.
Schmidt, D.A.
Abstract Interpretation of SmallStep Semantics.
In Analysis and Verification of MultipleAgent Languages,
M. Dam, editor,
Lecture Notes in Computer Science 1192, SpringerVerlag, Berlin,
1997, pp. 7699.
Schmidt, D.A.
Programming language semantics.
In
CRC Handbook of Computer Science,
Allen Tucker, ed.,
CRC Press, Boca Raton, FL, 1997, pp. 22372254.
Summary appears in
ACM Computing Surveys 281 (1996).
Le Metayer, D., and Schmidt, D.A.
Structural Operational Semantics as a Basis for Static Program Analysis.
ACM Computing Surveys
282 (1996) 340343.
Schmidt, D.A.
Naturalsemanticsbased abstract interpretation.
Invited paper,
Proc. 2d Static Analysis Symposium, Glasgow, Sept. 1995,
Lecture Notes in Computer Science 983, Springer, Berlin, 1995, pp. 118.
Banerjee, A., and Schmidt, D.A.
Stackability in the typed callbyvalue lambda calculus.
Proc. International Symposium on Static Analysis, Namur, Belgium,
September, 1994,
Lecture Notes in Computer Science 864, Springer, Berlin, 1994, pp. 131146.
Expanded version appears in
Science of Computer Programming 311 (1998) 4773.
Banerjee, A., and Schmidt, D.A.
A Categorical Interpretation of Landin's Correspondence Principle.
Proc. Ninth Conf. Mathematical Foundations of Programming Semantics,
Lecture Notes in
Computer Science 802, Springer, Berlin, 1994, pp. 587602.
Doh, K.G., and Schmidt, D.A.
Action SemanticsDirected Prototyping.
Computer Languages
194 (1993) 213233.
Doh, K., and Schmidt, D.A.
Extraction of Strong Typing Laws from Action Semantics Definitions.
Proc. 4th. European Symposium on Programming,
Lecture Notes in Computer Science 582,
Springer, Berlin, 1992, pp. 151166.
Mizuno, M., and Schmidt, D.A.
A security flow control algorithm and its denotational semantics correctness
proof.
Formal Aspects of Computing
4 (1992) 727754.
Even, S., and Schmidt, D.A.
Category sorted algebrabased action semantics.
Theoretical Computer Science
771,2 (1990) 7396.
Even, S., and Schmidt, D.A.
Type inference for action semantics.
Proc. 3rd. European Symposium on Programming, Copenhagen.
Lecture Notes in Computer Science 432,
Springer, Berlin, 1990, pp. 118133.
Schmidt, D.A.
Detecting stackbased environments in denotational definitions.
Science of Computer Programming,
112 (1988)
107133.
Schmidt, D.A.
Static properties of partial evaluation.
In Partial Evaluation and Mixed Computation,
D. Bjoerner, A.P. Ershov, and N.D. Jones, editors,
NorthHolland, Amsterdam, 1988, pp. 465484.
Schmidt, D.A. Detecting global variables in denotational specifications.
ACM Transactions on Programming Languages
and Systems
72 (1985) 299310.
Melton, A., Schmidt, D.A., and Strecker, G.
Galois connections and implementation structures.
Proc. Workshop on Category Theory and Computer Programming,
Lecture Notes in Computer Science 240,
SpringerVerlag, Berlin, 1985, pp. 299312.
Melton, A., and Schmidt, D.A.
A topological framework for cpos lacking bottom elements.
Proc. Mathematical Foundations
of Programming Semantics, Manhattan, KS.
Lecture Notes in Computer Science 239,
SpringerVerlag, Berlin, 1985,
pp. 196204.
Schmidt, D.A. A programming notation for tactical reasoning.
Proc. 7th International Conference on Automated Deduction, Napa, CA.
Lecture Notes in Computer Science 170,
SpringerVerlag, Berlin, 1984, pp. 445459.
Schmidt, D.A. Approximation properties of abstract data types.
Theoretical Computer Science
241 (1983) 7394.
Jones, N.D., and Schmidt, D.A. Compiler generation from denotational
semantics. Proc. Workshop on SemanticsDirected Compiler
Generation, Aarhus.
Lecture Notes in Computer
Science 94, SpringerVerlag, Berlin, 1980, pp. 7093.
Schmidt, D.A. State transition machines for lambda calculus expressions.
Proc. Workshop on Semanticsdirected Compiler Generation, Aarhus.
Lecture Notes in Computer Science 94, SpringerVerlag,
Berlin, 1980, pp. 415440.
Slonim, J.S., Schmidt, D.A., and Fisher, P.S. Considerations for
determining the degree of centralization or decentralization in the
computing environment.
Information and Management 21 (1979) 1537.
Maryanski, F.J., Fisher, P.S., Housch, R.D., and Schmidt, D.A.
A prototype distributed data base management system. Proc. 12th
Hawaii International Conference on System Sciences, Honolulu,
Jan. 1979, pp. 205214.
Last modified March 2016