Please go here for my Recent Presentations at conferences and meetings

Online course texts

• programming-language paradigms 2014.
• software architecture, C#-based 2014.
• programming logic, Python-based 2014.
• CS1, Python-based 2007.
• data structures, Java-based 2005.
• Programming Principles in Java: Architectures and Interfaces (contracted to Scott-Jones Press), 2003, never published at my request.

Recently Edited Books

• Mine', Antoine, and Schmidt, D.A., editors. Proc. Static Analysis Symposium. Lecture Notes in Computer Science 7460, Springer-Verlag, 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, Springer-Verlag, 2011.
• Schmidt, D.A., editor. Proc. 2004 European Symposium on Programming, Barcelona. Lecture Notes in Computer Science 2986, Springer-Verlag, 2004.
• Mogensen, T., Schmidt, D., Sudborough, I. H. The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones . Lecture Notes in Computer Science 2566, Springer-Verlag, 2002.

Recent Papers

2015

• Schmidt, D.A. Guards, Failure, and Partiality: Dijkstra's Guarded-Command Language Formulated Topologically. In Semantics, Logics, and Calculi, C. Probst, C. Hankin, and R.R. Hansen, eds., Springer LNCS 9560, pp. 252-271, 2016.

2013

• 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. http://people.cs.ksu.edu/~schmidt/papers/schmidt/SAS13.pdf.

2011

• Doh, K.-G., Kim, H., and Schmidt, D.A. Abstract LR-parsing. In Formal Modeling: Actors; Open Systems, Biological Systems: Festschrift for Carolyn Talcott, G. Agha, O. Danvy, and J. Meseguer, eds., Springer LNCS 7000, 2011, PDF.
• Schmidt, D.A. Inverse-Limit and Topological Aspects of Abstract Interpretation. Theoretical Computer Science 540 (2012). pdf.
• Schmidt, D.A. Denotational semantics. In 2012 Yearbook of Science and Technology, McGraw-Hill, New York, 2012.

2010

• Doh, K.-G., Kim, H., and Schmidt, D.A. Abstract parsing of string updates and user input. Technical report 2010-1, Computing and Info. Sci. Dept., Kansas State Univ., pdf.

• Schmidt, D.A. Modular, parsing-based, flow analysis of dictionary data structures in scripting languages. Technical report 2010-2, Computing and Info. Sci. Dept., Kansas State Univ., pdf.

2009

• 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. 274-296. PDF
• Doh, K.-G., Kim, H., and Schmidt, D.A. Abstract parsing: static analysis of dynamically generated string output using LR-parsing technology. Proc. 16th Static Analysis Symposium, Los Angeles, August 2009, Springer LNCS. PDF
• Schmidt, D.A. Abstract interpretation from a topological perspective. Proc. 16th Static Analysis Symposium, Los Angeles, August 2009, Springer LNCS. PDF
• Schmidt, D.A. Abstract interpretation from a denotational semantics perspective. Proc. 25th Conf. Mathematical Foundations of Programming Semantics, Oxford, Elsevier ENTCS, April 2009. PDF

2007

• Schmidt, D.A. Internal and external logics of abstract interpretations. Proc. Verification, Model Checking, and Abstract Interpretation (VMCAI'08), Springer LNCS, January 2008. PDF
• Schmidt, D.A. Extracting program logics from abstract interpretations defined by logical relations. Proc. 23d Conf. Math. Foundations Prog. Semantics, Elsevier ENTCS 173(2007) 339-356. PDF

2006

• Le Guernic, G., Banerjee, A., Jensen, T., and Schmidt, D.A. Automata-Based Confidentiality Monitoring. Proc. 11th Asian Computing Science Conference on Secure Software (ASIAN'06), Springer LNCS, Tokyo, Dec. 2006. PDF.
• Schmidt, D.A. State-Transition Machines, Revisited. J. Higher Order and Symbolic Computation 20-3 (2007) 319-332 PDF | PS
• Schmidt, D.A. State-Transition Machines for Lambda-Calculus Expressions. J. Higher Order and Symbolic Computation 20-3 (2007) 333-335 PDF | PS
• 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. 183-199. PDF
• Schmidt, D.A. Underapproximating predicate transformers. Proc. 2006 Static Analysis Symposium, K. Yi, ed., Springer LNCS 4134, 2006, pp. 127-143. PDF

2005

• Schmidt, D.A. A calculus of logical relations for over- and underapproximating static analyses. Science of Computer Programming, 64-1(2007) 29-53. PS.GZ | PDF

2004

• Schmidt, D.A. Closed and logical relations for over- and under-approximation of powersets Proc.2004 Static Analysis Symposium, R. Giacobazzi, ed., Springer LNCS 3148, pp. 22-37. PS.GZ | PDF
• Huth, M.R.A., Jagadeesan, R., and Schmidt, D.A. A domain equation for refinement of partial systems. Mathematical Structures in Computer Science 14 (2004) 469-505.

2002

• Schmidt, D.A. Structure-preserving binary relations for program abstraction In The Essence of Computation: Complexity, Analysis, Transformation, T. Mogensen, D. Schmidt, and I. H. Sudburough, editors. Springer LNCS 2566, 2002. Corrected version: PS.GZ | PDF
• Fiech, A., and Schmidt, D.A. Polymorphic lambda calculus and subtyping. Theoretical Computer Science 278, 1-2 (2002) 111-140.

2001

• Schmidt, D.A. From Trace Sets to Modal-Transition Systems by Stepwise Abstract Interpretation. Proc. Workshop on Structure Preserving Relations, Amagasaaki, Japan, March 2001. Elsevier Electronic Notes in Theoretical Computer Science, to appear. PS.GZ | PDF
• Schmidt, D.A. Should UML Be Used for Declarative Programming? Proc. ACM Conf. on Principles and Practice of Declarative Programming (PPDP'01), September 2001.
• Huth, M., Jagadeesan, R., and Schmidt, D.A. Modal transition systems: a foundation for three-valued program analysis. Proc. European Symposium on Programming 2001, Springer LNCS 2028, pp. 155-169.

2000

• Schmidt, D.A. Binary relations for abstraction and refinement (17 November). Technical Report 2000-3. Corrected version of the paper in Proc. Workshop on Refinement and Abstraction, Amagasaaki, Japan, Nov. 1999, Elsevier Electronic Notes in Theoretical Computer Science, to appear.
• Schmidt, D.A. Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering Journal of Higher Order and Symbolic Computation 13-1/2 (2000) 89-102.

1999

• M"uller-Olm, 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. 330-354. Here are the slides from the presentation (contains additional material).
• Schmidt, D.A. A Return to Elegance: The Reapplication of Declarative Notation to Software Design. Invited position paper, Proc. First Workshop in Practical Aspects of Declarative Languages, San Antonio, TX, Janaury 1999, G. Gupta, ed., Springer LNCS 1551.

1998

• Schmidt, D.A. and Steffen, B. Data-flow analysis as model checking of abstract interpretations. Proc. 5th Static Analysis Symposium, G. Levi. ed., Pisa, September, 1998. Springer LNCS 1503.
• Schmidt, D.A. Trace-Based Abstract Interpretation of Operational Semantics. J. Lisp and Symbolic Computation 10-3 (1998) 237-271.
• Ibraheem, H., and Schmidt, D.A. Adapting big-step semantics to small-step style: coinductive interpretations and ``higher-order'' derivations. Proc. 2d Workshop on Higher-Order Techniques in Operational Semantics (HOOTS2), C. Talcott, ed., Stanford, Dec. 1997. Elsevier ENTS 10 (1998).
• Schmidt, D.A. Data-flow analysis is model checking of abstract interpretations. Proc. 25th ACM Symp. Principles of Programming Languages, San Diego, 1998.
• Banerjee, A., and Schmidt, D.A. Stackability in the typed call-by-value lambda calculus. Science of Computer Programming 31-1(1998) . (Preliminary version found in Static Analysis Symposium, LNCS 864, Springer, 1994, pp. 131-146.)

1997

• Ibraheem, H., and Schmidt, D.A. Partial Evaluation of Higher-Order Natural-Semantics Derivations. Proc. Workshop on Specialization of Declarative Programs and its Applications, M. Leuschel, ed. Port Jefferson, NY, October 1997.
• Dwyer, M.B., and Schmidt, D.A. Limiting State Explosion with Filter-Based Refinement. Proc. International Workshop on Verification, Model Checking and Abstract Interpretation, Annalisa Bossi, ed. Port Jefferson, Long Island, N.Y., October 1997.
• Schmidt, D.A. Abstract Interpretation of Small-Step Semantics. Proc. 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, Stockholm, June 1996, Lecture Notes in Computer Science 1192, Springer, Berlin, 1997, pp. 76-99.
• Schmidt, D.A. On the Need for a Popular Formal Semantics. Proc. ACM Conf. on Strategic Directions in Computing Research, Cambridge, MA, June 1996. ACM SIGPLAN Notices 32-1 (1997) 115-116.

1996 and earlier (sorry --- grossly incomplete)

• Schmidt, D.A. Programming language semantics. In CRC Handbook of Computer Science, Allen Tucker, ed., CRC Press, Boca Raton, FL, 1996. Summary version, ACM Computing Surveys 28-1 (1996) 265-267.
• Schmidt, D.A. Natural-semantics-based abstract interpretation. Proc. 2d Static Analysis Symposium, Glasgow, Sept. 1995, Lecture Notes in Computer Science 983, Springer, Berlin, 1995, pp. 1-18.
• Doh, K.-G., and Schmidt, D.A. The facets of action semantics: some principles and applications. 1st Int. Workshop on Action Semantics, Edinburgh, Scotland, April 14, BRICS NS-94-1, University of Aarhus, Denmark, pp.1-15, 1994.
• Mizuno, M., and Schmidt, D.A. A security flow control algorithm and its denotational semantics correctness proof. Formal Aspects of Computing 4 (1992) 727-754.
• Doh, K.-G., and Schmidt, D.A. Extraction of strong typing laws from action semantics definitions Proc. 4th. European Symposium on Programming, Rennes, France. Lecture Notes in Computer Science 582, Springer, Berlin, 1992, pp. 151-166.