Theoretical Aspects of Computer Software 工程安全与可靠性

The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS，including its subseries LNAI，spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）.

Invited Talk 1
A Spatial Logic for Concurrency（PartⅠ）
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 Transformationsn Based on Control-Flow Analysis
Session 7
Invited Talk 6
Session 8
TACS Open Lecture
Author Index