Programming Languages and Systems [electronic resource] : 27th European Symposium on Programming, ESOP 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings / edited by Amal Ahmed.

Інтелектуальна відповідальність: Вид матеріалу: Текст Серія: Theoretical Computer Science and General Issues ; 10801Публікація: Cham : Springer International Publishing : Imprint: Springer, 2018Видання: 1st ed. 2018Опис: XVI, 1058 p. 276 illus. online resourceТип вмісту:
  • text
Тип засобу:
  • computer
Тип носія:
  • online resource
ISBN:
  • 9783319898841
Тематика(и): Додаткові фізичні формати: Printed edition:: Немає назви; Printed edition:: Немає назвиДесяткова класифікація Дьюї:
  • 005.45 23
Класифікація Бібліотеки Конгресу:
  • QA76.76.C65
Електронне місцезнаходження та доступ:
Вміст:
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.
У: Springer Nature eBookЗведення: This book is Open Access under a CC BY licence. .
Тип одиниці: Списки з цим бібзаписом: Springer Ebooks (till 2020 - Open Access)+(2017 Network Access)) | Springer Ebooks (till 2020 - Open Access)
Мітки з цієї бібліотеки: Немає міток з цієї бібліотеки для цієї назви. Ввійдіть, щоб додавати мітки.
Оцінки зірочками
    Середня оцінка: 0.0 (0 голос.)
Немає реальних примірників для цього запису

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.

Open Access

This book is Open Access under a CC BY licence. .

Немає коментарів для цієї одиниці.

для можливості публікувати коментарі.