ESOP 2005
29 papers
- A Design for a Security-Typed Language with Certificate-Based Declassification
- A New Foundation for Control-Dependence and Slicing for Modern Program Structures
- A Type Discipline for Authorization Policies
- A Type System Equivalent to a Model Checker
- Adjoining Declassification and Attack Models by Abstract Interpretation
- Analysis of Modular Arithmetic
- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus
- Asserting Bytecode Safety
- Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis
- BI Hyperdoctrines and Higher-Order Separation Logic
- Bottom-Up beta-Reduction: Uplinks and lambda-DAGs
- Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries
- Complexity of Subtype Satisfiability over Posets
- Computationally Sound, Automated Proofs for Security Protocols
- Deciding Reachability in Mobile Ambients
- Denotational Semantics for Abadi and Leino's Logic of Objects
- Determinacy Inference for Logic Programs
- Enforcing Resource Bounds via Static Verification of Dynamic Checks
- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close
- Interprocedural Herbrand Equalities
- Java Jr: Fully Abstract Trace Semantics for a Core Java Language
- Programming with Explicit Security Policies
- Streams with a Bottom in Functional Languages
- Subtyping First-Class Polymorphic Components
- Summaries for While Programs with Recursion
- The ASTREÉ Analyzer
- Towards a Type System for Analyzing JavaScript Programs
- Trace Partitioning in Abstract Interpretation Based Static Analyzers