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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Sagiv, Mooly (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Σειρά: Lecture Notes in Computer Science, 3444
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Computer Science.; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Software Engineering.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

ETAPS 2005 was the eighth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conf- ences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS)...

Πίνακας περιεχομένων:

• 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.