Cantitate/Preț
Produs
Total produse
Vezi coșul
Programming Languages and Systems de Amal Ahmed

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

Editat de Amal Ahmed
en Limba Engleză Paperback – 15 apr 2018
This open access book constitutes the proceedings of the 27th European Symposium on Programming, ESOP 2018, which took place in Thessaloniki, Greece in April 2018, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018.
The 36 papers presented in this volume were carefully reviewed and selected from 114 submissions. The papers are organized in topical sections named: language design; probabilistic programming; types and effects; concurrency; security; program verification; program analysis and automated verification; session types and concurrency; concurrency and distribution; and compiler verification.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 38931 lei

Preț vechi: 48664 lei
-20%

Puncte Express: 584
Preț estimativ în valută:
6878€ • 7921$ • 5954£

Carte tipărită la comandă

Livrare economică 12-26 mai

 Adaugă în coș

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

Specificații

ISBN-13: 9783319898834
ISBN-10: 3319898833
Pagini: 1076
Ilustrații: XVI, 1058 p. 276 illus.
Dimensiuni: 155 x 235 x 58 mm
Greutate: 1.59 kg
Ediția:1st ed. 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Language Design.- Consistent Subtyping for All.- HOBiT: Programming Lenses without using Lens Combinators.- Dualizing Generalized Algebraic Data Types by Matrix Transposition.- Deterministic Concurrency: A Clock-Synchronised Shared Memory Approach.- Probabilistic Programming.- An Assertion-Based Program Logic for Probabilistic Programs.- Fine-grained Semantics for Probabilistic Programs.- How long, O Bayesian network, will I sample thee?.- Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus.- Types and Effects.- Failure is Not an Option: An Exceptional Type Theory.- Let Arguments Go First.- Behavioural equivalence via modalities for algebraic effects.- Explicit Effect Subtyping.- Concurrency.- A separation logic for a promising semantics.- Logical Reasoning for Disjoint Permissions.- Deadlock-Free Monitors.- Fragment Abstraction for Concurrent Shape Analysis.- Security.- Reasoning About a Machine with Local Capabilities - Provably Safe Stack and ReturnPointer Management.- Modular Product Programs.- Program Verification.- A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification.- Verified Learning Without Regret.- Program Verification by Coinduction.- Velisarios: Byzantine Fault Tolerant Protocols Powered by Coq.- Program Analysis and Automated Verification.- Evaluating Design Tradeoffs in Numeric Static Analysis for Java.- An Abstract Interpretation Framework for Input Data Usage.- Higher-Order Program Verification via HFL Model Checking.- Quantitative Analysis of Smart Contracts.- Session Types and Concurrency.- Session-Typed Concurrent Contracts.- A Typing Discipline for Statically Verified Crash Failure Handling in Distributed Systems.- On Polymorphic Sessions and Functions: A Tale of Two (Fully Abstract) Encodings.- Concurrent Kleene Algebra: Free Model and Completeness.- Concurrency and Distribution.- Correctness of a Concurrent Object Collector for Actor Languages.- Paxos Consensus, Deconstructed and Abstracted.- On Parallel Snapshot Isolation and Release/Acquire Consistency.- Eventual Consistency for CRDTs.- Compiler Verification.- A Verified Compiler from Isabelle/HOL to CakeML.- Compositional Verification of Compiler Optimisations on Relaxed Memory.

Textul de pe ultima copertă

This book is Open Access under a CC BY licence.