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

AvMooly Sagiv

Häftad, Engelska, 2005

Del i serien Lecture Notes in Computer Science

558 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 14th European Symposium on Programming, ESOP 2005, held in Edinburgh, UK in April 2005 as part of ETAPS.The 28 revised full papers presented with the extended abstract of an invited paper were carefully reviewed and selected from 14 submissions. The papers deal with a broad variety of current issues in the specification, analysis, and implementation of programming languages and systems.

Produktinformation

Utgivningsdatum:2005-03-23
Mått:155 x 235 x 25 mm
Vikt:692 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:442
Upplaga:2005
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540254355

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

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