Programming Languages and Systems
Editat de Mooly Sagiven Limba Engleză Paperback – 23 mar 2005
Preț: 330.36 lei
Preț vechi: 412.95 lei
-20%
Puncte Express: 496
Carte tipărită la comandă
Livrare economică 27 iulie-10 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: 9783540254355
ISBN-10: 3540254358
Pagini: 460
Ilustrații: XIV, 442 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540254358
Pagini: 460
Ilustrații: XIV, 442 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Programming with Explicit Security Policies.- Trace Partitioning in Abstract Interpretation Based Static Analyzers.- The ASTREÉ Analyzer.- Interprocedural Herbrand Equalities.- Analysis of Modular Arithmetic.- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering.- A New Foundation for Control-Dependence and Slicing for Modern Program Structures.- Summaries for While Programs with Recursion.- Determinacy Inference for Logic Programs.- Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis.- A Type Discipline for Authorization Policies.- Computationally Sound, Automated Proofs for Security Protocols.- Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries.- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus.- Streams with a Bottom in Functional Languages.- Bottom-Up ?-Reduction: Uplinks and ?-DAGs.- BI Hyperdoctrines and Higher-Order Separation Logic.- Deciding Reachability in Mobile Ambients.- Denotational Semantics for Abadi and Leino’s Logic of Objects.- A Design for a Security-Typed Language with Certificate-Based Declassification.- Adjoining Declassification and Attack Models by Abstract Interpretation.- Enforcing Resource Bounds via Static Verification of Dynamic Checks.- Asserting Bytecode Safety.- Subtyping First-Class Polymorphic Components.- Complexity of Subtype Satisfiability over Posets.- A Type System Equivalent to a Model Checker.- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close.- Towards a Type System for Analyzing JavaScript Programs.- Java JR: Fully Abstract Trace Semantics for a Core Java Language.