Exploring New Frontiers of Theoretical Informatics (eBook)

IFIP 18th World Computer Congress TC1 3rd International Conference on Theoretical Computer Science (TCS2004) 22-27 August 2004 Toulouse, France

Jean-Jacques Levy, Ernst W. Mayr, John C. Mitchell (Herausgeber)

eBook Download: PDF

2006 | 1. Auflage
689 Seiten
Springer US (Verlag)
978-1-4020-8141-5 (ISBN)

Infos

In recent years, IT application scenarios have evolved in very innovative ways. Highly distributed networks have now become a common platform for large-scale distributed programming, high bandwidth communications are inexpensive and widespread, and most of our work tools are equipped with processors enabling us to perform a multitude of tasks. In addition, mobile computing (referring specifically to wireless devices and, more broadly, to dynamically configured systems) has made it possible to exploit interaction in novel ways.

To harness the flexibility and power of these rapidly evolving, interactive systems, there is need of radically new foundational ideas and principles; there is need to develop the theoretical foundations required to design these systems and to cope with the many complex issues involved in their construction; and there is need to develop effective principles for building and analyzing such systems. Reflecting the diverse and wide spectrum of topics and interests within the theoretical computer science community, "Exploring New Frontiers of Theoretical Informatics", is presented in two distinct, but interrelated tracks: Algorithms, Complexity and Models of Computation, and Logic, Semantics, Specification and Verification.

"Exploring New Frontiers of Theoretical Informatics" contains 46 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 3rd IFIP International Conference on Theoretical Computer Science (TCS 2004), which was held in conjunction with the 18th World Computer Congress in Toulouse, France in August 2004 and sponsored by the International Federation for Information Processing (IFIP).



 

---

In recent years, IT application scenarios have evolved in very innovative ways. Highly distributed networks have now become a common platform for large-scale distributed programming, high bandwidth communications are inexpensive and widespread, and most of our work tools are equipped with processors enabling us to perform a multitude of tasks. In addition, mobile computing (referring specifically to wireless devices and, more broadly, to dynamically configured systems) has made it possible to exploit interaction in novel ways. To harness the flexibility and power of these rapidly evolving, interactive systems, there is need of radically new foundational ideas and principles; there is need to develop the theoretical foundations required to design these systems and to cope with the many complex issues involved in their construction; and there is need to develop effective principles for building and analyzing such systems.Reflecting the diverse and wide spectrum of topics and interests within the theoretical computer science community, Exploring New Frontiers of Theoretical Informatics, is presented in two distinct but interrelated tracks:-Algorithms, Complexity and Models of Computation, -Logic, Semantics, Specification and Verification.Exploring New Frontiers of Theoretical Informatics contains 46 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 3rd IFIP International Conference on Theoretical Computer Science (TCS 2004), which was held in conjunction with the 18th World Computer Congress in Toulouse, France in August 2004 and sponsored by the International Federation for Information Processing (IFIP).

Inhalt

CONTENTS 6
PREFACE 11
PROGRAM COMMITTEE 12
Invited talks 13
THE TPI (TRNA PAIRING INDEX), A MATHEMATICAL MEASURE OF REPETITION IN A (BIOLOGICAL) SEQUENCE 14
STABILITY OF APPROXIMATION IN DISCRETE OPTIMIZATION 16
TOWARDS A BROADER THEORY OF MOBILE PROCESSES 33
A DECIDABLE ANALYSIS OF SECURITY PROTOCOLS 35
LOOKING INSIDE AES AND BES 36
REMOVE KEY ESCROW FROM THE IDENTITY-BASED ENCRYPTION SYSTEM 50
A RANDOMISED ALGORITHM FOR CHECKING THE NORMALITY OF CRYPTOGRAPHIC BOOLEAN FUNCTIONS 64
REVERSIBLE CIRCUIT REALIZATIONS OF BOOLEAN FUNCTIONS 80
RESOURCE BOUNDED IMMUNITY AND SIMPLICITY 94
DEGREE BOUNDS ON POLYNOMIALS AND RELATIVIZATION THEORY 110
THE FIRING SQUAD SYNCHRONIZATION PROBLEM WITH MANY GENERALS FOR ONE- DIMENSIONAL CA 124
A MATRIX Q-ANALOGUE OF THE PARIKH MAP 138
THE INHERENT QUEUING DELAY OF PARALLEL PACKET SWITCHES 152
EFFICIENT PROTOCOLS FOR COMPUTING THE OPTIMAL SWAP EDGES OF A SHORTEST PATH TREE 166
TRUTHFUL MECHANISMS FOR GENERALIZED UTILITARIAN PROBLEMS 180
THE DRIVING PHILOSOPHERS 194
ENGINEERING AN EXTERNAL MEMORY MINIMUM SPANNING TREE ALGORITHM* 208
SCHEDULING WITH RELEASE TIMES AND DEADLINES ON A MINIMUM 222
NUMBER OF MACHINES 222
APPROXIMATION ALGORITHMS FOR MIXED FRACTIONAL PACKING AND COVERING PROBLEMS 236
ON WEIGHTED RECTANGLE PACKING WITH LARGE RESOURCES 250
AN ALGORITHM FOR A SINK LOCATION PROBLEM IN DYNAMIC TREE NETWORKS 264
EFFICIENT ALGORITHMS FOR HANDLING MOLECULAR WEIGHTED SEQUENCES 278
IMPERFECTNESS OF DATA FOR STS-BASED PHYSICAL MAPPING 292
SOLVING PACKING PROBLEM WITH WEAKER BLOCK SOLVERS 306
ADAPTIVE SORTING WITH AVL TREES 320
PRECISE ANALYSIS OF IN CUBIC TIME 330
Track (2) on Logic, Semantics, Specification, and Verification 346
PROTOTYPING PROOF CARRYING CODE 346
CONTRACT ORIENTED DEVELOPMENT OF COMPONENT SOFTWARE 362
NEW INSIGHTS ON ARCHITECTURAL CONNECTORS 380
ON COMPLEXITY OF MODEL-CHECKING FOR THE TQL LOGIC 394
A GENERIC FRAMEWORK FOR CHECKING SEMANTIC EQUIVALENCES BETWEEN PUSHDOWN AUTOMATA AND FINITE-STATE AUTOMATA 408
Tailoring Recursion to Characterize Non- Deterministic Complexity Classes Over Arbitrary Structures 422
A CALCULUS WITH LAZY MODULE OPERATORS 436
DYNAMIC TYPING WITH DEPENDENT TYPES 450
SUBTYPING-INHERITANCE CONFLICTS: THE MOBILE MIXIN CASE 464
ASYMPTOTIC BEHAVIORS OF TYPE-2 ALGORITHMS AND INDUCED BAIRE TOPOLOGIES 478
EFFECTIVE CHEMISTRY FOR SYNCHRONY AND ASYNCHRONY 492
CONTROLLER SYNTHESIS FOR PROBABILISTIC SYSTEMS (EXTENDED ABSTRACT) 506
HIGHLY UNDECIDABLE QUESTIONS FOR PROCESS ALGEBRAS 520
NEW-HOPLA 534
BEHAVIOURAL EQUIVALENCES FOR DYNAMIC WEB DATA 548
BEHAVIOURAL THEORY FOR MOBILE AMBIENTS 562
NESTED COMMITS FOR MOBILE CALCULI: EXTENDING JOIN 576
DYNAMIC AND LOCAL TYPING FOR MOBILE AMBIENTS 590
TRUE TYPE POLYMORPHISM FOR MOBILE AMBIENTS 604
RECOVERING RESOURCES IN THE (DRAFT) 618
ENSURING TERMINATION BY TYPABILITY 632
THE SIMPLY-TYPED PURE PATTERN TYPE SYSTEM ENSURES STRONG NORMALIZATION 646
TERMINATION IN MODAL KLEENE ALGEBRA 660
REGULAR TREE LANGUAGE RECOGNITION WITH STATIC INFORMATION 674
Acknowledgments 687
Author Index 688
More eBook at www.ciando.com 0

Produkt-Details

• Erscheint lt. Verlag: 11.4.2006
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Wirtschaft ► Betriebswirtschaft / Management ► Wirtschaftsinformatik
• ISBN-10: 1-4020-8141-3 / 1402081413
• ISBN-13: 978-1-4020-8141-5 / 9781402081415