Foundations of Software Science and Computation Structures
Editat de Furio Honsell, Marino Miculanen Limba Engleză Paperback – 21 mar 2001
Preț: 328.93 lei
Preț vechi: 411.16 lei
-20%
Puncte Express: 493
Carte tipărită la comandă
Livrare economică 18 iulie-01 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540418641
ISBN-10: 3540418644
Pagini: 432
Ilustrații: XII, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540418644
Pagini: 432
Ilustrații: XII, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Paper.- Adequacy for Algebraic Effects.- Contributed Papers.- Secrecy Types for Asymmetric Communication.- Axiomatizing Tropical Semirings.- Type Isomorphisms and Proof Reuse in Dependent Type Theory.- On the Duality between Observability and Reachability.- The Finite Graph Problem for Two-Way Alternating Automata.- High-Level Petri Nets as Type Theories in the Join Calculus.- Temporary Data in Shared Dataspace Coordination Languages.- On Garbage and Program Logic.- The Complexity of Model Checking Mobile Ambients.- The Rho Cube.- Type Inference with Recursive Type Equations.- On the Modularity of Deciding Call-by-Need.- Synchronized Tree Languages Revisited and New Applications.- Computational Completeness of Programming Languages Based on Graph Transformation.- Axioms for Recursion in Call-by-Value.- Class Analysis of Object-Oriented Programs through Abstract Interpretation.- On the Complexity of Parity Word Automata.- Foundations for a Graph-Based Approach to the Specification of Access Control Policies.- Categories of Processes Enriched in Final Coalgebras.- Model Checking CTL+ and FCTL Is Hard.- On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory.- Verified Bytecode Verifiers.- Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the ?-Calculus and Mechanizing the Theory of Contexts.- Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes.- An Axiomatic Semantics for the Synchronous Language Gentzen.- Tool Presentation.- Marrella and the Verification of an Embedded System.