Schmidt, David A. - Department of Computing and Information Sciences, Kansas State University

• Abstract parsing with string updates using LR-parsing technology
• Abstract interpretation from a denotational-semantics perspective
• Data Flow Analysis is Model Checking of Abstract Interpretations David A. Schmidt
• Extending over-approximating an introduction to mixed models
• From Trace Sets to ModalTransition Systems by Stepwise Abstract Interpretation
• overapproximating introduction
• completeness properties of static analyses and their logics
• Abstract Interpretation of SmallStep Semantics David A. Schmidt
• Limiting State Explosion with FilterBased Refinement Matthew B. Dwyer and David A. Schmidt
• Closed and logical relations for over-and under-approximation of powersets
• A calculus of logical relations for over and underapproximating static analyses
• Induction, Domains, Calculi: Strachey's Contributions to ProgrammingLanguage
• An action semantics based on two combinators Kyung-Goo Doh
• NaturalSemanticsBased Abstract Interpretation (Preliminary Version)
• Structure-Preserving Binary Relations for Program Abstraction
• Abstract parsing: static analysis of dynamically generated string
• A Return to Elegance: The Reapplication of Declarative Notation to Software Design
• Partial Evaluation of HigherOrder NaturalSemantics Derivations
• underapproximation Polytechnique
• yesterday's information
• Automata-based Confidentiality Monitoring Gurvan Le Guernic1,2
• TraceBased Abstract Interpretation of Operational Semantics David A. Schmidt
• Stackability in the SimplyTyped CallByValue Lambda Calculus \Lambda
• Internal and External Logics of Abstract Interpretations
• Adapting BigStep Semantics to SmallStep Style: Coinductive Interpretations and ``HigherOrder'' Derivations
• underapproximation Polytechnique
• StateTransition Machines for LambdaCalculus Expressions David A. Schmidt # (schmidt@cis.ksu.edu)
• The Facets of Action Semantics: Some Principles and Applications
• Programming Language Semantics David A. Schmidt
• Binary Relations for Abstraction and David A. Schmidt 1
• Extraction of Strong Typing Laws from Action Semantics Definitions
• Marrying Hoare Logic to Shape Analysis Anindya Banerjee and David Schmidt
• Abstract parsing of string updates and user Kyung-Goo Doh1
• Abstract parsing: static analysis of dynamically generated string
• Extracting program logics from abstract interpretations defined by logical relations
• State-Transition Machines, Revisited David A. Schmidt (schmidt@cis.ksu.edu)
• State-Transition Machines for Lambda-Calculus Expressions David A. Schmidt (schmidt@cis.ksu.edu)
• Comparing completeness properties of static analyses and their logics
• Underapproximating Predicate Transformers David A. Schmidt
• A calculus of logical relations for over-and underapproximating static analyses
• Closed and logical relations for over-and under-approximation of powersets
• From Trace Sets to Modal-Transition Systems by Stepwise Abstract Interpretation
• Abstract parsing: static analysis of dynamically generated string output using
• A brief introduction to static program analysis
• Software Architecture an informal introduction
• Internal and External Logics of Abstract Interpretations
• Extracting program logics from abstract interpretations
• Underapproximating Predicate Transformers
• Closed and logical relations for over-and under-approximation of
• An introduction to separation logic
• Abstract Models of Shape Branching-and Linear-Time
• Guards and Guarantees for Programming
• Software Architecture an informal introduction
• Software Architecture an informal introduction
• Closed and logical relations for over-and under-approximation of
• Abstract Interpretation from a Topological Perspective
• ol l l ly y y ym m m rp p p ph h h
• On the Need for a Popular Formal Semantics David A. Schmidt
• ModelChecking A Tutorial Introduction
• Abstract Interpretation from a Topological Perspective
• Abstract interpretation from a denotational semantics
• LinearTime ``branching
• introduction www.cis.ksu.edu/~schmidt
• A Security Flow Control Algorithm and Its Denotational Semantics Correctness Proof
• UnderapproximationinVMCAI DavidSchmidt
• Underapproximation www.cis.ksu.edu/~schmidt
• Programming (intentionally
• StateTransition Machines, Revisited David A. Schmidt # (schmidt@cis.ksu.edu)
• www.cis.ksu.edu/~schmidt 1998--2000).
• Program Analysis as Model Checking of Abstract Interpretations
• Should UML Be Used for Declarative Programming? David A. Schmidt
• Structure-Preserving Binary Relations for Program Abstraction
• interpretations www.cis.ksu.edu/~schmidt
• CIS300 and 200 and the core David Schmidt
• Storeless Semantics and Separation Logic (many preliminary ideas, few technical results!)
• Modular, parsing-based, flow analysis of dictionary data structures in scripting languages
• Inverse-Limit and Topological Aspects of Abstract Interpretation
• Abstract LR-parsing Kyung-Goo Doh1
• Abstract LR-parsing Kyung-Goo Doh1