APLAS 2011: Shanghai, China

Invited Talks

• Aditya V. Nori, Sriram K. Rajamani:
  Program Analysis and Machine Learning: A Win-Win Deal. 1-2
  
• Ranjit Jhala:
  Software Verification with Liquid Types. 3
  
• Nikolaj Bjørner:
  Engineering Theories with Z3. 4-16
  
• Peter W. O'Hearn:
  Algebra, Logic, Locality, Concurrency. 17-18
  

Session 1: Program Analysis

• David Monniaux, Martin Bodin:
  Modular Abstractions of Reactive Nodes Using Disjunctive Invariants. 19-33
  
• Thao Dang, Thomas Martin Gawlitza:
  Template-Based Unbounded Time Verification of Affine Hybrid Automata. 34-49
  
• Hakjoo Oh, Kwangkeun Yi:
  Access-Based Localization with Bypassing. 50-65
  
• Fernando Sáenz-Pérez, Rafael Caballero, Yolanda García-Ruiz:
  A Deductive Database with Datalog and SQL Query Languages. 66-73
  

Session 2: Functional Programming

• Yun-Yan Chi, Shin-Cheng Mu:
  Constructing List Homomorphisms from Proofs. 74-88
  
• Dmitriy Traytel, Stefan Berghofer, Tobias Nipkow:
  Extending Hindley-Milner Type Inference with Coercive Structural Subtyping. 89-104
  
• Yuichiro Kokaji, Yukiyoshi Kameyama:
  Polymorphic Multi-stage Language with Control Effects. 105-120
  

Session 3: Compiler

• Zhen Cao, Yuan Dong, Shengyuan Wang:
  Compiler Backend Generation for Application Specific Instruction Set Processors. 121-136
  
• Benoit Boissinot, Florian Brandner, Alain Darte, Benoît Dupont de Dinechin, Fabrice Rastello:
  A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs. 137-154
  
• Yulei Sui, Sen Ye, Jingling Xue, Pen-Chung Yew:
  SPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA. 155-171
  

Session 4: Concurrency 1

• Alexander Malkis, Laurent Mauborgne:
  On the Strength of Owicki-Gries for Resources. 172-187
  
• Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenko:
  Solving Recursion-Free Horn Clauses over LI+UIF. 188-203
  
• Akimasa Morihata:
  Macro Tree Transformations of Linear Size Increase Achieve Cost-Optimal Parallelism. 204-219
  
• Jonas Magazinius, Aslan Askarov, Andrei Sabelfeld:
  Decentralized Delimited Release. 220-237
  

Session 5: Concurrency 2

• Elvira Albert, Puri Arenas, Samir Genaim, Miguel Gómez-Zamalloa, German Puebla:
  Cost Analysis of Concurrent OO Programs. 238-254
  
• Ana Milanova, Wei Huang:
  Static Object Race Detection. 255-271
  
• Jade Alglave, Daniel Kroening, John Lugton, Vincent Nimal, Michael Tautschnig:
  Soundness of Data Flow Analyses for Weak Memory Models. 272-288
  

Session 6: Semantics

• Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale:
  Towards a General Theory of Barbs, Contexts and Labels. 289-304
  
• Ulrich Schöpp:
  Computation-by-Interaction with Effects. 305-321
  

Session 7: Certification and Logic

• Lukasz Fronc, Franck Pommereau:
  Towards a Certified Petri Net Model-Checker. 322-336
  
• Patrick Baillot:
  Elementary Linear Logic Revisited for Polynomial Time and an Exponential Time Hierarchy. 337-352
  
• Keiko Nakata, Tarmo Uustalu, Marc Bezem:
  A Proof Pearl with the Fan Theorem and Bar Induction - Walking through Infinite Trees with Mixed Induction and Coinduction. 353-368
  
• Casey Klein, Jay A. McCarthy, Steven Jaconette, Robert Bruce Findler:
  A Semantics for Context-Sensitive Reduction Semantics. 369-383
  

Last update Tue May 22 23:22:46 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page