Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/730
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAhmed, Amal. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:21:21Z-
dc.date.available2020-05-17T08:21:21Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319898841 ;en_US
dc.identifier.isbn9783319898834 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/730-
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319898834. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is Open Access under a CC BY licence. . ;en_US
dc.description.statementofresponsibilityedited by Amal Ahmed.en_US
dc.description.tableofcontentsLanguage 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 theee -- 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 Return Pointer 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. ;en_US
dc.format.extentXVI, 1058 p. 276 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.haspart9783319898841.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer hardware. ;en_US
dc.subjectComputer organization. ;en_US
dc.subjectProgramming Languages and Electronic Computersen_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectProgramming Languages and Compilers and Interpretersen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectComputer Systems Organization and Communication Networks. ;en_US
dc.subjectComputer Hardware. ;en_US
dc.subjectComputing Methodologies. ;en_US
dc.subjectComputing Milieux. ;en_US
dc.subject.ddc005.13 ; 23 ;en_US
dc.subject.lccQA76.76.C65 ;en_US
dc.titleProgramming Languages and Systemsen_US
dc.title.alternative27th 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 /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319898841.pdf29.02 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAhmed, Amal. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:21:21Z-
dc.date.available2020-05-17T08:21:21Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319898841 ;en_US
dc.identifier.isbn9783319898834 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/730-
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319898834. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is Open Access under a CC BY licence. . ;en_US
dc.description.statementofresponsibilityedited by Amal Ahmed.en_US
dc.description.tableofcontentsLanguage 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 theee -- 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 Return Pointer 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. ;en_US
dc.format.extentXVI, 1058 p. 276 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.haspart9783319898841.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer hardware. ;en_US
dc.subjectComputer organization. ;en_US
dc.subjectProgramming Languages and Electronic Computersen_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectProgramming Languages and Compilers and Interpretersen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectComputer Systems Organization and Communication Networks. ;en_US
dc.subjectComputer Hardware. ;en_US
dc.subjectComputing Methodologies. ;en_US
dc.subjectComputing Milieux. ;en_US
dc.subject.ddc005.13 ; 23 ;en_US
dc.subject.lccQA76.76.C65 ;en_US
dc.titleProgramming Languages and Systemsen_US
dc.title.alternative27th 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 /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319898841.pdf29.02 MBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAhmed, Amal. ;en_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-05-17T08:21:21Z-
dc.date.available2020-05-17T08:21:21Z-
dc.date.issued2018en_US
dc.identifier.isbn9783319898841 ;en_US
dc.identifier.isbn9783319898834 (print) ;en_US
dc.identifier.urihttp://localhost/handle/Hannan/730-
dc.descriptionen_US
dc.descriptionSpringerLink (Online service) ;en_US
dc.descriptionen_US
dc.descriptionPrinted edition: ; 9783319898834. ;en_US
dc.descriptionen_US
dc.descriptionen_US
dc.description.abstractThis book is Open Access under a CC BY licence. . ;en_US
dc.description.statementofresponsibilityedited by Amal Ahmed.en_US
dc.description.tableofcontentsLanguage 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 theee -- 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 Return Pointer 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. ;en_US
dc.format.extentXVI, 1058 p. 276 illus. ; online resource. ;en_US
dc.publisherSpringer International Publishing :en_US
dc.publisherImprint: Springer,en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.ispartofseriesLecture Notes in Computer Science, ; 0302-9743 ; ; 10801. ;en_US
dc.relation.haspart9783319898841.pdfen_US
dc.subjectComputer Scienceen_US
dc.subjectComputer hardware. ;en_US
dc.subjectComputer organization. ;en_US
dc.subjectProgramming Languages and Electronic Computersen_US
dc.subjectComputersen_US
dc.subjectComputer Scienceen_US
dc.subjectProgramming Languages and Compilers and Interpretersen_US
dc.subjectTheory of Computation. ;en_US
dc.subjectComputer Systems Organization and Communication Networks. ;en_US
dc.subjectComputer Hardware. ;en_US
dc.subjectComputing Methodologies. ;en_US
dc.subjectComputing Milieux. ;en_US
dc.subject.ddc005.13 ; 23 ;en_US
dc.subject.lccQA76.76.C65 ;en_US
dc.titleProgramming Languages and Systemsen_US
dc.title.alternative27th 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 /en_US
dc.typeBooken_US
dc.publisher.placeCham :en_US
Appears in Collections:مدیریت فناوری اطلاعات

Files in This Item:
File Description SizeFormat 
9783319898841.pdf29.02 MBAdobe PDFThumbnail
Preview File