Theoretical Aspects of Computer Software
Editat de Naoki Kobayashi, Benjamin C. Pierceen Limba Engleză Paperback – 12 oct 2001
Preț: 336.49 lei
Preț vechi: 420.61 lei
-20%
Puncte Express: 505
Preț estimativ în valută:
59.50€ • 68.23$ • 51.42£
59.50€ • 68.23$ • 51.42£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540427360
ISBN-10: 3540427368
Pagini: 580
Ilustrații: XI, 565 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.87 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540427368
Pagini: 580
Ilustrații: XI, 565 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 0.87 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras