## Theoretical Aspects of Computing - ICTAC 2006: Third International Colloquium, Tunis, Tunisia, November 20-24, 2006 ProceedingsThe 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Verifying a Hotel Key Card System | 1 |

ZEves and the Mondex Electronic Purse | 15 |

Verification Constraint Problems with Strengthening | 35 |

Quantitative μCalculus Analysis of Power Management in Wireless Networks | 50 |

Termination and Divergence Are Undecidable Under a Maximum Progress Multistep Semantics for LinCa | 65 |

A Topological Approach of the Web Classification | 80 |

Bisimulation Congruences in the Calculus of Looping Sequences | 93 |

Stronger Reduction Criteria for Local First Search | 108 |

Prime Decomposition Problem for Several Kinds of Regular Codes | 213 |

A New Approach to Determinisation Using BitParallelism | 228 |

Proving ATL Properties of InfiniteState Systems | 242 |

Type Safety for FJ and FGJ | 257 |

Partizan Games in IsabelleHOLZF | 272 |

ProofProducing Program Analysis | 287 |

Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting | 302 |

Interesting Properties of the RealTime Conformance Relation tioco | 317 |

A LatticeTheoretic Model for an Algebra of Communicating Sequential Processes | 123 |

A Petri Net Translation of πCalculus Terms | 138 |

Handling Algebraic Properties in Automatic Analysis of Security Protocols | 153 |

A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems | 168 |

ThreadModular Verification Is Cartesian Abstract Interpretation | 183 |

CaptureAvoiding Substitution as a Nominal Algebra | 198 |

A Practical Approach | 332 |

Spatiotemporal Model Checking for Mobile RealTime Systems | 347 |

Tutorial on Formal Methods for Distributed and Cooperative Systems | 362 |

Decision Procedures for the Formal Analysis of Software | 366 |

371 | |

### Other editions - View all

### Common terms and phrases

abstract interpretation actions Alexandrov topology algebra algorithm analysis assertion automata automaton axioms Barkaoui binary relation bisimulation bit-vectors Calculus Check-in classiﬁcation Computer Science constraint controllability kernel corresponding currk deﬁned deﬁnition denote deterministic diﬀerent domain downcast Duration Calculus Elem example expression ﬁnd ﬁnite ﬁrst ﬁxed formal formula function given Hamming distance ICTAC iﬀ induction inﬁnite input-complete internal invariant Isabelle/HOL labelled lac Repressor lactose language lattice Lemma LNCS logic maximal elements method model checking Mondex multiset nodes operator parallel composition partial order Partizan Games Petri Petri net preﬁx prime decomposition problem Proc proof properties protocols prove reachability recursive reﬁnement regular code relation result satisﬁes schema Section semantics sequence SPDI speciﬁcation Springer strong bridge structure subset substitution TAIO thatthe theorem tioco topology trace transition system Tuple Space variables veriﬁcation conditions Z/Eves