2. ICTAC 2005: Hanoi, Vietnam

Invited Speakers

• José Meseguer:
  A Rewriting Logic Sampler. 1-28
  
• Do Long Van, Kieu Van Hung, Phan Trung Huy:
  Codes and Length-Increasing Transitive Binary Relations. 29-48
  
• Rocco De Nicola:
  Languages and Process Calculi for Network Aware Programming - Short Summary -. 49-52
  
• Reiko Heckel:
  Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks. 53-69
  
• Jifeng He, Xiaoshan Li, Zhiming Liu:
  Component-Based Software Engineering. 70-95
  

Formal Languages

• Yo-Sub Han, Derick Wood:
  Outfix-Free Regular Languages and Prime Outfix-Free Decomposition. 96-109
  
• Sébastien Limet, Pierre Pillot:
  Solving First Order Formulae of Pseudo-Regular Theory. 110-124
  
• K. G. Subramanian, A. Roslin Sagaya Mary, K. S. Dersanambika:
  Splicing Array Grammar Systems. 125-135
  

Computer Science Logics

• Naijun Zhan, Jinzhao Wu:
  Compositionality of Fixpoint Logic with Chop. 136-150
  
• Linh Anh Nguyen:
  An SLD-Resolution Calculus for Basic Serial Multimodal Logics. 151-165
  
• Koji Iwanuma, Katsumi Inoue, Hidetomo Nabeshima:
  Upside-Down Transformation in SOL/Connection Tableaux and Its Application. 166-179
  

Program Construction

• Tran Van Dung:
  On the Stability Semantics of Combinational Programs. 180-194
  
• Jianguo Zhou, Yifeng Chen:
  Generating C Code from LOGS Specifications. 195-210
  
• Alberto de la Encina, Luis Llana, Fernando Rubio:
  Formalizing the Debugging Process in Haskell. 211-226
  
• Hoang Truong, Marc Bezem:
  Finding Resource Bounds in the Presence of Explicit Deallocation. 227-241
  

Real-Time Systems

• Raymond T. Boute, Andreas Schäfer:
  The Timer Cascade: Functional Modelling and Real Time Calculi. 242-256
  
• Martin Fränzle, Michael R. Hansen:
  A Robust Interpretation of Duration Calculus. 257-271
  
• Rongjie Yan, Guangyuan Li, Zhisong Tang:
  Symbolic Model Checking of Finite Precision Timed Automata. 272-287
  

Concurrency and Refinement

• Ranald Clouston, Robert Goldblatt:
  Covarieties of Coalgebras: Comonads and Coequations. 288-302
  
• Jifeng He, C. A. R. Hoare:
  Linking Theories of Concurrency. 303-317
  
• Rob J. van Glabbeek:
  On Cool Congruence Formats for Weak Bisimulations. 318-333
  
• Michel Bidoit, Rolf Hennicker:
  Externalized and Internalized Notions of Behavioral Refinement. 334-350
  

Software Security

• Fausto Spoto:
  Information Flow Is Linear Refinement of Constancy. 351-365
  
• Gérard Boudol:
  On Typing Information Flow. 366-380
  
• Chen Zhao, NuerMaimaiti Heilili, Shengping Liu, Zuoquan Lin:
  Representation and Reasoning on RBAC: A Description Logic Approach. 381-393
  
• Carole Delporte-Gallet, Hugues Fauconnier, Felix C. Freiling:
  Revisiting Failure Detection and Consensus in Omission Failure Environments. 394-408
  

Quantitative Logics

• Ernst-Erich Doberkat:
  Congruences and Bisimulations for Continuous-Time Stochastic Logic. 409-423
  
• Manas Patra:
  A Logic for Quantum Circuits and Protocols. 424-438
  
• Orieta Celiku:
  Quantitative Temporal Logic Mechanized in HOL. 439-453
  
• Natalia López, Manuel Núñez:
  Weak Stochastic Bisimulation for Non-markovian Processes. 454-468
  

Object-Orientation and Component Systems

• Sun Meng, Luís Soares Barbosa, Zhang Naixiao:
  On Refinement of Software Architectures. 469-484
  
• Quan Long, Zongyan Qiu, Zhiming Liu, Lingshuang Shao, Jifeng He:
  POST: A Case Study for an Incremental Development in rCOS. 485-500
  
• Kenro Yatake, Toshiaki Aoki, Takuya Katayama:
  Implementing Application-Specific Object-Oriented Theories in HOL. 501-516
  
• Nguyen Truong Thang, Takuya Katayama:
  Constructing Open Systems via Consistent Components. 517-531
  

Model-Checking and Algorithms

• Jan Friso Groote, Misa Keinänen:
  A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems. 532-545
  
• Antti Puhakka:
  Using Fairness Constraints in Process-Algebraic Verification. 546-561
  
• Isao Sasano, Mizuhito Ogawa, Zhenjiang Hu:
  Maximum Marking Problems with Accumulative Weight Functions. 562-578
  

Applied Logics and Computing Theory

• Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion:
  Toward an Abstract Computer Virology. 579-593
  
• Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran:
  On Superposition-Based Satisfiability Procedures and Their Combination. 594-608
  

Tutorials

• Dang Van Hung:
  A Summary of the Tutorials at ICTAC 2005. 609-612