

Programming Languages and Systems - Jan Vitek
- Format: Broché
- 845 pages Voir le descriptif
Vous en avez un à vendre ?
Vendez-le-vôtreChargement...
82,10 €
Produit Neuf
Ou 20,53 € /mois
- Livraison à 0,01 €
- Livré entre le 5 et le 8 août
- Payez directement sur Rakuten (CB, PayPal, 4xCB...)
- Récupérez le produit directement chez le vendeur
- Rakuten vous rembourse en cas de problème
Gratuit et sans engagement
Félicitations !
Nous sommes heureux de vous compter parmi nos membres du Club Rakuten !
TROUVER UN MAGASIN
Retour

Avis sur Programming Languages And Systems de Jan Vitek Format Broché - Livre
0 avis sur Programming Languages And Systems de Jan Vitek Format Broché - Livre
Donnez votre avis et cumulez 5
Les avis publiés font l'objet d'un contrôle automatisé de Rakuten.
Présentation Programming Languages And Systems de Jan Vitek Format Broché
- LivreAuteur(s) : Jan VitekEditeur : Springer BerlinLangue : AnglaisParution : 01/04/2015Format : Moyen, de 350g à 1kgNombre de pages : 845Expédition : 1264Dimensions : 23.5 x 15.5 x 4.5 ...
Résumé :
This book constitutes the proceedings of the 24th European Symposium on Programming, ESOP 2015, which took place in London, UK, in April 2015, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015. The 33 papers presented in this volume were carefully reviewed and selected from 113 submissions.
Sommaire:
Probabilistic Programs as Spreadsheet Queries.- Static Analysis of Spreadsheet Applications for Type-Unsafe Operations Detection.- Running Probabilistic Programs Backwards.- A Verified Compiler for Probability Density Functions.- Segment Abstraction for Worst-Case Execution Time Analysis.- Automatic Static Cost Analysis for Parallel Programs.- Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs.- Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs. A Theory of Name Resolution.- A Core Calculus for XQuery 3.0: Combining Navigational and Pattern Matching Approaches.- IsoLate: A Type System for Self-recursion.- The Problem of PL Concurrency Semantics.- The Best of Both Worlds: Trading Efficiency and Optimality in Fence Insertion for TSO.- Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity.- Witnessing (Co)datatypes.- Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System.- Refinement Types for Incremental Computational Complexity.- Monotonic References for Efficient Gradual Typing.- Inter-procedural Two-Variable Herbrand Equalities.- Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages.- Fine-Grained Detection of Privilege Escalation Attacks on Browser Extensions.- Analysis of Asynchronous Programs with Event-Based Synchronization.- A Semantics for Propositions as Sessions.- Composite Replicated Data Types.- Relaxed Stratification: A New Approach to Practical Complete Predicate Refinement.- Spatial Interpolants.- Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs.- Full Reduction in the Face of Absurdity.- CoLoSL: Concurrent Local Subjective Logic.- A Separation Logic for Fictional Sequential Consistency.- Binding Structures as an Abstract Data Type.- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages.- Type Targeted Testing.
Détails de conformité du produit
Personne responsable dans l'UE