Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings

Cover
Springer Science & Business Media, 28.09.2005 - 409 Seiten
The 9th Italian Conference on Theoretical Computer Science (ICTCS 2005)was held at the Certosa di Pontignano, Siena, Italy, on October 12-14 2005. The Certosa di Pontignano is the conference center of the University of Siena; it is located 8 km away from the town and it is in the Chianti region. The Certosa is a place full of history (founded in the 15th century, it was set on ?re a century later and reconstructed) and of valuable artworks, like frescoes of the Scuola Senese. Previous conferences took place in Pisa (1972), Mantova (1974 and 1989), L'Aquila(1992), Ravello(1995), Prato(1998), Turin(2001)andBertinoro(2003). Theconferenceaimsatbringingtogethercomputerscientists, especiallyyoung researchers, to foster cooperation, exchange of ideas and results. Great e'orts have been made to attract researchers from all over the world. The main t- ics of the conference cover all the ?elds of theoretical computer science and include analysis and design of algorithms, computability, computational c- plexity, cryptography, formal languages and automata, foundations of progr- ming languages and program analysis, foundations of arti'cial intelligence and knowledge representation, foundations of web programming, natural computing paradigms (quantum computing, bioinformatics), parallel and distributed c- putation, program speci'cation and veri'cation, term rewriting, theory of c- currency, theory of data bases, theory of logical design and layout, type theory, security, and symbolic and algebraic computation.
 

Inhalt

Invited Contributions
1
Biological Systems as Reactive Systems
21
Pickup and Delivery for Moving Objects on Broken Lines
36
A Static Analysis of PKIBased Systems
51
Subtyping Object and Recursive Types Logically
66
Circuits Computations and Classical Logic
81
Checking Risky Events Is Enough for Local Policies
97
Confluence and Expressiveness
113
On the Computational Complexity of the L21Labeling Problem
228
Laxity Helps in Broadcast Scheduling
251
Enforcing and Defying Associativity Commutativity Totality
265
Synthesis from Temporal Specifications Using Preferred Answer
280
Model Checking Strategic Abilities of Agents Under Incomplete
295
Improved Algorithms for PolynomialTime Decay and TimeDecay
309
A Theoretical Analysis of Alignment and Edit Problems for Trees
323
A Complete Formulation of Generalized Affine Equivalence
338

Safe Object Composition in the Presence of Subtyping
128
Reachability Analysis in Boxed Ambients
143
Error Mining for Regular Expression Patterns
160
Reconstructing an Alternate Periodical Binary Matrix from
173
Faster Deterministic Wakeup in Multiple Access Channels
196
Quantum Algorithms for a Set of Group Theoretic Problems
215
A Typed Assembly Language for Noninterference
360
Improved Exact Exponential Algorithms for Vertex Bipartization
375
A Typed Semantics of HigherOrder Store and Subtyping
390
Two Variables Are Not Enough
406
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Bibliografische Informationen