Cantitate/Preț
Produs
Total produse
Vezi coșul
Programming Languages and Systems de Bor-Yuh Evan Chang

Programming Languages and Systems: Lecture Notes in Computer Science, cartea 10695

Editat de Bor-Yuh Evan Chang
en Limba Engleză Paperback – 19 noi 2017
This book constitutes the proceedings of the 15th Asian Symposium on Programming Languages and Systems, APLAS 2017, held in Suzhou, China, in November 2017. The 24 papers presented in this volume were carefully reviewed and selected from 56 submissions. They were organized in topical sections named: security; heap and equivalence reasoning; concurrency and verification; domain-specific languages; semantics; and numerical reasoning. The volume also contains two invited talks in full-paper length. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33629 lei

Preț vechi: 42036 lei
-20%

Puncte Express: 504
Preț estimativ în valută:
5942€ • 6888$ • 5182£

Carte tipărită la comandă

Livrare economică 15-29 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319712369
ISBN-10: 3319712365
Pagini: 576
Ilustrații: XIX, 555 p. 116 illus.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.86 kg
Ediția:1st edition 2017
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Invited Contributions.- Programming by Examples: PL meets ML.- Synthesizing SystemC Code from Delay Hybrid CSP.- Security.- Taming Message-passing Communication in Compositional Reasoning about Confidentiality.- Capabilities for Java: Secure Access to Resources.- Enforcing Programming Guidelines with Region-Types and Effects.- Automatically generating secure wrappers for SGX enclaves from separation logic specifications.- Heap and Equivalence Reasoning.- Black-box equivalence checking across compiler optimizations.- Weakly Sensitive Analysis for Unbounded Iteration over JavaScript Objects.- Decision Procedure for Entailment of Symbolic Heaps with Arrays.- Bringing order to the separation logic jungle.- Concurrency and Verification.- Programming and proving with classical types.- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous.- Verified Root-Balanced Trees.- Safety and Liveness of MCS Lock - Layer by Layer.- Domain-Specific Languages.- Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access.- Efficient Functional Reactive Programming through Incremental Behaviors.- Implementing Algebraic Effects in C - Monads for Free in C.- Sound and Efficient Language-Integrated Query: Maintaining the ORDER.- Semantics.- A Computational Interpretation of Context-Free Expressions.- Partiality and container monads.- The Negligible and Yet Subtle Cost of Pattern Matching.- A lambda calculus for density matrices wth classical and probabilistic controls.- Numerical Reasoning.- Compact Difference Bound Matrices.- Sharper and Simpler Nonlinear Interpolants for Program Verification.- A Nonstandard Functional Programming Language.- Counterexample-Guided Bit-Precision Selection.

Caracteristici

Includes supplementary material: sn.pub/extras