Theoretical Aspects of Computing - ICTAC 2006

1. Front Matter

   PDF

2. Invited Papers

   1. Verifying a Hotel Key Card System

      • Tobias Nipkow

      Pages 1-14

   2. Z/Eves and the Mondex Electronic Purse

      • Jim Woodcock, Leo Freitas

      Pages 15-34

   3. Verification Constraint Problems with Strengthening

      • Aaron R. Bradley, Zohar Manna

      Pages 35-49

3. Semantics

   1. Quantitative μ-Calculus Analysis of Power Management in Wireless Networks

      • A. K. McIver

      Pages 50-64

   2. Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa

      • Mila Majster-Cederbaum, Christoph Minnameier

      Pages 65-79

   3. A Topological Approach of the Web Classification

      • Gabriel Ciobanu, Dănuţ Rusu

      Pages 80-92

4. Concurrency

   1. Bisimulation Congruences in the Calculus of Looping Sequences

      • Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina

      Pages 93-107

   2. Stronger Reduction Criteria for Local First Search

      • Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler

      Pages 108-122

   3. A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes

      • Malcolm Tyrrell, Joseph M. Morris, Andrew Butterfield, Arthur Hughes

      Pages 123-137

   4. A Petri Net Translation of π-Calculus Terms

      • Raymond Devillers, Hanna Klaudel, Maciej Koutny

      Pages 138-152

5. Model Checking

   1. Handling Algebraic Properties in Automatic Analysis of Security Protocols

      • Y. Boichut, P. -C. Héam, O. Kouchnarenko

      Pages 153-167

   2. A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems

      • Gordon Pace, Gerardo Schneider

      Pages 168-182

   3. Thread-Modular Verification Is Cartesian Abstract Interpretation

      • Alexander Malkis, Andreas Podelski, Andrey Rybalchenko

      Pages 183-197

6. Formal Languages

   1. Capture-Avoiding Substitution as a Nominal Algebra

      • Murdoch J. Gabbay, Aad Mathijssen

      Pages 198-212

   2. Prime Decomposition Problem for Several Kinds of Regular Codes

      • Kieu Van Hung, Do Long Van

      Pages 213-227

   3. A New Approach to Determinisation Using Bit-Parallelism

      • Jan Šupol, Bořivoj Melichar

      Pages 228-241

7. Logic and Type Theory

   1. Proving ATL* Properties of Infinite-State Systems

      • Matteo Slanina, Henny B. Sipma, Zohar Manna

      Pages 242-256

   2. Type Safety for FJ and FGJ

      • Shuling Wang, Quan Long, Zongyan Qiu

      Pages 257-271

   3. Partizan Games in Isabelle/HOLZF

      • Steven Obua

      Pages 272-286

The International Colloquium on Theoretical Aspects of Computing (ICTAC) held in 2006 in Tunis, Tunisia, was the third of a series of events created by the InternationalInstituteforSoftwareTechnologyoftheUnitedNationsUniversity. The aim of the colloquium is to bring together researchers from academia, - dustry, and governmentto present their results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing. The previous events were held in Guiyang, China (2004), and Hanoi, Vi- nam (2005). Beyond its scholarly goals, another main purpose of ICTAC is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries, as in the mandate of the United Nations University. These proceedings record the contributions from the invited speakers and from the technical sessions. We present four invited papers, 21 technical papers, selected out of 78 submissions from 24 countries, and two extended abstracts of tutorials. The Programme Committee includes researchers from 27 countries. Each of the 78 papers was evaluated by at least three reviewers. After the evaluation, reports were returned to the Programme Committee for discussion and reso- tion of con?icts. Based on their recommendations, we concluded the consensus process, and selected the 21 papers that we present here. For the evaluation of the submitted tutorials, this year we had the help of a separate Programme Committee especially invited for that purpose.

• Isabelle
• automata theory
• concurrent systems
• cooperative systems
• formal language
• formal languages
• formal method
• formal methods
• logic
• logical foundations
• mobility
• model checking
• probabilistic methods
• real-time
• verification

• Laboratoire CEDRIC, Conservatoire National des Arts et Métiers, France

  Kamel Barkaoui

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

  Ana Cavalcanti

• UNU-IIST, Macau SAR, China

  Antonio Cerone

Policies and ethics