| 2013 | SAS | Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing. | Hyunha Kim, Kyung-Goo Doh, David A. Schmidt |
| 2010 | GLOBECOM | Large System Performance of Interference Alignment in Single-Beam MIMO Networks. | David A. Schmidt, Wolfgang Utschick, Michael L. Honig |
| 2009 | SAS | Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology. | Kyung-Goo Doh, Hyunha Kim, David A. Schmidt |
| 2009 | SAS | Abstract Interpretation from a Topological Perspective. | David A. Schmidt |
| 2008 | ACSSC | A combinatorial approach to maximizing the sum rate in the MIMO BC with linear precoding. | Raphal Hunger, David A. Schmidt, Michael Joham |
| 2008 | ICASSP | Point-to-point MIMO MMSE vector precoding and thp achieving capacity. | Michael Joham, Hans H. Brunner, Raphael Hunger, David A. Schmidt, Wolfgang Utschick |
| 2008 | VMCAI | Internal and External Logics of Abstract Interpretations. | David A. Schmidt |
| 2007 | ISIT | Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue Decompositions. | Raphael Hunger, David A. Schmidt, Wolfgang Utschick |
| 2006 | APLAS | Comparing Completeness Properties of Static Analyses and Their Logics. | David A. Schmidt |
| 2006 | ICASSP | Alternating Optimization for MMSE Broadcast Precoding. | Raphael Hunger, Wolfgang Utschick, David A. Schmidt, Michael Joham |
| 2006 | SAS | Underapproximating Predicate Transformers. | David A. Schmidt |
| 2005 | PIMRC | Minimum Mean Square Error Vector Precoding. | David A. Schmidt, Michael Joham, Wolfgang Utschick |
| 2004 | SAS | Closed and Logical Relations for Over- and Under-Approximation of Powersets. | David A. Schmidt |
| 2001 | ESOP | Modal Transition Systems: A Foundation for Three-Valued Program Analysis. | Michael Huth, Radha Jagadeesan, David A. Schmidt |
| 2001 | PPDP | Should UML Be Used for Declarative Programming? | David A. Schmidt |
| 1999 | PADL | A Return to Elegance: The Reapplication of Declarative Notation to Software Design. | David A. Schmidt |
| 1999 | SAS | Model-Checking: A Tutorial Introduction. | Markus Mller-Olm, David A. Schmidt, Bernhard Steffen |
| 1998 | POPL | Data Flow Analysis is Model Checking of Abstract Interpretations. | David A. Schmidt |
| 1998 | SAS | Program Analysis | David A. Schmidt, Bernhard Steffen |
| 1995 | SAS | Natural-Semantics-Based Abstract Interpretation (Preliminary Version) | David A. Schmidt |
| 1994 | SAS | Stackability in the Simply-Typed Call-by-Value Lambda Calculus. | Anindya Banerjee, David A. Schmidt |
| 1993 | MFPS | A Categorical Interpretation of Landin's Correspondence Principle. | Anindya Banerjee, David A. Schmidt |
| 1992 | ESOP | Extraction of Strong Typing Laws from Action Semantics Definitions. | Kyung-Goo Doh, David A. Schmidt |
| 1990 | ESOP | Type Inference for Action Semantics. | Susan Even, David A. Schmidt |
| 1985 | MFPS | A Topological Framework of cpos Lacking Bottom Elements. | Austin Melton, David A. Schmidt |
| 1984 | CADE | A Programming Notation for Tactical Reasoning. | David A. Schmidt |
| 1980 | CC | Compiler generation from denotational semantics. | Neil D. Jones, David A. Schmidt |
| 1980 | CC | State transition machines for lambda calculus expressions. | David A. Schmidt |