Abstract is missing.
- A Query Language Based on the Ambient LogicLuca Cardelli, Giorgio Ghelli. 1-22 [doi]
- Probabilistic Polynomial-Time Process Calculus and Security Protocol AnalysisJohn C. Mitchell. 23-29 [doi]
- A Systematic Approach to Static Access ControlFrançois Pottier, Christian Skalka, Scott F. Smith. 30-45 [doi]
- Secure Information Flow and CPSSteve Zdancewic, Andrew C. Myers. 46-61 [doi]
- Enforcing Safety Properties Using Type SpecializationPeter Thiemann. 62-76 [doi]
- Semantics and Program Analysis of Computationally Secure Information FlowPeeter Laud. 77-91 [doi]
- Encoding Intensional Type AnalysisStephanie Weirich. 92-106 [doi]
- Fusion on LanguagesRoland Carl Backhouse. 107-121 [doi]
- Programming the Web with High-Level Programming LanguagesPaul T. Graunke, Shriram Krishnamurthi, Steve Van Der Hoeven, Matthias Felleisen. 122-136 [doi]
- On the Completeness of Model CheckingFrancesco Ranzato. 137-154 [doi]
- Modal Transition Systems: A Foundation for Three-Valued Program AnalysisMichael Huth, Radha Jagadeesan, David A. Schmidt. 155-169 [doi]
- Entailment with Conditional Equality ConstraintsZhendong Su, Alexander Aiken. 170-189 [doi]
- On the Complexity of Constant PropagationMarkus Müller-Olm, Oliver Rüthing. 190-205 [doi]
- What Are Polymorphically-Typed Ambients?Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen. 206-220 [doi]
- JOIN(X): Constraint-Based Type Inference for the Join-CalculusSylvain Conchon, François Pottier. 221-236 [doi]
- Modular Causality in a Synchronous Stream LanguagePascal Cuoq, Marc Pouzet. 237-251 [doi]
- Control-Flow Analysis in Cubic TimeFlemming Nielson, Helmut Seidl. 252-268 [doi]
- The Recursive Record Semantics of Objects RevisitedGérard Boudol. 269-283 [doi]
- A Formalisation of Java s Exception MechanismBart Jacobs. 284-301 [doi]
- A Formal Executable Semantics of the JavaCard PlatformGilles Barthe, Guillaume Dufay, Line Jakubiec, Bernard P. Serpette, Simão Melo de Sousa. 302-319 [doi]
- Modeling an Algebraic StepperJohn Clements, Matthew Flatt, Matthias Felleisen. 320-334 [doi]
- Typestate Checking of Machine CodeZhichen Xu, Thomas W. Reps, Barton P. Miller. 335-351 [doi]
- Proof-Directed De-compilation of Low-Level CodeShin-ya Katsumata, Atsushi Ohori. 352-366 [doi]
- Backwards Abstract Interpretation of Probabilistic ProgramsDavid Monniaux. 367-382 [doi]
- Tool Demonstration: Finding Duplicated Code Using Program DependencesRaghavan Komondoor, Susan Horwitz. 383-386 [doi]
- Compiling Problem Specifications into SATMarco Cadoli, Andrea Schaerf. 387-401 [doi]
- Semantics and Termination of Simply-Moded Logic Programs with Dynamic SchedulingAnnalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus. 402-416 [doi]
- The Def-inite Approach to Dependency AnalysisSamir Genaim, Michael Codish. 417-432 [doi]