 | 2009 |
|---|
| 58 |       | 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 |
| 57 | | David A. Schmidt:
Abstract Interpretation from a Topological Perspective.
SAS 2009: 293-308 |
| 56 | | Kyung-Goo Doh,
David A. Schmidt:
An Action Semantics Based on Two Combinators.
Semantics and Algebraic Specification 2009: 274-296 |
| 55 | | David A. Schmidt:
Abstract Interpretation From a Denotational-semantics Perspective.
Electr. Notes Theor. Comput. Sci. 249: 19-37 (2009) |
| 2008 |
|---|
| 54 | | David A. Schmidt:
Internal and External Logics of Abstract Interpretations.
VMCAI 2008: 263-278 |
| 2007 |
|---|
| 53 | | Raphael Hunger,
David A. Schmidt,
Michael Joham,
Alexander Schwing,
Wolfgang Utschick:
Design of Single-Group Multicasting-Beamformers.
ICC 2007: 2499-2505 |
| 52 | | David A. Schmidt:
Extracting Program Logics From Abstract Interpretations Defined by Logical Relations.
Electr. Notes Theor. Comput. Sci. 173: 339-356 (2007) |
| 51 | | David A. Schmidt:
State-transition machines for lambda-calculus expressions.
Higher-Order and Symbolic Computation 20(3): 319-332 (2007) |
| 50 | | David A. Schmidt:
State-transition machines, revisited.
Higher-Order and Symbolic Computation 20(3): 333-335 (2007) |
| 49 | | 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) |
| 48 | | David A. Schmidt:
A calculus of logical relations for over- and underapproximating static analyses.
Sci. Comput. Program. 64(1): 29-53 (2007) |
| 2006 |
|---|
| 47 | | David A. Schmidt:
Comparing Completeness Properties of Static Analyses and Their Logics.
APLAS 2006: 183-199 |
| 46 | | Gurvan Le Guernic,
Anindya Banerjee,
Thomas P. Jensen,
David A. Schmidt:
Automata-Based Confidentiality Monitoring.
ASIAN 2006: 75-89 |
| 45 | | David A. Schmidt:
Underapproximating Predicate Transformers.
SAS 2006: 127-143 |
| 2004 |
|---|
| 44 |  | David A. Schmidt:
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
Springer 2004 |
| 43 | | David A. Schmidt:
Closed and Logical Relations for Over- and Under-Approximation of Powersets.
SAS 2004: 22-37 |
| 42 | | 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) |
| 2002 |
|---|
| 41 | | Torben Æ. Mogensen,
David A. Schmidt,
Ivan Hal Sudborough:
The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]
Springer 2002 |
| 40 | | David A. Schmidt:
Structure-Preserving Binary Relations for Program Abstraction.
The Essence of Computation 2002: 245-268 |
| 39 | | Adrian Fiech,
David A. Schmidt:
Polymorphic lambda calculus and subtyping.
Theor. Comput. Sci. 278(1-2): 111-140 (2002) |
| 2001 |
|---|
| 38 | | Michael Huth,
Radha Jagadeesan,
David A. Schmidt:
Modal Transition Systems: A Foundation for Three-Valued Program Analysis.
ESOP 2001: 155-169 |
| 37 | | David A. Schmidt:
Should UML Be Used for Declarative Programming?
PPDP 2001: 1-3 |
| 2000 |
|---|
| 36 | | 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 |
|---|
| 35 | | David A. Schmidt:
A Return to Elegance: The Reapplication of Declarative Notation to Software Design.
PADL 1999: 360-364 |
| 34 | | Markus Müller-Olm,
David A. Schmidt,
Bernhard Steffen:
Model-Checking: A Tutorial Introduction.
SAS 1999: 330-354 |
| 1998 |
|---|
| 33 | | David A. Schmidt:
Data Flow Analysis is Model Checking of Abstract Interpretations.
POPL 1998: 38-48 |
| 32 | | David A. Schmidt,
Bernhard Steffen:
Program Analysis as Model Checking of Abstract Interpretations.
SAS 1998: 351-380 |
| 31 | | David A. Schmidt:
Trace-Based Abstract Interpretation of Operational Semantics.
Lisp and Symbolic Computation 10(3): 237-271 (1998) |
| 30 | | Anindya Banerjee,
David A. Schmidt:
Stackability in the Simply-Typed Call-by-Value lambda Calculus.
Sci. Comput. Program. 31(1): 47-73 (1998) |
| 1997 |
|---|
| 29 | | David A. Schmidt:
Programming Language Semantics.
The Computer Science and Engineering Handbook 1997: 2237-2254 |
| 28 | | 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: (1997) |
| 27 | | David A. Schmidt:
On the Need for a Popular Formal Semantics.
SIGPLAN Notices 32(1): 115-116 (1997) |
| 1996 |
|---|
| 26 | | Radhia Cousot,
David A. Schmidt:
Static Analysis, Third International Symposium, SAS'96, Aachen, Germany, September 24-26, 1996, Proceedings
Springer 1996 |
| 25 | | David A. Schmidt:
Abstract Interpretation of Small-Step Semantics.
LOMAPS 1996: 76-99 |
| 24 | | David A. Schmidt:
Programming Language Semantics.
ACM Comput. Surv. 28(1): 265-267 (1996) |
| 23 | | 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) |
| 22 | | David A. Schmidt:
On the Need for a Popular Formal Semantics.
ACM Comput. Surv. 28(4es): 175 (1996) |
| 1995 |
|---|
| 21 | | David A. Schmidt:
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
SAS 1995: 1-18 |
| 1994 |
|---|
| 20 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 9th International Conference, New Orleans, LA, USA, April 7-10, 1993, Proceedings
Springer 1994 |
| 19 | | Anindya Banerjee,
David A. Schmidt:
Stackability in the Simply-Typed Call-by-Value Lambda Calculus.
SAS 1994: 131-146 |
| 1993 |
|---|
| 18 | | Anindya Banerjee,
David A. Schmidt:
A Categorical Interpretation of Landin's Correspondence Principle.
MFPS 1993: 587-602 |
| 17 | | Kyung-Goo Doh,
David A. Schmidt:
Action Semantics-Directed Prototyping.
Comput. Lang. 19(4): 213-233 (1993) |
| 1992 |
|---|
| 16 | | Stephen D. Brookes,
Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 7th International Conference, Pittsburgh, PA, USA, March 25-28, 1991, Proceedings
Springer 1992 |
| 15 | | Kyung-Goo Doh,
David A. Schmidt:
Extraction of Strong Typing Laws from Action Semantics Definitions.
ESOP 1992: 151-166 |
| 14 | | Masaaki Mizuno,
David A. Schmidt:
A Security Flow Control Algorithm and Its Denotational Semantics Correctness Proof.
Formal Asp. Comput. 4(6A): 727-754 (1992) |
| 1990 |
|---|
| 13 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29 - April 1, 1989, Proceedings
Springer 1990 |
| 12 | | Susan Even,
David A. Schmidt:
Type Inference for Action Semantics.
ESOP 1990: 118-133 |
| 11 | | Susan Even,
David A. Schmidt:
Category-Sorted Algebra-Based Action Semantics.
Theor. Comput. Sci. 77(1&2): 73-95 (1990) |
| 1988 |
|---|
| 10 | | Michael G. Main,
Austin Melton,
Michael W. Mislove,
David A. Schmidt:
Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Tulane University, New Orleans, Louisiana, USA, April 8-10, 1987, Proceedings
Springer 1988 |
| 9 | | David A. Schmidt:
Detecting Stack-Based Environments in Denotational Definitions.
Sci. Comput. Program. 11(2): 107-131 (1988) |
| 1985 |
|---|
| 8 | | Austin Melton,
David A. Schmidt,
George E. Strecker:
Calois Connections and Computer Science Applications.
CTCS 1985: 299-312 |
| 7 | | Austin Melton,
David A. Schmidt:
A Topological Framework of cpos Lacking Bottom Elements.
Mathematical Foundations of Programming Semantics 1985: 196-204 |
| 6 | | David A. Schmidt:
An implementation from a direct semantics definition.
Programs as Data Objects 1985: 222-235 |
| 5 | | David A. Schmidt:
Detecting Global Variables in Denotational Specifications.
ACM Trans. Program. Lang. Syst. 7(2): 299-310 (1985) |
| 1984 |
|---|
| 4 | | David A. Schmidt:
A Programming Notation for Tactical Reasoning.
CADE 1984: 445-459 |
| 1983 |
|---|
| 3 | | David A. Schmidt:
Approximation Properties of Abstract Data Types.
Theor. Comput. Sci. 24: 73-94 (1983) |
| 1980 |
|---|
| 2 | | David A. Schmidt:
State transition machines for lambda calculus expressions.
Semantics-Directed Compiler Generation 1980: 415-440 |
| 1 | | Neil D. Jones,
David A. Schmidt:
Compiler generation from denotational semantics.
Semantics-Directed Compiler Generation 1980: 70-93 |
