APLAS 2007: Singapore

Invited Talk 1

• Vijay A. Saraswat:
  X10: Concurrent Programming for Modern Architectures. 1
  

Session 1

• Paritosh Shroff, Christian Skalka, Scott F. Smith:
  The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification. 2-18
  
• Alexey Gotsman, Josh Berdine, Byron Cook, Noam Rinetzky, Mooly Sagiv:
  Local Reasoning for Storable Locks and Threads. 19-37
  
• Olaf Chitil, Frank Huch:
  Monadic, Prompt Lazy Assertions in Haskell. 38-53
  

Session 2

• Burak Emir, Qin Ma, Martin Odersky:
  Translation Correctness for First-Order Object-Oriented Pattern Matching. 54-70
  
• Luc Bläser:
  Persistent Oberon: A Programming Language with Integrated Persistence. 71-85
  
• Dachuan Yu:
  More Typed Assembly Languages for Confidentiality. 86-104
  

Session 3

• Lingzhong Zhao, Tianlong Gu, Junyan Qian, Guoyong Cai:
  A Novel Test Case Generation Method for Prolog Programs Based on Call Patterns Semantics. 105-121
  
• Bernd Braßel, Frank Huch:
  On a Tighter Integration of Functional and Logic Programming. 122-138
  

Invited Talk 2

• Vincent Danos, Jérôme Feret, Walter Fontana, Jean Krivine:
  Scalable Simulation of Cellular Signaling Networks. 139-157
  

Session 4

• Martin Berger, Nobuko Yoshida:
  Timed, Distributed, Probabilistic, Typed Processes. 158-174
  
• Jean Goubault-Larrecq, Catuscia Palamidessi, Angelo Troina:
  A Probabilistic Applied Pi-Calculus. 175-190
  
• Daisuke Kikuchi, Naoki Kobayashi:
  Type-Based Verification of Correspondence Assertions for Communication Protocols. 191-205
  

Session 5

• Atsushi Igarashi, Masashi Iwaki:
  Deriving Compilers and Virtual Machines for a Multi-level Language. 206-221
  
• Jacques Carette, Oleg Kiselyov, Chung-chieh Shan:
  Finally Tagless, Partially Evaluated. 222-238
  
• Kenichi Asai, Yukiyoshi Kameyama:
  Polymorphic Delimited Continuations. 239-254
  

Session 6

• Cristiano Calcagno, Thomas Dinsdale-Young, Philippa Gardner:
  Adjunct Elimination in Context Logic for Trees. 255-270
  
• Stefano Berardi, Makoto Tatsuta:
  Positive Arithmetic Without Exchange Is a Subclassical Logic. 271-285
  
• Andreas Abel:
  Mixed Inductive/Coinductive Types and Strong Normalization. 286-301
  

Invited Talk 3

• Sriram K. Rajamani:
  Static and Dynamic Analysis: Better Together. 302
  

Session 7

• Neil D. Jones, René Rydhof Hansen:
  The Semantics of "Semantic Patches" in Coccinelle: Program Transformation for the Working Programmer. 303-318
  
• Jiu-Tao Nie, Xu Cheng:
  An Efficient SSA-Based Algorithm for Complete Global Value Numbering. 319-334
  
• Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
  A Systematic Approach to Probabilistic Pointer Analysis. 335-350
  

Session 8

• Damien Pous:
  Complete Lattices and Up-To Techniques. 351-366
  
• Alwen Tiu:
  A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract. 367-382
  
• Jesús Aranda, Cinzia Di Giusto, Mogens Nielsen, Frank D. Valencia:
  CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence. 383-398
  

Session 9

• Yoshihiko Kakutani:
  Call-by-Name and Call-by-Value in Normal Modal Logic. 399-414
  
• Daisuke Kimura:
  Call-by-Value Is Dual to Call-by-Name, Extended. 415-430