LEADER 05872nam 22007575 450 001 9910483380303321 005 20251226202910.0 010 $a3-540-48816-2 024 7 $a10.1007/11921240 035 $a(CKB)1000000000284030 035 $a(SSID)ssj0000320361 035 $a(PQKBManifestationID)11937781 035 $a(PQKBTitleCode)TC0000320361 035 $a(PQKBWorkID)10249390 035 $a(PQKB)11069507 035 $a(DE-He213)978-3-540-48816-3 035 $a(MiAaPQ)EBC3068576 035 $a(PPN)123139538 035 $a(EXLCZ)991000000000284030 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheoretical Aspects of Computing - ICTAC 2006 $eThird International Colloquium, Tunis, Tunisia, November 20-24, 2006 Proceedings /$fedited by Kamel Barkaoui, Ana Cavalcanti, Antonio Cerone 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XVI, 376 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4281 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-48815-4 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Verifying a Hotel Key Card System -- Z/Eves and the Mondex Electronic Purse -- Verification Constraint Problems with Strengthening -- Semantics -- Quantitative ?-Calculus Analysis of Power Management in Wireless Networks -- Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa -- A Topological Approach of the Web Classification -- Concurrency -- Bisimulation Congruences in the Calculus of Looping Sequences -- Stronger Reduction Criteria for Local First Search -- A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes -- A Petri Net Translation of ?-Calculus Terms -- Model Checking -- Handling Algebraic Properties in Automatic Analysis of Security Protocols -- A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems -- Thread-Modular Verification Is Cartesian Abstract Interpretation -- Formal Languages -- Capture-Avoiding Substitution as a Nominal Algebra -- Prime Decomposition Problem for Several Kinds of Regular Codes -- A New Approach to Determinisation Using Bit-Parallelism -- Logic and Type Theory -- Proving ATL* Properties of Infinite-State Systems -- Type Safety for FJ and FGJ -- Partizan Games in Isabelle/HOLZF -- Proof-Producing Program Analysis -- Real-Time and Mobility -- Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting -- Interesting Properties of the Real-Time Conformance Relation tioco -- Model Checking Duration Calculus: A Practical Approach -- Spatio-temporal Model Checking for Mobile Real-Time Systems -- Tutorials: Extended Abstracts -- Tutorial on Formal Methods for Distributed and Cooperative Systems -- Decision Procedures for the Formal Analysis of Software. 330 $aThe 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4281 606 $aComputer science 606 $aMachine theory 606 $aCompilers (Computer programs) 606 $aSoftware engineering 606 $aTheory of Computation 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aCompilers and Interpreters 606 $aSoftware Engineering 615 0$aComputer science. 615 0$aMachine theory. 615 0$aCompilers (Computer programs). 615 0$aSoftware engineering. 615 14$aTheory of Computation. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aCompilers and Interpreters. 615 24$aSoftware Engineering. 676 $a004 701 $aBarkaoui$b Kamel$01743568 701 $aCavalcanti$b Ana$01736503 701 $aCerone$b Antonio$0297220 712 12$aICTAC 2006 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483380303321 996 $aTheoretical Aspects of Computing - ICTAC 2006$94522620 997 $aUNINA