David A. Schmidt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 72 from 72

2020

Spline-based intrusion detection for VANET utilizing knot flow classificationDavid A. Schmidt, Mohammad S. Khan, Brian T. Bennett. itl, 3(3), 2020. [doi]

2016

Guards, Failure, and Partiality: Dijkstra's Guarded-Command Language Formulated TopologicallyDavid A. Schmidt. BIRTHDAY 2016: 252-271 [doi]

2014

Programming Language SemanticsDavid A. Schmidt. In Teofilo F. Gonzalez, Jorge Diaz-Herrera, Allen Tucker, editors, Computing Handbook, Third Edition: Computer Science and Software Engineering. CRC Press, 2014.

2013

Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic ProcessingHyunha Kim, Kyung-Goo Doh, David A. Schmidt. SAS 2013: 194-214 [doi]

Comparison of Distributed Beamforming Algorithms for MIMO Interference NetworksDavid A. Schmidt, Changxin Shi, Randall A. Berry, Michael L. Honig, Wolfgang Utschick. tsp, 61(13):3476-3489, 2013. [doi]

2012

Inverse-limit and topological aspects of abstract interpretationDavid A. Schmidt. TCS, 430:23-42, 2012. [doi]

2011

Abstract LR-ParsingKyung-Goo Doh, Hyunha Kim, David A. Schmidt. BIRTHDAY 2011: 90-109 [doi]

Algorithms for improper single-stream MIMO interference networksDavid A. Schmidt, Wolfgang Utschick. iswcs 2011: 251-255 [doi]

2010

Gradient projection based interference alignment for the MIMO X channelAndreas Dotzler, David A. Schmidt, Guido Dietl, Wolfgang Utschick. wsa 2010: 355-360 [doi]

Beamforming techniques for single-beam MIMO interference networksDavid A. Schmidt, Wolfgang Utschick, Michael L. Honig. allerton 2010: 1182-1187 [doi]

Large System Performance of Interference Alignment in Single-Beam MIMO NetworksDavid A. Schmidt, Wolfgang Utschick, Michael L. Honig. globecom 2010: 1-6 [doi]

2009

2008

2007

Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue DecompositionsRaphael Hunger, David A. Schmidt, Wolfgang Utschick. isit 2007: 776-780 [doi]

Design of Single-Group Multicasting-BeamformersRaphael Hunger, David A. Schmidt, Michael Joham, Alexander Schwing, Wolfgang Utschick. icc 2007: 2499-2505 [doi]

Finite-Length MMSE Tomlinson-Harashima Precoding for Frequency Selective Vector ChannelsMichael Joham, David A. Schmidt, Johannes Brehmer, Wolfgang Utschick. tsp, 55(6-2):3073-3088, 2007. [doi]

State-transition machines, revisitedDavid A. Schmidt. lisp, 20(3):333-335, 2007. [doi]

A calculus of logical relations for over- and underapproximating static analysesDavid A. Schmidt. SCP, 64(1):29-53, 2007. [doi]

Extracting Program Logics From Abstract Interpretations Defined by Logical RelationsDavid A. Schmidt. ENTCS, 173:339-356, 2007. [doi]

State-transition machines for lambda-calculus expressionsDavid A. Schmidt. lisp, 20(3):319-332, 2007. [doi]

2006

2005

Minimum Mean Square Error Vector PrecodingDavid A. Schmidt, Michael Joham, Wolfgang Utschick. pimrc 2005: 107-111 [doi]

2004

A domain equation for refinement of partial systemsMichael Huth, Radha Jagadeesan, David A. Schmidt. mscs, 14(4):469-505, 2004. [doi]

Closed and Logical Relations for Over- and Under-Approximation of PowersetsDavid A. Schmidt. SAS 2004: 22-37 [doi]

2002

Polymorphic lambda calculus and subtypingAdrian Fiech, David A. Schmidt. TCS, 278(1-2):111-140, 2002. [doi]

Structure-Preserving Binary Relations for Program AbstractionDavid A. Schmidt. BIRTHDAY 2002: 245-268 [doi]

2001

Modal Transition Systems: A Foundation for Three-Valued Program AnalysisMichael Huth, Radha Jagadeesan, David A. Schmidt. ESOP 2001: 155-169 [doi]

Should UML Be Used for Declarative Programming?David A. Schmidt. ppdp 2001: 1-3

2000

Induction, Domains, Calculi: Strachey s Contributions to Programming-Language EngineeringDavid A. Schmidt. lisp, 13(1/2):89-101, 2000.

1999

Model-Checking: A Tutorial IntroductionMarkus Müller-Olm, David A. Schmidt, Bernhard Steffen. SAS 1999: 330-354 [doi]

A Return to Elegance: The Reapplication of Declarative Notation to Software DesignDavid A. Schmidt. PADL 1998: 360-364 [doi]

1998

Stackability in the Simply-Typed Call-by-Value lambda CalculusAnindya Banerjee, David A. Schmidt. SCP, 31(1):47-73, 1998.

Data Flow Analysis is Model Checking of Abstract InterpretationsDavid A. Schmidt. POPL 1998: 38-48 [doi]

Trace-Based Abstract Interpretation of Operational SemanticsDavid A. Schmidt. lisp, 10(3):237-271, 1998.

Program Analysis ::::as:::: Model Checking of Abstract InterpretationsDavid A. Schmidt, Bernhard Steffen. SAS 1998: 351-380 [doi]

1997

Adapting Big-Step Semantics to Small-Step Style: Coinductive Interpretations and Higher-Order DerivationsHusain Ibraheem, David A. Schmidt. ENTCS, 10:121, 1997. [doi]

On the Need for a Popular Formal SemanticsDavid A. Schmidt. SIGPLAN, 32(1):115-116, 1997.

Programming Language SemanticsDavid A. Schmidt. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 2237-2254, CRC Press, 1997.

1996

Structural Operational Semantics as a Basis for Static Program AnalysisDaniel Le Métayer, David A. Schmidt. ACM Comput. Surv., 28(2):340-343, 1996.

Abstract Interpretation of Small-Step SemanticsDavid A. Schmidt. lomaps 1997: 76-99

On the Need for a Popular Formal SemanticsDavid A. Schmidt. ACM Comput. Surv., 28(4es):175, 1996.

Programming Language SemanticsDavid A. Schmidt. ACM Comput. Surv., 28(1):265-267, 1996.

1995

Natural-Semantics-Based Abstract Interpretation (Preliminary Version)David A. Schmidt. SAS 1995: 1-18

1994

Stackability in the Simply-Typed Call-by-Value Lambda CalculusAnindya Banerjee, David A. Schmidt. SAS 1994: 131-146

The structure of typed programming languagesDavid A. Schmidt. Foundations of computing series, MIT Press, 1994.

1993

A Categorical Interpretation of Landin s Correspondence PrincipleAnindya Banerjee, David A. Schmidt. mfps 1994: 587-602

Action Semantics-Directed PrototypingKyung-Goo Doh, David A. Schmidt. Comp. Lang., Syst. \& Struct., 19(4):213-233, 1993.

1992

Extraction of Strong Typing Laws from Action Semantics DefinitionsKyung-Goo Doh, David A. Schmidt. ESOP 1992: 151-166

A Security Flow Control Algorithm and Its Denotational Semantics Correctness ProofMasaaki Mizuno, David A. Schmidt. fac, 4(6A):727-754, 1992.

1990

Type Inference for Action SemanticsSusan Even, David A. Schmidt. ESOP 1990: 118-133

Category-Sorted Algebra-Based Action SemanticsSusan Even, David A. Schmidt. TCS, 77(1&2):73-95, 1990.

1988

Detecting Stack-Based Environments in Denotational DefinitionsDavid A. Schmidt. SCP, 11(2):107-131, 1988.

1985

Calois Connections and Computer Science ApplicationsAustin Melton, David A. Schmidt, George E. Strecker. ctcs 1986: 299-312

A Topological Framework of cpos Lacking Bottom ElementsAustin Melton, David A. Schmidt. mfps 1986: 196-204

An implementation from a direct semantics definitionDavid A. Schmidt. pdo 1986: 222-235

Detecting Global Variables in Denotational SpecificationsDavid A. Schmidt. TOPLAS, 7(2):299-310, 1985. [doi]

1984

A Programming Notation for Tactical ReasoningDavid A. Schmidt. cade 1984: 445-459

1983

Approximation Properties of Abstract Data TypesDavid A. Schmidt. TCS, 24:73-94, 1983.

1980

Compiler generation from denotational semanticsNeil D. Jones, David A. Schmidt. CC 1980: 70-93

State transition machines for lambda calculus expressionsDavid A. Schmidt. CC 1980: 415-440

Sign in or sign up to see more results.

runs on WebDSL