Programming Languages and Systems 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings
This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this vol...
Saved in:
| Main Authors | , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Cham
Springer Nature
2022
Springer Springer International Publishing AG ETAPS Society |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. |
|---|---|
| AbstractList | This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 21 regular papers presented in this volume were carefully reviewed and selected from 64 submissions. They deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems. |
| Author | European Conferences on Theory and Practice of Software Sergey, Ilya European Symposium on Programming |
| Author_xml | – sequence: 1 fullname: European Symposium on Programming – sequence: 2 fullname: Sergey, Ilya – sequence: 3 fullname: European Conferences on Theory and Practice of Software |
| BackLink | https://cir.nii.ac.jp/crid/1130574246710609932$$DView record in CiNii |
| BookMark | eNpdkM1P3DAQxY2gVYGueq562SIkxCEw_ortShxgtbRIq4IE6tWaTZwQSOwlXor473EIh5aLP977jed5dsiWD94R8pXCEQVQx0bpjGfAITOG8zzTG2SSNJ6UV0Fvvrt_JF8uZ79_TCkHbZRghn4ikxjvAIApDlTk2-T7VR_qHruu8fV0gb5-xNrFKfpyev0c166Ln8mHCtvoJm_7LvlzPr-Z_coWlz8vZqeLDDnNFWSiYpXmHJdVKbQry6J0yiVLlAhYuMqAVFo6xXIGXJRao2JUVkVlGDhVUb5LDseHMd67p3gb2nW0f1u3DOE-2v9-ltiDkV314eHRxbV9xQrn1z22dn42y42gXLFEnoxkwJXzdtU3HfbPNmBj22bZj-fBCX1tGVgJYCnLpbJSABs6ffu3vgw45tFUapnc_dH1TWOLZlhpGrdM0xa5opAPgYcQeyNWYMQ2YbYLfpj76jamPgyMZvwFbH6Krg |
| ContentType | eBook Book |
| DBID | I4C RYH V1H A7I |
| DEWEY | 005 |
| DOI | 10.1007/978-3-030-99336-8 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue CiNii Complete DOAB: Directory of Open Access Books OAPEN |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: V1H name: DOAB: Directory of Open Access Books url: https://directory.doabooks.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| DocumentTitleAlternate | ARCoSS |
| EISBN | 9783030993368 3030993361 |
| Edition | 1 1st Edition 2022 |
| Editor | Sergey, Ilya |
| Editor_xml | – sequence: 1 fullname: Sergey, Ilya |
| ExternalDocumentID | 9783030993368 EBC6941372 oai_library_oapen_org_20_500_12657_54028 81585 BC15659024 5420982 |
| GroupedDBID | 38. A7I AABBV AAKKN AALIB AAQKC AAXZC AAYZJ AAZWU ABSVR ABTHU ABVND ACBPT ACHZO ACPMC ADNVS AEDXK AEKFX AFNRJ AHVRR AIQUZ AKAAH ALMA_UNASSIGNED_HOLDINGS BBABE I4C IEZ SBO TPJZQ TSXQS V1H Z7R Z7S Z7U Z7X Z7Y Z7Z Z83 Z87 Z88 AALJR ABEEZ AEJLV AGWHU ALNDD CZZ EIXGO RYH Z81 Z85 Z5O |
| ID | FETCH-LOGICAL-a31670-4f2f833abfd48eddcde7e3164da0acef905785e7262034d88a7215fcf920e7f13 |
| IEDL.DBID | A7I |
| ISBN | 9783030993368 3030993361 3030993353 9783030993351 |
| IngestDate | Tue Feb 25 00:58:12 EST 2025 Fri May 30 22:23:17 EDT 2025 Wed Sep 03 02:36:45 EDT 2025 Tue Jul 08 19:58:14 EDT 2025 Fri Jun 27 00:49:05 EDT 2025 Tue Nov 14 22:56:43 EST 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a31670-4f2f833abfd48eddcde7e3164da0acef905785e7262034d88a7215fcf920e7f13 |
| Notes | Includes bibliographical references and index |
| OCLC | OCN: 1308974291 1308974291 |
| OpenAccessLink | https://library.oapen.org/handle/20.500.12657/54028 |
| PQID | EBC6941372 |
| PageCount | 604 |
| ParticipantIDs | askewsholts_vlebooks_9783030993368 proquest_ebookcentral_EBC6941372 oapen_primary_oai_library_oapen_org_20_500_12657_54028 oapen_doabooks_81585 nii_cinii_1130574246710609932 casalini_monographs_5420982 |
| PublicationCentury | 2000 |
| PublicationDate | 2022 c2022 2022-03-28 |
| PublicationDateYYYYMMDD | 2022-01-01 2022-03-28 |
| PublicationDate_xml | – year: 2022 text: 2022 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2022 |
| Publisher | Springer Nature Springer Springer International Publishing AG ETAPS Society |
| Publisher_xml | – name: Springer Nature – name: Springer – name: Springer International Publishing AG – name: ETAPS Society |
| SSID | ssj0002730146 |
| Score | 2.280825 |
| Snippet | This open access book constitutes the proceedings of the 31st European Symposium on Programming, ESOP 2022, which was held during April 5-7, 2022, in Munich,... |
| SourceID | askewsholts proquest oapen nii casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithms and data structures automata theory Compilers (Computer programs) Computer hardware Computer networks Computer programming Computer programming -- Congresses Computer programming / software engineering Computer programming, programs, data Computer science computer systems Computing and Information Technology distributed computer systems distributed systems embedded systems formal languages formal logic linguistics Microprogramming Network hardware ontologies parallel processing systems program compilers Programming and scripting languages: general programming languages Programming languages (Electronic computers) -- Congresses semantics software design software engineering software quality verification |
| Subtitle | 31st European Symposium on Programming, ESOP 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings |
| TableOfContents | 3.2 Relaxed behaviour from TLB caching -- 3.3 Relaxed behaviour of translation-walk non-TLB reads -- 3.4 Further issues -- 4 Virtual memory in the pKVM production hypervisor -- 5 Model -- 6 Tooling -- 6.1 Isla-based model evaluation -- 6.2 Experimental testing of hardware -- 7 Related work -- 8 Acknowledgments -- References -- Verified Security for the Morello Capability-enhanced Prototype Arm Architecture -- 1 Introduction -- 2 Overview of the Morello CHERI Architecture -- 2.1 CHERI Capabilities on Morello -- 2.2 Capabilities in Registers and Memory -- 2.3 Capability-aware Instructions -- 2.4 Domain Transition -- 2.5 Exceptions and the Memory Management Unit -- 2.6 Using CHERI in Software -- 3 Concrete Semantics of Morello -- 4 Abstract Formal Model of Capability Monotonicity -- 4.1 ISA Abstraction -- 4.2 CHERI ISA Parameters -- 4.3 Capability Abstraction -- 4.4 CHERI ISA Intra-instruction Properties -- 4.5 Capability Monotonicity Theorem -- 5 Proof of Capability Monotonicity in Morello -- 5.1 Instantiation of the Abstract Model -- 5.2 Manual Proofs about Capability Encoding Functions -- 5.3 Proof Engineering -- 5.4 Bugs and Issues Found -- 6 Validating the Concrete Semantics -- 7 Model-based Test Generation -- 8 Related Work -- References -- The Trusted Computing Base of the CompCert Verified Compiler -- 1 Introduction -- 2 The Coq Proof Assistant -- 2.1 Issues in Coq Proof Checking -- 2.2 Issues in Coq Extraction -- 3 Use of Axioms in Coq -- 3.1 Logical Inconsistency -- 3.2 Mismatches between Coq and OCaml -- 3.3 Interfacing External Code as Pure Functions -- 3.4 Pointer Equality and Hash-Consing -- 4 Front-end and semantic issues -- 5 Assembly back-end issues -- 5.1 Printing Issues -- 5.2 Pseudo-Instructions -- 5.3 Microarchitectural Concerns -- 5.4 Assembling and Linking -- 6 Modeling and Application Binary Interface Issues 4.1 Configurations -- 4.2 The Classical TSO Semantics -- 4.3 Adding Probabilities: PTSO -- 5 PTSO: Concepts and Properties -- 5.1 Left-Orientedness and Attractors -- 6 Qualitative (Repeated) Reachability -- 6.1 Almost-Sure Reachability -- 6.2 Almost-Sure Repeated Reachability -- 6.3 Almost-Never (Repeated) Reachability -- 6.4 Decidability and Complexity -- 7 Quantitative (Repeated) Reachability -- 7.1 Approximate Quantitative Reachability -- 7.2 Approximate Quantitative Repeated Reachability -- 8 Expected Average Costs -- 8.1 Computing costs over runs -- 8.2 Eagerness -- 8.3 The Algorithm -- 9 Conclusions, Discussions, and Perspectives -- References -- Linearity and Uniqueness: An Entente Cordiale -- 1 Introduction -- 2 Key Ideas -- 2.1 Are linearity and uniqueness (essentially) the same? -- 2.2 Are linearity and uniqueness dual? -- 3 The Linear-Cartesian-Unique Calculus -- 3.1 Typing -- 3.2 Equational theory -- 3.3 Exploiting uniqueness for mutation -- 3.4 Operational heap model -- 3.5 Metatheory -- 4 Implementation -- 4.1 Frontend -- 4.2 Compilation and Evaluation -- 5 Related Work -- 6 Future Work -- 7 Conclusion -- References -- A Framework for Substructural Type Systems -- 1 Introduction -- 2 Vectors over semirings -- 3 Bunched Typing Rules -- 4 Generic syntax -- 4.1 Descriptions of Systems -- 4.2 Terms of a System -- 4.3 Other syntaxes and syntactic forms -- 5 Environments -- 6 Semantics -- 6.1 A layer of syntax is functorial -- 6.2 The Kripke function space -- 6.3 Semantic traversal -- 7 Example traversals -- 7.1 Renaming and substitution -- 7.2 A usage elaborator -- 7.3 A denotational semantics -- 8 Conclusions -- References -- A Dependent Dependency Calculus -- 1 Dependency Analysis -- 2 Irrelevance and Dependent Types -- 2.1 Run-time irrelevance -- 2.2 Compile-time Irrelevance -- 2.3 Strong Irrelevant Σ-types Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Categorical Foundations of Gradient-Based Learning -- 1 Introduction -- 2 Categorical Toolkit -- 2.1 Parametric Maps -- 2.2 Lenses -- 2.3 Parametric Lenses -- 2.4 Cartesian Reverse Differential Categories -- 3 Components of learning as Parametric Lenses -- 3.1 Models as Parametric Lenses -- 3.1 Models as Parametric Lenses -- 3.2 Loss Maps as Parametric Lenses -- 3.3 Learning Rates as Parametric Lenses -- 3.4 Optimisers as Reparameterisations -- 4 Learning with Parametric Lenses -- 4.1 Supervised Learning of Parameters -- 4.2 Deep Dreaming: Supervised Learning of Inputs -- 5 Implementation -- 5.1 Constructing a Model with Lens and Para -- 5.2 Learning -- 6 Related Work -- 7 Conclusions and Future Directions -- References -- Compiling Universal Probabilistic Programming Languages with Efficient Parallel Sequential Monte Carlo Inference -- 1 Introduction -- 2 Miking CorePPL -- 2.1 Design Considerations -- 2.2 Syntax and Semantics -- 3 PPL control-flow graphs and RootPPL -- 3.1 PPL Control-Flow Graphs -- 3.2 SMC and PCFGs -- 3.3 RootPPL -- 4 Compiling to PCFGs -- 4.1 Function Decomposition Example -- 4.2 Function Decomposition Algorithm -- 4.3 CorePPL-to-RootPPL Compiler -- 4.4 Compiler Strengths and Limitations -- 5 Evaluation -- 5.1 Experiment: Constant-Rate Birth Death -- 5.2 Experiment: Vector-Borne Disease -- 5.3 Experiment: CRBD with Variance-Reducing Techniques -- 6 Related Work -- 7 Conclusion -- References -- Foundations for Entailment Checking in Quantitative Separation Logic -- 1 Introduction -- 2 (Quantitative) Separation Logic -- 2.1 Program States -- 2.2 Separation Logic -- 2.3 Quantitative Separation Logic -- 3 Entailments in Probabilistic Program Verification -- 3.1 Heap-manipulating pGCL -- 3.2 Weakest Liberal Preexpectations -- 3.3 Interfered Swap 6.1 Modeling of Values -- 6.2 Foreign Function Interface -- 6.3 Runtime System -- 7 Insights and Conclusion -- References -- View-Based Owicki-Gries Reasoning for Persistent x86-TSO -- 1 Introduction -- 2 Overview and Motivation -- 2.1 Px86view at a Glance -- 2.2 PIEROGI: View-Based Owicki-Gries Reasoning for Px86view -- 3 The PIEROGI Proof rules and Reasoning Principles -- 3.1 The PIEROGI Programming Language -- 3.2 View-Based Expressions -- 3.3 Owicki-Gries Reasoning -- 3.4 PIEROGI Proof rules -- 4 Examples -- 5 PIEROGI Soundness -- 5.1 The Px86view Model -- 5.2 The Semantics of PIEROGI Assertions -- 5.3 Soundness of PIEROGI -- 6 Mechanisation -- 7 Related Work -- References -- Abstraction for Crash-Resilient Objects -- 1 Introduction -- 2 Key Challenges and Ideas -- 2.1 Library Specifications -- 2.2 Client-Library Interaction Using Explicit Persist Instructions -- 2.3 Handling Calling Policies -- 3 NVM Programs: Syntax and Semantics -- 3.1 Program Syntax -- 3.2 Program Semantics -- 4 The PSC Memory System -- 4.1 Linking Programs and Memories -- 4.2 Extending PSC for Library Abstraction -- 4.3 Separation Properties -- 5 Libraries and Their Clients -- 6 The Library Abstraction Theorem -- 7 An Application: Persistent Pairs -- 8 Related and Future Work -- References -- Static Race Detection for Periodic Programs -- 1 Introduction -- 2 Overview -- 3 Periodic Programs -- 4 Data Races -- 5 Response Time and its Computation -- 5.1 Computing Response time without Locks -- 6 Rules for Disjointness -- 6.1 Disjoint Block Rules -- 6.2 Computing the value m in Rule 5 -- 6.3 Race Detection Algorithm -- 7 Experimental Evaluation -- 7.1 Implementation -- 7.2 Benchmarks -- 7.3 Results -- 8 Related Work -- 9 Conclusion -- References -- Probabilistic Total Store Ordering -- 1 Introduction -- 2 Preliminaries -- 3 Concurrent Programs -- 4 Operational Semantics 3.4 Avoiding Magic Wands -- 3.5 Randomized List Population -- 4 Quantitative Entailment Checking -- 4.1 Idea and Key Observations -- 4.2 Constructing Finite Overapproximations of Eval (f) -- 4.3 Lower Bounding QSL [A] by SL [A] Formulae -- 5 Complexity -- 6 Application: Decidable hpGCL Verification -- 6.1 Quantitative Symbolic Heaps -- 7 Related Work -- 8 Discussion and Conclusion -- References -- Extracting total Amb programs from proofs -- 1 Introduction -- 2 Denotational semantics of globally angelic choice -- 2.1 Programs and types -- 2.2 Denotational semantics -- 3 Operational semantics -- 3.1 Reduction to weak head normal form -- 3.2 Making choices -- 3.3 Computational adequacy: Matching denotational and operational semantics -- 4 CFP (Concurrent Fixed Point Logic) -- 4.1 Syntax -- 4.2 Proof rules -- 4.3 Tarskian semantics, axioms and classical logic -- 5 Program extraction -- 5.1 Realizability -- 5.2 Partial correctness and concurrency -- 5.3 Soundness and program extraction -- 6 Application -- 7 Implementation -- 8 Conclusion -- 8.1 Related work -- 8.2 Modelling locally angelic choice -- 8.3 Markov's principle with restriction -- 8.4 Further directions for research -- References -- Why3-do: The Way of Harmonious Distributed System Proofs -- 1 Introduction -- 2 The Why3 Languages in a Nutshell -- 3 Distributed Systems and Models -- 4 The Basic Message-Passing Model -- 5 Trace Specifications -- 6 Locally Shared Memory Model -- 7 Related Work -- 8 Conclusion -- References -- Relaxed virtual memory in Armv8-A -- 1 Introduction -- 2 Background: A Crash Course on Virtual Memory -- 2.1 Virtualising addressing -- 2.2 The translation-table walk -- 2.3 Multiple stages of translation -- 2.4 Caching translations in TLBs -- 3 Concurrency Architecture Design Questions -- 3.1 Coherence with respect to physical or virtual addresses 3 A Simple Dependency Analyzing Calculus |
| Title | Programming Languages and Systems |
| URI | http://digital.casalini.it/9783030993368 https://cir.nii.ac.jp/crid/1130574246710609932 https://directory.doabooks.org/handle/20.500.12854/81585 https://library.oapen.org/handle/20.500.12657/54028 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6941372 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783030993368 |
| Volume | 13240 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8MwDLZgu7ALj4EoY6ggrpnS9JVemTYNBIgDTLtFaZtIE7AhOvj92Gk3QNy4RGqtRqnjxPni-AvAZZ5Ii14oYLg0NowigYxo05nQMiOyFy1c3trdfTJ5im5m8azJ466-9y4GS41o3kXya7YBBOmDmBMZQkIQHlGP3IZ2ItDb03oovd5srAiy2SihPA4KHyBgT4KaaWfzLNfhzYZhNmQoYU7EZAc6unrGGQZnn1VF7kpXmrIU0fss5nO6GIna9mfudg5pvAdtQ1kK-7BlFgewu76bwW-GahfOH-qDV6_omvzbZlOy8vEv_Yak_BCm49HjcMKa6xCYpnR1ziIrrAxDndsykqYsi9KkBkVRqbkujM04MdeYlDjmw6iUUiO8i21hM8FNaoPwCFqL5cIcg69LjUAn51gZjuIEe4bie3lquSwy1K4HFz-UoD5fXOi2Ur-06EFvrRuFY6am2K5UHAmeSeFBH9WlijmVAbrKGFE4TsuIQel7lHedIlW51HXlMkDs4kFSv36r2TYU8V83VqFqCVqFElyhOShnDsqZgwf-ukOUa21zulWNroaUrRum4uS_dfdgR1Dag9t6OYXW6v3D9HExssrPnPFhOQ0mX7Cz0UM |
| linkProvider | Open Access Publishing in European Networks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Programming+languages+and+systems+%3A+31st+European+Symposium+on+Programming%2C+ESOP+2022%2C+held+as+part+of+the+European+Joint+Conferences+on+Theory+and+Practice+of+Software%2C+ETAPS+2022%2C+Munich%2C+Germany%2C+April+2-7%2C+2022+%3A+proceedings&rft.au=European+Symposium+on+Programming&rft.au=Sergey%2C+Ilya&rft.au=European+Conferences+on+Theory+and+Practice+of+Software&rft.date=2022-01-01&rft.pub=Springer&rft.isbn=9783030993351&rft_id=info:doi/10.1007%2F978-3-030-99336-8&rft.externalDocID=BC15659024 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97830309%2F9783030993368.jpg |