Nantilus
Programming languages and systems : 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 proceedings
This book constitutes the refereed proceedings of the 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length...
Enregistré dans:
| Auteurs principaux : | , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Programming languages and systems : 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 : proceedings / edited by Matthias Felleisen, Philippa Gardner |
| Édition : | 1st ed. 2013. |
| Publié : |
Berlin, Heidelberg :
Springer Berlin Heidelberg
, [20..] Cham : Springer Nature |
| Collection : | Programming and Software Engineering ; 7792 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Note sur l'URL : | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex |
| Condition d'utilisation et de reproduction : | Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 |
| Contenu : | Distributed Electronic Rights in JavaScript. The Compiler Forest. Pretty-Big-Step Semantics. Language Constructs for Non-Well-Founded Computation. Laziness by Need. FliPpr: A Prettier Invertible Printing System. Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJULIENNE. Why3 Where Programs Meet Provers. Compositional Invariant Checking for Overlaid and Nested Linked Lists. A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness. Modular Reasoning about Separation of Concurrent Data Structures. Ribbon Proofs for Separation Logic. Abstract Refinement Types. Constraining Delimited Control with Contracts. Verifying Concurrent Memory Reclamation Algorithms with Grace. Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels. Verifying Concurrent Programs against Sequential Specifications. On Distributability in Process Calculi. Behavioral Polymorphism and Parametricity in Session-Based Communication. Higher-Order Processes, Functions, and Sessions: A Monadic Integration. Concurrent Flexible Reversibility. Structural Lock Correlation with Ownership Types. Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems. Model-Checking Higher-Order Programs with Recursive Types. Counterexample-Guided Precondition Inference. Information Reuse for Multi-goal Reachability Analyses. Quarantining Weakness: Compositional Reasoning under Relaxed Memory Models (Extended Abstract). Software Verification for Weak Memory via Program Transformation. Checking and Enforcing Robustness against TSO. GADTs Meet Subtyping. A Data Driven Approach for Algebraic Loop Invariants. Automatic Type Inference for Amortised Heap-Space Analysis |
| Sujets : | |
| Documents associés : | Autre format:
Programming Languages and Systems Autre format: Programming Languages and Systems |
| LEADER | 05541clm a2200673 4500 | ||
|---|---|---|---|
| 001 | PPN168330520 | ||
| 003 | http://www.sudoc.fr/168330520 | ||
| 005 | 20241001155300.0 | ||
| 010 | |a 978-3-642-37036-6 | ||
| 017 | 7 | 0 | |a 10.1007/978-3-642-37036-6 |2 DOI |
| 035 | |a (OCoLC)829434228 | ||
| 035 | |a Springer978-3-642-37036-6 | ||
| 035 | |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-642-37036-6 | ||
| 035 | |a Springer-11645-978-3-642-37036-6 | ||
| 100 | |a 20130325f20 u |0frey0103 ba | ||
| 101 | 0 | |a eng |2 639-2 | |
| 102 | |a DE | ||
| 135 | |a dr||||||||||| | ||
| 181 | |6 z01 |c txt |2 rdacontent | ||
| 181 | 1 | |6 z01 |a i# |b xxxe## | |
| 182 | |6 z01 |c c |2 rdamedia | ||
| 182 | 1 | |6 z01 |a b | |
| 183 | |6 z01 |a ceb |2 RDAfrCarrier | ||
| 200 | 1 | |a Programming languages and systems |e 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 |e proceedings |f edited by Matthias Felleisen, Philippa Gardner | |
| 205 | |a 1st ed. 2013. | ||
| 214 | 0 | |a Berlin, Heidelberg |c Springer Berlin Heidelberg | |
| 214 | 2 | |a Cham |c Springer Nature |d [20..] | |
| 225 | 0 | |a Programming and Software Engineering |x 2945-9168 |v 7792 | |
| 327 | 1 | |a Distributed Electronic Rights in JavaScript |a The Compiler Forest |a Pretty-Big-Step Semantics |a Language Constructs for Non-Well-Founded Computation |a Laziness by Need |a FliPpr: A Prettier Invertible Printing System |a Slicing-Based Trace Analysis of Rewriting Logic Specifications with iJULIENNE |a Why3 Where Programs Meet Provers |a Compositional Invariant Checking for Overlaid and Nested Linked Lists |a A Discipline for Program Verification Based on Backpointers and Its Use in Observational Disjointness |a Modular Reasoning about Separation of Concurrent Data Structures |a Ribbon Proofs for Separation Logic |a Abstract Refinement Types |a Constraining Delimited Control with Contracts |a Verifying Concurrent Memory Reclamation Algorithms with Grace |a Interleaving and Lock-Step Semantics for Analysis and Verification of GPU Kernels |a Verifying Concurrent Programs against Sequential Specifications |a On Distributability in Process Calculi |a Behavioral Polymorphism and Parametricity in Session-Based Communication |a Higher-Order Processes, Functions, and Sessions: A Monadic Integration |a Concurrent Flexible Reversibility |a Structural Lock Correlation with Ownership Types |a Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems |a Model-Checking Higher-Order Programs with Recursive Types |a Counterexample-Guided Precondition Inference |a Information Reuse for Multi-goal Reachability Analyses |a Quarantining Weakness: Compositional Reasoning under Relaxed Memory Models (Extended Abstract) |a Software Verification for Weak Memory via Program Transformation |a Checking and Enforcing Robustness against TSO |a GADTs Meet Subtyping |a A Data Driven Approach for Algebraic Loop Invariants |a Automatic Type Inference for Amortised Heap-Space Analysis | |
| 330 | |a This book constitutes the refereed proceedings of the 22nd European Symposium on Programming, ESOP 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013. The 31 papers, presented together with a full-length invited talk, were carefully reviewed and selected from 120 full submissions. The contributions have been organized according to ten topical sections on programming techniques; programming tools; separation logic; gradual typing; shared-memory concurrency and verification; process calculi; taming concurrency; model checking and verification; weak-memory concurrency and verification; and types, inference, and analysis | ||
| 371 | 0 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | |
| 371 | 0 | |a Accès soumis à abonnement pour tout autre établissement | |
| 371 | 1 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales |c https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | |
| 410 | | | |t Programming and Software Engineering |x 2945-9168 |v 7792 | |
| 452 | | | |t Programming Languages and Systems |b Texte imprimé |y 9783642370359 | |
| 452 | | | |t Programming Languages and Systems |b Texte imprimé |y 9783642370373 | |
| 610 | 1 | |a Computer Science | |
| 610 | 2 | |a Programming Languages, Compilers, Interpreters | |
| 610 | 2 | |a Logics and Meanings of Programs | |
| 610 | 2 | |a Software Engineering | |
| 610 | 2 | |a Programming Techniques | |
| 610 | 2 | |a Compilers and Interpreters | |
| 610 | 2 | |a Computer Science Logic and Foundations of Programming | |
| 615 | |a @Computer Science |n 11645 |2 Springer | ||
| 615 | |a Computer Science |n 11645 |2 Springer | ||
| 676 | |a 005.1 |v 23 | ||
| 680 | |a QA76.758 | ||
| 701 | 1 | |a Felleisen |b Matthias |4 651 | |
| 701 | 1 | |a Gardner |b Philippa |4 651 | |
| 801 | 3 | |a FR |b Abes |c 20231126 |g AFNOR | |
| 801 | 1 | |a DE |b Springer |c 20220401 |g AACR2 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-37036-6 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-7R4VG43B-4 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 441099901:830857834 |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-37036-6 | |
| 915 | |5 441099901:830857834 |b SPRING13-00802 | ||
| 930 | |5 441099901:830857834 |b 441099901 |j g | ||
| 991 | |5 441099901:830857834 |a Exemplaire créé en masse par ITEM le 30-09-2024 16:14 | ||
| 997 | |a NUM |b SPRING13-00802 |d NUMpivo |e EM |s d | ||
| 998 | |a 978613 | ||