Abstract is missing.
- Programming with Explicit Security PoliciesAndrew C. Myers. 1-4 [doi]
- Trace Partitioning in Abstract Interpretation Based Static AnalyzersLaurent Mauborgne, Xavier Rival. 5-20 [doi]
- The ASTREÉ AnalyzerPatrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival. 21-30 [doi]
- Interprocedural Herbrand EqualitiesMarkus Müller-Olm, Helmut Seidl, Bernhard Steffen. 31-45 [doi]
- Analysis of Modular ArithmeticMarkus Müller-Olm, Helmut Seidl. 46-60 [doi]
- Forward Slicing by Conjunctive Partial Deduction and Argument FilteringMichael Leuschel, Germán Vidal. 61-76 [doi]
- A New Foundation for Control-Dependence and Slicing for Modern Program StructuresVenkatesh Prasad Ranganath, Torben Amtoft, Anindya Banerjee, Matthew B. Dwyer, John Hatcliff. 77-93 [doi]
- Summaries for While Programs with RecursionAndreas Podelski, Ina Schaefer, Silke Wagner. 94-107 [doi]
- Determinacy Inference for Logic ProgramsLunjin Lu, Andy King. 108-123 [doi]
- Automatic Verification of Pointer Programs Using Grammar-Based Shape AnalysisOukseh Lee, Hongseok Yang, Kwangkeun Yi. 124-140 [doi]
- A Type Discipline for Authorization PoliciesCédric Fournet, Andrew D. Gordon, Sergio Maffeis. 141-156 [doi]
- Computationally Sound, Automated Proofs for Security ProtocolsVéronique Cortier, Bogdan Warinschi. 157-171 [doi]
- Completing the Picture: Soundness of Formal Encryption in the Presence of Active AdversariesRomain Janvier, Yassine Lakhnech, Laurent Mazaré. 172-185 [doi]
- Analysis of an Electronic Voting Protocol in the Applied Pi CalculusSteve Kremer, Mark Ryan. 186-200 [doi]
- Streams with a Bottom in Functional LanguagesHideki Tsuiki, Keiji Sugihara. 201-216 [doi]
- Bottom-Up beta-Reduction: Uplinks and lambda-DAGsOlin Shivers, Mitchell Wand. 217-232 [doi]
- BI Hyperdoctrines and Higher-Order Separation LogicBodil Biering, Lars Birkedal, Noah Torp-Smith. 233-247 [doi]
- Deciding Reachability in Mobile AmbientsNadia Busi, Gianluigi Zavattaro. 248-262 [doi]
- Denotational Semantics for Abadi and Leino s Logic of ObjectsBernhard Reus, Jan Schwinghammer. 263-278 [doi]
- A Design for a Security-Typed Language with Certificate-Based DeclassificationStephen Tse, Steve Zdancewic. 279-294 [doi]
- Adjoining Declassification and Attack Models by Abstract InterpretationRoberto Giacobazzi, Isabella Mastroeni. 295-310 [doi]
- Enforcing Resource Bounds via Static Verification of Dynamic ChecksAjay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula. 311-325 [doi]
- Asserting Bytecode SafetyMartin Wildmoser, Tobias Nipkow. 326-341 [doi]
- Subtyping First-Class Polymorphic ComponentsJoão Costa Seco, Luís Caires. 342-356 [doi]
- Complexity of Subtype Satisfiability over PosetsJoachim Niehren, Tim Priesnitz, Zhendong Su. 357-373 [doi]
- A Type System Equivalent to a Model CheckerMayur Naik, Jens Palsberg. 374-388 [doi]
- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and CloseHenning Makholm, J. B. Wells. 389-407 [doi]
- Towards a Type System for Analyzing JavaScript ProgramsPeter Thiemann. 408-422 [doi]
- Java Jr: Fully Abstract Trace Semantics for a Core Java LanguageAlan Jeffrey, Julian Rathke. 423-438 [doi]