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

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

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 vol...

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Müşterek Yazar: International symposium on Theoretical aspects of computer software :Sendai, Japan
Diğer Yazarlar: Kobayashi, Naoki, 1968- (Yayın yönetmeni), Pierce, Benjamin C., 1963- (Yayın yönetmeni)
Materyal Türü: Livre numérique
Dil:Anglais
Baskı/Yayın Bilgisi: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Seri Bilgileri:Lecture notes in computer science 2215
Konular:
Génie logiciel
Informatique
Systèmes, Conception de
Logique symbolique et mathématique
Logiciels > Développement
Actes de congrès
Online Erişim:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Not: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Theoretical aspects of computer software, 4th international symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Naoki Kobayashi, Benjamin C. Pierce (eds.), 2001, Berlin, Springer, 1 vol. (XV-559 p.), Lecture notes in computer science, 3-540-42736-8
• Theoretical Aspects of Computer Software, Texte imprimé, 9783662192504
İçindekiler:
  • Invited Talk 1
  • A Spatial Logic for Concurrency (Part I)
  • Session 1
  • Boxed Ambients
  • A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation
  • Formal Eavesdropping and Its Computational Interpretation
  • Invited Talk 2
  • Resource-Passing Concurrent Programming
  • Session 2
  • Solo Diagrams
  • Observational Equivalence for Synchronized Graph Rewriting with Mobility
  • Session 3
  • Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
  • Termination Proofs and Complexity Certification
  • A Renee Equation for Algorithmic Complexity
  • Invited Talk 3
  • Nominal Logic: A First Order Theory of Names and Binding
  • Session 4
  • A Logic Programming Language Based on Binding Algebras
  • Proof-Search and Countermodel Generation in Propositional BI Logic
  • Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
  • Invited Talk 4
  • Modelisation of Timed Automata in Coq
  • Session 5
  • Model-Checking LTL with Regular Valuations for Pushdown Systems
  • What Will Be Eventually True of Polynomial Hybrid Automata?
  • Non-structural Subtype Entailment in Automata Theory
  • Session 6
  • Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems
  • Weakest Congruence Results Concerning Any-Lock
  • Invited Talk 5
  • Design and Correctness of Program Transformations Based on Control-Flow Analysis
  • Session 7
  • Infinite Intersection and Union Types for the Lazy Lambda Calculus
  • Strong Normalization of Second Order Symmetric Lambda-mu Calculus
  • The Girard-Reynolds Isomorphism
  • Invited Talk 6
  • Lightweight Analysis of Object Interactions
  • Session 8
  • Typing Assembly Programs with Explicit Forwarding
  • The UDP Calculus: Rigorous Semantics for Real Networking
  • TACS Open Lecture
  • Unison: A FileSynchronizer and Its Specification.

Benzer Materyaller