Programming Languages and Systems -

. .

Résumé :
This book constitutes the refereed proceedings of the 11th Asian Symposium on Programming Languages and Systems, APLAS 2013, held in Melbourne, Australia, in December 2013. The 20 regular papers presented together with the abstracts of 3 invited talks were carefully reviewed and selected from 57 submissions. The papers cover a variety of foundational and practical issues in programming languages and systems.

Sommaire:
Brzozowski's and Up-To Algorithms for Must Testing.- Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes.- Model Checking Dynamic Pushdown Networks.- Robustness Analysis of Finite Precision Implementations.- A Hoare Logic for SIMT Programs.- The Undefined Domain: Precise Relational Information for Entities That Do Not Exist .- Separation Logic Modulo Theories.-Bi-abduction with Pure Properties for Specification Inference .- Laws of Programming for References.- Dynamic Alias Protection with Aliasing Contracts.- Fine-Grained Function Visibility for Multiple Dispatch with Multiple Inheritance.- Internal Deployment of the Parfait Static Code Analysis Tool at Oracle (Invited Talk).- Secure Compilation of Object-Oriented Components to Protected Module Architectures.- Generalized Quantitative Analysis of Metric Transition Systems.- GDSL: A Universal Toolkit for Giving Semantics to Machine Language.- Paragon for Practical Programming with Information-Flow Control.- This Java: An Extension of Java with Exact Types.- Semantics of Probabilistic Programs: A Weak Limit Approach.- Ambivalent Types for Principal Type Inference with GADTs.- Temporal Specification Mining for Anomaly Analysis.- Automated Inference of Library Specifications for Source-Sink Property Verification.- The Proof Assistant as an Integrated Development Environment.- Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries.- Environmental Bisimulations for Delimited-Control Operators.- On Bar Recursion and Choice in a Classical Setting.- Proofs, Upside Down: A Functional Correspondence between Natural Deduction and the Sequent Calculus.