11. ASIAN 2006: Tokyo, Japan

• Akira Matsunaga, Tsutomu Matsumoto:
  Security Evaluation of a Type of Table-Network Implementation of Block Ciphers. 1-12
  
• Yannick Chevalier, Mounira Kourjieh:
  A Symbolic Intruder Model for Hash-Collision Attacks. 13-27
  
• Huibiao Zhu, Geguang Pu, Jifeng He:
  A Denotational Approach to Scope-Based Compensable Flow Language for Web Service. 28-36
  
• Tarjei K. Mandt, Chik How Tan:
  Certificateless Authenticated Two-Party Key Agreement Protocols. 37-44
  
• Thierry Sans, Frédéric Cuppens, Nora Cuppens-Boulahia:
  FORM : A Federated Rights Expression Model for Open DRM Frameworks. 45-59
  
• Masatomo Hashimoto:
  A Method of Safety Analysis for Runtime Code Update. 60-74
  
• Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jensen, David A. Schmidt:
  Automata-Based Confidentiality Monitoring. 75-89
  
• Nai Xia, Bing Mao, Qingkai Zeng, Li Xie:
  Efficient and Practical Control Flow Monitoring for Program Security. 90-104
  
• Ming-Hsien Tsai, Bow-Yaw Wang:
  Modular Formalization of Reactive Modules in COQ. 105-119
  
• Alejandro Russo, John Hughes, David A. Naumann, Andrei Sabelfeld:
  Closing Internal Timing Channels by Transformation. 120-135
  
• Lucia Acciai, Michele Boreale:
  Responsiveness in Process Calculi. 136-150
  
• Vincent Bernat, Hubert Comon-Lundh:
  Normal Proofs in Intruder Theories. 151-166
  
• Iliano Cervesato, Aaron D. Jaggard, Andre Scedrov, Joe-Kai Tsay, Christopher Walstad:
  Breaking and Fixing Public-Key Kerberos. 167-181
  
• Gergei Bana, Payman Mohassel, Till Stegers:
  Computational Soundness of Formal Indistinguishability and Static Equivalence. 182-196
  
• Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell, Jean-Pierre Seifert:
  Secrecy Analysis in Protocol Composition Logic. 197-213
  
• Zhaohui Luo:
  A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations. 214-222
  
• Slawomir Lasota, David Nowak, Yu Zhang:
  On Completeness of Logical Relations for Monadic Types. 223-230
  
• Zining Cao:
  A Spatial Logical Characterisation of Context Bisimulation. 231-239
  
• Qin Ma, Luc Maranget:
  Information Hiding in the Join Calculus. 240-247
  
• Nguyen Van Tang, Dang Van Hung, Mizuhito Ogawa:
  Modeling Urgency in Component-Based Real-Time Systems. 248-255
  
• Khandoker Asadul Islam, Yoshimichi Watanabe:
  Maintaining Data Consistency of XML Databases Using Verification Techniques. 256-263
  
• Souhei Ito, Shigeki Hagihara, Naoki Yonezaki:
  An Operational Semantics of Program Dependence Graphs for Unstructured Programs. 264-271
  
• Patrick Cousot, Radhia Cousot, Jérôme Feret, Laurent Mauborgne, Antoine Miné, David Monniaux, Xavier Rival:
  Combination of Abstractions in the ASTRÉE Static Analyzer. 272-300
  
• Naokata Shikuma, Atsushi Igarashi:
  Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-Calculus. 301-315
  
• Ming-Hsien Tsai, Bow-Yaw Wang:
  Formalization of CTL* in Calculus of Inductive Constructions. 316-330
  
• Corneliu Popeea, Wei-Ngan Chin:
  Inferring Disjunctive Postconditions. 331-345
  
• Reynald Affeldt, Nicolas Marti:
  An Approach to Formal Verification of Arithmetic Functions in Assembly. 346-360