+612 9045 4394
 
CHECKOUT
Theoretical Aspects of Computer Software : 4th International Symposium, Tacs 2001, Sendai, Japan, October 29-31, 2001. Proceedings - Naoki Kobayashi

Theoretical Aspects of Computer Software

4th International Symposium, Tacs 2001, Sendai, Japan, October 29-31, 2001. Proceedings

By: Naoki Kobayashi (Editor), Benjamin C. Pierce (Editor)

Paperback Published: 12th October 2001
ISBN: 9783540427360
Number Of Pages: 565

Share This Book:

Paperback

$169.73
or 4 easy payments of $42.43 with Learn more
Ships in 5 to 9 business days

This volume constitutes the proceedings of the Fourth International Symposium on Theoretical Aspects of Computer Software (TACS 2001) held at Tohoku U- versity, Sendai, Japan in October 2001. The TACS symposium focuses on the theoretical foundations of progr- ming and their applications. As this volume shows, TACS is an international symposium, with participants from many di?erent institutions and countries. TACS 2001 was the fourth symposium in the TACS series, following TACS'91, TACS'94, and TACS'97, whose proceedings were published as Volumes 526, 789, and 1281, respectively, of Springer-Verlag's Lecture Notes in Computer Science series. The TACS 2001 technical program consisted of invited talks and contributed talks. In conjunction with this program there was a special open lecture by Benjamin Pierce; this lecture was open to non-registrants. TACS 2001 bene?ted from the e?orts of many people; in particular, members of the Program Committee and the Organizing Committee. Our special thanks go to the Program Committee Co-chairs: Naoki Kobayashi (Tokyo Institute of Technology) Benjamin Pierce (University of Pennsylvania).

A Spatial Logic for Concurrency (Part I)p. 1
Boxed Ambientsp. 38
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computationp. 64
Formal Eavesdropping and Its Computational Interpretationp. 82
Resource-Passing Concurrent Programmingp. 95
Solo Diagramsp. 127
Observational Equivalence for Synchronized Graph Rewriting with Mobilityp. 145
Fixed-Point Logic with the Approximation Modality and Its Kripke Completenessp. 165
Termination Proofs and Complexity Certificationp. 183
A Renee Equation for Algorithmic Complexityp. 201
Nominal Logic: A First Order Theory of Names and Bindingp. 219
A Logic Programming Language Based on Binding Algebrasp. 243
Proof-Search and Countermodel Generation in Propositional BI Logicp. 263
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Ordersp. 283
Modelisation of Timed Automata in Coqp. 298
Model-Checking LTL with Regular Valuations for Pushdown Systemsp. 316
What Will Be Eventually True of Polynomial Hybrid Automata?p. 340
Non-structural Subtype Entailment in Automata Theoryp. 360
Bisimulation and Other Undecidable Equivalences for Lossy Channel Systemsp. 385
Weakest Congruence Results Concerning "Any-Lock"p. 400
Design and Correctness of Program Transformations Based on Control-Flow Analysisp. 420
Infinite Intersection and Union Types for the Lazy Lambda Calculusp. 448
Strong Normalization of Second Order Symmetric Lambda-mu Calculusp. 459
The Girard-Reynolds Isomorphismp. 468
Lightweight Analysis of Object Interactionsp. 492
Typing Assembly Programs with Explicit Forwardingp. 514
The UDP Calculus: Rigorous Semantics for Real Networkingp. 535
TACS Open Lecture
Unison: A File Synchronizer and Its Specificationp. 560
Author Indexp. 561
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540427360
ISBN-10: 3540427368
Series: Lecture Notes in Artificial Intelligence
Audience: General
Format: Paperback
Language: English
Number Of Pages: 565
Published: 12th October 2001
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 3.0
Weight (kg): 0.81