| 2012 | ||
|---|---|---|
| j24 | David A. Schmidt: Inverse-limit and topological aspects of abstract interpretation. Theor. Comput. Sci. 430: 23-42 (2012) | |
| 2011 | ||
| c33 | Kyung-Goo Doh, Hyunha Kim, David A. Schmidt: Abstract LR-Parsing. Formal Modeling: Actors, Open Systems, Biological Systems 2011: 90-109 | |
| c32 | David A. Schmidt, Wolfgang Utschick: Algorithms for improper single-stream MIMO interference networks. ISWCS 2011: 251-255 | |
| e9 | Ranjit Jhala, David A. Schmidt (Eds.): Verification, Model Checking, and Abstract Interpretation - 12th International Conference, VMCAI 2011, Austin, TX, USA, January 23-25, 2011. Proceedings. Lecture Notes in Computer Science 6538, Springer 2011, isbn 978-3-642-18274-7 | |
| 2010 | ||
| c31 | David A. Schmidt, Wolfgang Utschick, Michael L. Honig: Large System Performance of Interference Alignment in Single-Beam MIMO Networks. GLOBECOM 2010: 1-6 | |
| 2009 | ||
| j23 | David A. Schmidt: Abstract Interpretation From a Denotational-semantics Perspective. Electr. Notes Theor. Comput. Sci. 249: 19-37 (2009) | |
| c30 | Kyung-Goo Doh, David A. Schmidt: An Action Semantics Based on Two Combinators. Semantics and Algebraic Specification 2009: 274-296 | |
| c29 | Changxin Shi, David A. Schmidt, Randall A. Berry, Michael L. Honig, Wolfgang Utschick: Distributed Interference Pricing for the MIMO Interference Channel. ICC 2009: 1-5 | |
| c28 | Kyung-Goo Doh, Hyunha Kim, David A. Schmidt: Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology. SAS 2009: 256-272 | |
| c27 | ||
| 2008 | ||
| j22 | David A. Schmidt, Michael Joham, Wolfgang Utschick: Information Theory Minimum mean square error vector precoding. European Transactions on Telecommunications 19(3): 219-231 (2008) | |
| c26 | Michael Joham, Hans Brunner, Raphael Hunger, David A. Schmidt, Wolfgang Utschick: Point-to-point MIMO MMSE vector precoding and thp achieving capacity. ICASSP 2008: 2925-2928 | |
| c25 | ||
| 2007 | ||
| j21 | David A. Schmidt: Extracting Program Logics From Abstract Interpretations Defined by Logical Relations. Electr. Notes Theor. Comput. Sci. 173: 339-356 (2007) | |
| j20 | David A. Schmidt: State-transition machines for lambda-calculus expressions. Higher-Order and Symbolic Computation 20(3): 319-332 (2007) | |
| j19 | David A. Schmidt: State-transition machines, revisited. Higher-Order and Symbolic Computation 20(3): 333-335 (2007) | |
| j18 | David A. Schmidt: A calculus of logical relations for over- and underapproximating static analyses. Sci. Comput. Program. 64(1): 29-53 (2007) | |
| j17 | Michael Joham, David A. Schmidt, Johannes Brehmer, Wolfgang Utschick: Finite-Length MMSE Tomlinson-Harashima Precoding for Frequency Selective Vector Channels. IEEE Transactions on Signal Processing 55(6-2): 3073-3088 (2007) | |
| c24 | Raphael Hunger, David A. Schmidt, Michael Joham, Alexander Schwing, Wolfgang Utschick: Design of Single-Group Multicasting-Beamformers. ICC 2007: 2499-2505 | |
| 2006 | ||
| c23 | David A. Schmidt: Comparing Completeness Properties of Static Analyses and Their Logics. APLAS 2006: 183-199 | |
| c22 | Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jensen, David A. Schmidt: Automata-Based Confidentiality Monitoring. ASIAN 2006: 75-89 | |
| c21 | ||
| 2004 | ||
| j16 | Michael Huth, Radha Jagadeesan, David A. Schmidt: A domain equation for refinement of partial systems. Mathematical Structures in Computer Science 14(4): 469-505 (2004) | |
| c20 | David A. Schmidt: Closed and Logical Relations for Over- and Under-Approximation of Powersets. SAS 2004: 22-37 | |
| e8 | David A. Schmidt (Ed.): Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings. Lecture Notes in Computer Science 2986, Springer 2004, isbn 3-540-21313-9 | |
| 2002 | ||
| j15 | Adrian Fiech, David A. Schmidt: Polymorphic lambda calculus and subtyping. Theor. Comput. Sci. 278(1-2): 111-140 (2002) | |
| c19 | David A. Schmidt: Structure-Preserving Binary Relations for Program Abstraction. The Essence of Computation 2002: 245-268 | |
| e7 | Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough (Eds.): The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]. Lecture Notes in Computer Science 2566, Springer 2002, isbn 3-540-00326-6 | |
| 2001 | ||
| c18 | Michael Huth, Radha Jagadeesan, David A. Schmidt: Modal Transition Systems: A Foundation for Three-Valued Program Analysis. ESOP 2001: 155-169 | |
| c17 | ||
| 2000 | ||
| j14 | David A. Schmidt: Induction, Domains, Calculi: Strachey's Contributions to Programming-Language Engineering. Higher-Order and Symbolic Computation 13(1/2): 89-101 (2000) | |
| 1999 | ||
| c16 | David A. Schmidt: A Return to Elegance: The Reapplication of Declarative Notation to Software Design. PADL 1999: 360-364 | |
| c15 | Markus Müller-Olm, David A. Schmidt, Bernhard Steffen: Model-Checking: A Tutorial Introduction. SAS 1999: 330-354 | |
| 1998 | ||
| j13 | David A. Schmidt: Trace-Based Abstract Interpretation of Operational Semantics. Lisp and Symbolic Computation 10(3): 237-271 (1998) | |
| j12 | Anindya Banerjee, David A. Schmidt: Stackability in the Simply-Typed Call-by-Value lambda Calculus. Sci. Comput. Program. 31(1): 47-73 (1998) | |
| c14 | David A. Schmidt: Data Flow Analysis is Model Checking of Abstract Interpretations. POPL 1998: 38-48 | |
| c13 | David A. Schmidt, Bernhard Steffen: Program Analysis as Model Checking of Abstract Interpretations. SAS 1998: 351-380 | |
| 1997 | ||
| j11 | Husain Ibraheem, David A. Schmidt: Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and ``Higher-Order'' Derivations. Electr. Notes Theor. Comput. Sci. 10: 121 (1997) | |
| j10 | ||
| p1 | David A. Schmidt: Programming Language Semantics. The Computer Science and Engineering Handbook 1997: 2237-2254 | |
| 1996 | ||
| j9 | ||
| j8 | Daniel Le Métayer, David A. Schmidt: Structural Operational Semantics as a Basis for Static Program Analysis. ACM Comput. Surv. 28(2): 340-343 (1996) | |
| j7 | ||
| c12 | ||
| e6 | Radhia Cousot, David A. Schmidt (Eds.): Static Analysis, Third International Symposium, SAS'96, Aachen, Germany, September 24-26, 1996, Proceedings. Lecture Notes in Computer Science 1145, Springer 1996, isbn 3-540-61739-6 | |
| 1995 | ||
| c11 | David A. Schmidt: Natural-Semantics-Based Abstract Interpretation (Preliminary Version). SAS 1995: 1-18 | |
| 1994 | ||
| b1 | David A. Schmidt: The structure of typed programming languages. Foundations of computing series, MIT Press 1994, isbn 978-0-262-19349-8, pp. I-XIV, 1-367 | |
| c10 | Anindya Banerjee, David A. Schmidt: Stackability in the Simply-Typed Call-by-Value Lambda Calculus. SAS 1994: 131-146 | |
| e5 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings. Lecture Notes in Computer Science 802, Springer 1994, isbn 3-540-58027-1 | |
| 1993 | ||
| j6 | Kyung-Goo Doh, David A. Schmidt: Action Semantics-Directed Prototyping. Comput. Lang. 19(4): 213-233 (1993) | |
| c9 | Anindya Banerjee, David A. Schmidt: A Categorical Interpretation of Landin's Correspondence Principle. MFPS 1993: 587-602 | |
| e4 | David A. Schmidt (Ed.): Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'93, Copenhagen, Denmark, June 14-16, 1993. ACM 1993, isbn 0-89791-594-1 | |
| 1992 | ||
| j5 | Masaaki Mizuno, David A. Schmidt: A Security Flow Control Algorithm and Its Denotational Semantics Correctness Proof. Formal Asp. Comput. 4(6A): 727-754 (1992) | |
| c8 | Kyung-Goo Doh, David A. Schmidt: Extraction of Strong Typing Laws from Action Semantics Definitions. ESOP 1992: 151-166 | |
| e3 | Stephen D. Brookes, Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings. Lecture Notes in Computer Science 598, Springer 1992, isbn 3-540-55511-0 | |
| 1990 | ||
| j4 | Susan Even, David A. Schmidt: Category-Sorted Algebra-Based Action Semantics. Theor. Comput. Sci. 77(1&2): 73-95 (1990) | |
| c7 | ||
| e2 | Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings. Lecture Notes in Computer Science 442, Springer 1990, isbn 3-540-97375-3 | |
| 1988 | ||
| j3 | David A. Schmidt: Detecting Stack-Based Environments in Denotational Definitions. Sci. Comput. Program. 11(2): 107-131 (1988) | |
| e1 | Michael G. Main, Austin Melton, Michael W. Mislove, David A. Schmidt (Eds.): Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings. Lecture Notes in Computer Science 298, Springer 1988, isbn 3-540-19020-1 | |
| 1985 | ||
| j2 | David A. Schmidt: Detecting Global Variables in Denotational Specifications. ACM Trans. Program. Lang. Syst. 7(2): 299-310 (1985) | |
| c6 | Austin Melton, David A. Schmidt, George E. Strecker: Calois Connections and Computer Science Applications. CTCS 1985: 299-312 | |
| c5 | Austin Melton, David A. Schmidt: A Topological Framework of cpos Lacking Bottom Elements. Mathematical Foundations of Programming Semantics 1985: 196-204 | |
| c4 | David A. Schmidt: An implementation from a direct semantics definition. Programs as Data Objects 1985: 222-235 | |
| 1984 | ||
| c3 | ||
| 1983 | ||
| j1 | David A. Schmidt: Approximation Properties of Abstract Data Types. Theor. Comput. Sci. 24: 73-94 (1983) | |
| 1980 | ||
| c2 | Neil D. Jones, David A. Schmidt: Compiler generation from denotational semantics. Semantics-Directed Compiler Generation 1980: 70-93 | |
| c1 | David A. Schmidt: State transition machines for lambda calculus expressions. Semantics-Directed Compiler Generation 1980: 415-440 | |
Colors in the list of coauthors
Last update Thu May 23 11:24:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page