


default search action
14. ESOP 2005: Edinburgh, UK (Part of ETAPS 2005)
- Shmuel Sagiv:

Programming Languages and Systems, 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings. Lecture Notes in Computer Science 3444, Springer 2005, ISBN 3-540-25435-8 - Andrew C. Myers:

Programming with Explicit Security Policies. 1-4 - Laurent Mauborgne, Xavier Rival:

Trace Partitioning in Abstract Interpretation Based Static Analyzers. 5-20 - Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival:

The ASTREÉ Analyzer. 21-30 - Markus Müller-Olm, Helmut Seidl, Bernhard Steffen:

Interprocedural Herbrand Equalities. 31-45 - Markus Müller-Olm, Helmut Seidl:

Analysis of Modular Arithmetic. 46-60 - Michael Leuschel, Germán Vidal:

Forward Slicing by Conjunctive Partial Deduction and Argument Filtering. 61-76 - Venkatesh Prasad Ranganath

, Torben Amtoft
, Anindya Banerjee, Matthew B. Dwyer, John Hatcliff:
A New Foundation for Control-Dependence and Slicing for Modern Program Structures. 77-93 - Andreas Podelski, Ina Schaefer, Silke Wagner:

Summaries for While Programs with Recursion. 94-107 - Lunjin Lu, Andy King:

Determinacy Inference for Logic Programs. 108-123 - Oukseh Lee, Hongseok Yang, Kwangkeun Yi:

Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis. 124-140 - Cédric Fournet, Andrew D. Gordon, Sergio Maffeis

:
A Type Discipline for Authorization Policies. 141-156 - Véronique Cortier, Bogdan Warinschi:

Computationally Sound, Automated Proofs for Security Protocols. 157-171 - Romain Janvier, Yassine Lakhnech, Laurent Mazaré:

Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries. 172-185 - Steve Kremer, Mark Ryan

:
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus. 186-200 - Hideki Tsuiki, Keiji Sugihara:

Streams with a Bottom in Functional Languages. 201-216 - Olin Shivers, Mitchell Wand:

Bottom-Up beta-Reduction: Uplinks and lambda-DAGs. 217-232 - Bodil Biering, Lars Birkedal

, Noah Torp-Smith:
BI Hyperdoctrines and Higher-Order Separation Logic. 233-247 - Nadia Busi, Gianluigi Zavattaro:

Deciding Reachability in Mobile Ambients. 248-262 - Bernhard Reus, Jan Schwinghammer:

Denotational Semantics for Abadi and Leino's Logic of Objects. 263-278 - Stephen Tse, Steve Zdancewic:

A Design for a Security-Typed Language with Certificate-Based Declassification. 279-294 - Roberto Giacobazzi, Isabella Mastroeni:

Adjoining Declassification and Attack Models by Abstract Interpretation. 295-310 - Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee, George C. Necula:

Enforcing Resource Bounds via Static Verification of Dynamic Checks. 311-325 - Martin Wildmoser, Tobias Nipkow:

Asserting Bytecode Safety. 326-341 - João Costa Seco

, Luís Caires:
Subtyping First-Class Polymorphic Components. 342-356 - Joachim Niehren, Tim Priesnitz, Zhendong Su

:
Complexity of Subtype Satisfiability over Posets. 357-373 - Mayur Naik, Jens Palsberg:

A Type System Equivalent to a Model Checker. 374-388 - Henning Makholm, J. B. Wells:

Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close. 389-407 - Peter Thiemann:

Towards a Type System for Analyzing JavaScript Programs. 408-422 - Alan Jeffrey, Julian Rathke:

Java Jr: Fully Abstract Trace Semantics for a Core Java Language. 423-438

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














