Programming Languages and Systems

1. Front Matter

   PDF

2. Invited Talks

   1. Program Analysis and Machine Learning: A Win-Win Deal

      • Aditya V. Nori, Sriram K. Rajamani

      Pages 1-2

   2. Software Verification with Liquid Types

      • Ranjit Jhala

      Pages 3-3

   3. Engineering Theories with Z3

      • Nikolaj Bjørner

      Pages 4-16

   4. Algebra, Logic, Locality, Concurrency

      • Peter W. O’Hearn

      Pages 17-18

3. Session 1: Program Analysis

   1. Modular Abstractions of Reactive Nodes Using Disjunctive Invariants

      • David Monniaux, Martin Bodin

      Pages 19-33

   2. Template-Based Unbounded Time Verification of Affine Hybrid Automata

      • Thao Dang, Thomas Martin Gawlitza

      Pages 34-49

   3. Access-Based Localization with Bypassing

      • Hakjoo Oh, Kwangkeun Yi

      Pages 50-65

   4. A Deductive Database with Datalog and SQL Query Languages

      • Fernando Sáenz-Pérez, Rafael Caballero, Yolanda García-Ruiz

      Pages 66-73

4. Session 2: Functional Programming

   1. Constructing List Homomorphisms from Proofs

      • Yun-Yan Chi, Shin-Cheng Mu

      Pages 74-88

   2. Extending Hindley-Milner Type Inference with Coercive Structural Subtyping

      • Dmitriy Traytel, Stefan Berghofer, Tobias Nipkow

      Pages 89-104

   3. Polymorphic Multi-stage Language with Control Effects

      • Yuichiro Kokaji, Yukiyoshi Kameyama

      Pages 105-120

5. Session 3: Compiler

   1. Compiler Backend Generation for Application Specific Instruction Set Processors

      • Zhen Cao, Yuan Dong, Shengyuan Wang

      Pages 121-136

   2. A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs

      • Benoit Boissinot, Florian Brandner, Alain Darte, Benoît Dupont de Dinechin, Fabrice Rastello

      Pages 137-154

   3. SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA

      • Yulei Sui, Sen Ye, Jingling Xue, Pen-Chung Yew

      Pages 155-171

6. Session 4: Concurrency 1

   1. On the Strength of Owicki-Gries for Resources

      • Alexander Malkis, Laurent Mauborgne

      Pages 172-187

   2. Solving Recursion-Free Horn Clauses over LI+UIF

      • Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko

      Pages 188-203

   3. Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism

      • Akimasa Morihata

      Pages 204-219

   4. Decentralized Delimited Release

      • Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld

      Pages 220-237

7. Session 5: Concurrency 2

   1. Cost Analysis of Concurrent OO Programs

      • Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, German Puebla

      Pages 238-254

This book constitutes the refereed proceedings of the 9th Asian Symposium on Programming Languages and Systems, APLAS 2011, held in Kenting, Taiwan, in December 2011. The 22 revised full papers presented together with 4 invited talks and one system and tool presentations were carefully reviewed and selected from 64 submissions. The papers are organized in topical sections on program analysis; functional programming; compiler; concurrency; semantics; as well as certification and logic.

• SQL
• deductive databases
• explicit model-checking
• reactive systems
• relational databases

• Department of Computer Science, University of Oxford, Oxford, UK

  Hongseok Yang

Policies and ethics