Theoretical aspects of computer software : 4th international symposium, TACS 2001, Sendai, Japan, October 29-31, 2001 : proceedings /

Bibliographic Details
Corporate Authors: TACS 2001 Sendai-shi, Miyagi-ken, Japan, SpringerLink (Online service)
Other Authors: Kobayashi, Naoki, Pierce, Benjamin C.
Format: Conference Proceeding eBook
Language:English
Published: Berlin ; New York : Springer, [2001]
Series:Lecture notes in computer science ; 2215.
Subjects:
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • A Spatial Logic for Concurrency (Part I) / Luis Caires and Luca Cardelli
  • Boxed Ambients / Michele Bugliesi, Giuseppe Castagna and Silvia Crafa
  • A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation / Daisuke Hoshina, Eijiro Sumii and Akinori Yonezawa
  • Formal Eavesdropping and Its Computational Interpretation / Martin Abadi and Jan Jurjens
  • Resource-Passing Concurrent Programming / Kazunori Ueda
  • Solo Diagrams / Cosimo Laneve, Joachim Parrow and Bjorn Victor
  • Observational Equivalence for Synchronized Graph Rewriting with Mobility / Barbara Konig and Ugo Montanari
  • Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness / Hiroshi Nakano
  • Termination Proofs and Complexity Certification / Daniel Leivant
  • A Renee Equation for Algorithmic Complexity / Keye Martin
  • Nominal Logic: A First Order Theory of Names and Binding / Andrew M. Pitts
  • A Logic Programming Language Based on Binding Algebras / Makoto Hamana
  • Proof-Search and Countermodel Generation in Propositional BI Logic / Didier Galmiche and Daniel Mery
  • Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders / Mizuhito Ogawa
  • Modelisation of Timed Automata in Coq / Christine Paulin-Mohring
  • Model-Checking LTL with Regular Valuations for Pushdown Systems / Javier Esparza, Antonin Kucera and Stefan Schwoon
  • What Will Be Eventually True of Polynomial Hybrid Automata? / Martin Franzle
  • Non-structural Subtype Entailment in Automata Theory / Joachim Niehren and Tim Priesnitz
  • Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems / Philippe Schnoebelen
  • Weakest Congruence Results Concerning "Any-Lock" / Antti Puhakka
  • Design and Correctness of Program Transformations Based on Control-Flow Analysis / Anindya Banerjee, Nevin Heintze and Jon G. Riecke
  • Infinite Intersection and Union Types for the Lazy Lambda Calculus / Marcello M. Bonsangue and Joost N. Kok
  • Strong Normalization of Second Order Symmetric Lambda-mu Calculus / Yoriyuki Yamagata
  • The Girard-Reynolds Isomorphism / Philip Wadler
  • Lightweight Analysis of Object Interactions / Daniel Jackson and Alan Fekete
  • Typing Assembly Programs with Explicit Forwarding / Lennart Beringer
  • The UDP Calculus: Rigorous Semantics for Real Networking / Andrei Serjantov, Peter Sewell and Keith Wansbrough
  • Unison: A File Synchronizer and Its Specification / Benjamin C. Pierce and Jerome Vouillon.