Programming Languages and Systems
Subtitle: 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings
By: edited by Matthias Felleisen, Philippa Gardner
Contributors: Gardner, Philippa; SpringerLink (Online service)
Series: Lecture Notes in Computer Science -- 7792
Publisher: Springer Berlin Heidelberg; Imprint: Springer
Published: 2013
Place of publication: Berlin, Heidelberg
Language: eng
Format: [electronic resource] :
Number of pages: 620
ISBN-13: 9783642370366
Subjects: Logic design; Programming Techniques; Logics and Meanings of Programs; Computer science; Software engineering; Programming Languages, Compilers, Interpreters
Description: This book constitutes the refereed proceedings of the 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length invited talk, were carefully reviewed and selected from 120 full submissions. The contributions have been organized according to ten topical sections on programming techniques; programming tools; separation logic; gradual typing; shared-memory concurrency and verification; process calculi; taming concurrency; model checking and verification; weak-memory concurrency and verification; and types, inference, and analysis.
Table of contents: title: Distributed Electronic Rights in JavaScript; title: The Compiler Forest; title: Pretty-Big-Step Semantics; title: Language Constructs for Non-Well-Founded Computation; title: Laziness by Need; title: FliPpr: A Prettier Invertible Printing System; title: Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJULIENNE; title: Why3 — Where Programs Meet Provers; title: Compositional Invariant Checking for Overlaid and Nested Linked Lists; title: A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness; title: Modular Reasoning about Separation of Concurrent Data Structures; title: Ribbon Proofs for Separation Logic; title: Abstract Refinement Types; title: Constraining Delimited Control with Contracts; title: Verifying Concurrent Memory Reclamation Algorithms with Grace; title: Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels; title: Verifying Concurrent Programs against Sequential Specifications; title: On Distributability in Process Calculi; title: Behavioral Polymorphism and Parametricity in Session-Based Communication; title: Higher-Order Processes, Functions, and Sessions: A Monadic Integration; title: Concurrent Flexible Reversibility; title: Structural Lock Correlation with Ownership Types; title: Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems; title: Model-Checking Higher-Order Programs with Recursive Types; title: Counterexample-Guided Precondition Inference; title: Information Reuse for Multi-goal Reachability Analyses; title: Quarantining Weakness: Compositional Reasoning under Relaxed Memory Models (Extended Abstract); title: Software Verification for Weak Memory via Program Transformation; title: Checking and Enforcing Robustness against TSO; title: GADTs Meet Subtyping; title: A Data Driven Approach for Algebraic Loop Invariants; title: Automatic Type Inference for Amortised Heap-Space Analysis.