Programming Languages and Systems
Editat de David Sandsen Limba Engleză Paperback – 21 mar 2001
Preț: 329.94 lei
Preț vechi: 412.42 lei
-20%
Puncte Express: 495
Preț estimativ în valută:
58.34€ • 66.90$ • 50.42£
58.34€ • 66.90$ • 50.42£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540418627
ISBN-10: 3540418628
Pagini: 452
Ilustrații: XIV, 438 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540418628
Pagini: 452
Ilustrații: XIV, 438 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A Query Language Based on the Ambient Logic.- Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis.- A Systematic Approach to Static Access Control.- Secure Information Flow and CPS.- Enforcing Safety Properties Using Type Specialization.- Semantics and Program Analysis of Computationally Secure Information Flow.- Encoding Intensional Type Analysis.- Fusion on Languages.- Programming the Web with High-Level Programming Languages.- On the Completeness of Model Checking.- Modal Transition Systems: A Foundation for Three-Valued Program Analysis.- Entailment with Conditional Equality Constraints.- On the Complexity of Constant Propagation.- What Are Polymorphically-Typed Ambients?.- JOIN(X): Constraint-Based Type Inference for the Join-Calculus.- Modular Causality in a Synchronous Stream Language.- Control-Flow Analysis in Cubic Time.- The Recursive Record Semantics of Objects Revisited.- A Formalisation of Java’s Exception Mechanism.- A Formal Executable Semantics of the JavaCard Platform.- Modeling an Algebraic Stepper.- Typestate Checking of Machine Code.- Proof-Directed De-compilation of Low-Level Code.- Backwards Abstract Interpretation of Probabilistic Programs.- Tool Demonstration: Finding Duplicated Code Using Program Dependences.- Compiling Problem Specifications into SAT.- Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling.- The Def-inite Approach to Dependency Analysis.
Caracteristici
Includes supplementary material: sn.pub/extras