26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings / Yang, Hongseok  

Público ISBD Ningún comentario para este título. Título : 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings Tipo de documento: documento electrónico Autores: Yang, Hongseok, Mención de edición: 1 ed. Editorial: Berlin [Alemania] : Springer Fecha de publicación: 2017 Número de páginas: XV, 992 p. 294 ilustraciones, 59 ilustraciones en color. ISBN/ISSN/DL: 978-3-662-54434-1 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Compiladores (programas informáticos)  Ciencias de la Computación  Ingeniería de software  Programación de computadoras  Compiladores e intérpretes  Lógica informática y fundamentos de la programación.  Teoría de la Computación  Técnicas de programación Clasificación: 005.45 Resumen: Este libro constituye las actas del 26º Simposio Europeo sobre Programación, ESOP 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre Teoría y Práctica del Software, ETAPS 2017. Los 36 artículos presentados en Este volumen fue cuidadosamente revisado y seleccionado entre 112 presentaciones. Cubren temas tradicionales y emergentes en lenguajes de programación. Tratan en detalle los fundamentos semánticos y el sistema de tipos para la programación probabilística; técnicas para verificar programas concurrentes o de orden superior; lenguajes de programación para matrices o datos web; análisis de programas y verificación de propiedades de programas no estándar; fundamento y aplicación de la demostración interactiva de teoremas; reescritura de gráficos; lógica de separación; tipo de sesión; teoría de tipos; y complejidad computacional implícita. . Nota de contenido: Disjoint Polymorphism -- Generalizing inference systems by coaxioms -- Observed Communication Semantics for Classical Processes -- Is your software on dope? – Formal analysis of surreptitiously "enhanced" programs -- Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants -- Confluence of Graph Rewriting with Interfaces -- Verifying Robustness of Event-Driven Asynchronous Programs against Concurrency -- Incremental update for graph rewriting -- Linearity, Control Effects, and Behavioral Types -- Temporary Read-Only Permissions for Separation Logic -- Faster Algorithms for Weighted Recursive State Machines -- ML and Extended BVASS. – Metric Reasoning about Lambda Terms: the General Case -- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring -- Probabilistic Termination by Monadic Affine Sized Typing -- Caper: Automatic Verification for Fine-grained Concurrency -- Tackling Real-Life Relaxed Concurrency with FSL++. - Extensible DatasortRefinements -- Programs Using Syntax with First-Class Binders. - Lincx: A Linear Logical Framework with First-class Context -- APLicative Programming with Naperian Functors -- Verified Characteristic Formulae for CakeML -- Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic -- Proving Linearizability Using Partial Orders -- The Power of Non-Determinism in Higher-Order Implicit Complexity -- The Essence of Higher-Order Concurrent Separation Logic -- Comprehending Isabelle/HOL's Consistency.-The essence of functional programming on semantic data -- A Classical Sequent Calculus with Dependent Types -- Context-Free Session Type Inference -- Modular Verification of Higher-order Functional Programs -- Commutative semantics for probabilistic programming -- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization -- A Higher-Order Logic for Concurrent Termination-Preserving Refinement -- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation -- Abstract Specifications for Concurrent Maps. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 26th European Symposium on Programming, ESOP 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 36 papers presented in this volume were carefully reviewed and selected from 112 submissions. They cover traditional as well as emerging topics in programming languages. In detail they deal with semantic foundation and type system for probabilistic programming; techniqu3es for verifying concurrent or higher-order programs; programming languages for arrays or web data; program analysis and verification of non-standard program properties; foundation and application of interactive theorem proving; graph rewriting; separation logic; session type; type theory; and implicit computational complexity. . Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017, Proceedings [documento electrónico] / Yang, Hongseok,  . -  1 ed.  . - Berlin [Alemania] : Springer, 2017 . - XV, 992 p. 294 ilustraciones, 59 ilustraciones en color. ISBN : 978-3-662-54434-1 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Compiladores (programas informáticos)  Ciencias de la Computación  Ingeniería de software  Programación de computadoras  Compiladores e intérpretes  Lógica informática y fundamentos de la programación.  Teoría de la Computación  Técnicas de programación Clasificación: 005.45 Resumen: Este libro constituye las actas del 26º Simposio Europeo sobre Programación, ESOP 2017, que tuvo lugar en Uppsala, Suecia, en abril de 2017, como parte de las Conferencias Conjuntas Europeas sobre Teoría y Práctica del Software, ETAPS 2017. Los 36 artículos presentados en Este volumen fue cuidadosamente revisado y seleccionado entre 112 presentaciones. Cubren temas tradicionales y emergentes en lenguajes de programación. Tratan en detalle los fundamentos semánticos y el sistema de tipos para la programación probabilística; técnicas para verificar programas concurrentes o de orden superior; lenguajes de programación para matrices o datos web; análisis de programas y verificación de propiedades de programas no estándar; fundamento y aplicación de la demostración interactiva de teoremas; reescritura de gráficos; lógica de separación; tipo de sesión; teoría de tipos; y complejidad computacional implícita. . Nota de contenido: Disjoint Polymorphism -- Generalizing inference systems by coaxioms -- Observed Communication Semantics for Classical Processes -- Is your software on dope? – Formal analysis of surreptitiously "enhanced" programs -- Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants -- Confluence of Graph Rewriting with Interfaces -- Verifying Robustness of Event-Driven Asynchronous Programs against Concurrency -- Incremental update for graph rewriting -- Linearity, Control Effects, and Behavioral Types -- Temporary Read-Only Permissions for Separation Logic -- Faster Algorithms for Weighted Recursive State Machines -- ML and Extended BVASS. – Metric Reasoning about Lambda Terms: the General Case -- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring -- Probabilistic Termination by Monadic Affine Sized Typing -- Caper: Automatic Verification for Fine-grained Concurrency -- Tackling Real-Life Relaxed Concurrency with FSL++. - Extensible DatasortRefinements -- Programs Using Syntax with First-Class Binders. - Lincx: A Linear Logical Framework with First-class Context -- APLicative Programming with Naperian Functors -- Verified Characteristic Formulae for CakeML -- Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic -- Proving Linearizability Using Partial Orders -- The Power of Non-Determinism in Higher-Order Implicit Complexity -- The Essence of Higher-Order Concurrent Separation Logic -- Comprehending Isabelle/HOL's Consistency.-The essence of functional programming on semantic data -- A Classical Sequent Calculus with Dependent Types -- Context-Free Session Type Inference -- Modular Verification of Higher-order Functional Programs -- Commutative semantics for probabilistic programming -- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization -- A Higher-Order Logic for Concurrent Termination-Preserving Refinement -- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation -- Abstract Specifications for Concurrent Maps. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 26th European Symposium on Programming, ESOP 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 36 papers presented in this volume were carefully reviewed and selected from 112 submissions. They cover traditional as well as emerging topics in programming languages. In detail they deal with semantic foundation and type system for probabilistic programming; techniqu3es for verifying concurrent or higher-order programs; programming languages for arrays or web data; program analysis and verification of non-standard program properties; foundation and application of interactive theorem proving; graph rewriting; separation logic; session type; type theory; and implicit computational complexity. . Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]

---

1 (1 - 1 / 1) Ver por página : 25 50 100 200