Cover Image

Programming Languages and Systems : 32nd European Symposium on Programming, ESOP 2023, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings.

Bibliographic Details
Main Author: Wies, Thomas.
Format: eBook
Language:English
Published: Cham : Springer International Publishing AG, 2023.
Edition:1st ed.
Series:Lecture Notes in Computer Science Series
Subjects:
Electronic books.
Online Access:Click to View
LEADER 06114nam a22004213i 4500
001 EBC7239158
003 MiAaPQ
005 20231204023228.0
006 m o d |
007 cr cnu||||||||
008 231204s2023 xx o ||||0 eng d
020 |a 9783031300448  |q (electronic bk.) 
020 |z 9783031300431 
035 |a (MiAaPQ)EBC7239158 
035 |a (Au-PeEL)EBL7239158 
035 |a (OCoLC)1376355114 
040 |a MiAaPQ  |b eng  |e rda  |e pn  |c MiAaPQ  |d MiAaPQ 
050 4 |a QA76.76.C65 
100 1 |a Wies, Thomas. 
245 1 0 |a Programming Languages and Systems :  |b 32nd European Symposium on Programming, ESOP 2023, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings. 
250 |a 1st ed. 
264 1 |a Cham :  |b Springer International Publishing AG,  |c 2023. 
264 4 |c Ã2023. 
300 |a 1 online resource (579 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Lecture Notes in Computer Science Series ;  |v v.13990 
505 0 |a Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Logics for Extensional, Locally Complete Analysis via Domain Refinements -- 1 Introduction -- 2 Background -- 2.1 Abstract Interpretation -- 2.2 Regular Commands. -- 3 Local Completeness Logic -- 4 Refining Abstract Domain -- 4.1 Logical Completeness -- 4.2 Derived Refinement Rules -- 4.3 Choosing The Refinement -- 5 Conclusions -- Appendix A Proofs and Supplementary Material -- A.1 Extensional Soundness (Theorem 2) -- A.2 Soundness and Completeness of (refine-ext ) -- A.3 Derived Refinement Rules -- References -- Clustered Relational Thread-ModularAbstract Interpretation with Local Traces -- 1 Introduction -- 2 Relational Domains -- 3 A Local Trace Semantics -- 4 Relational Analyses as Abstractions of Local Traces -- 5 Refinement via Finite Abstractions of Local Traces -- 6 Analysis of Thread Ids and Uniqueness -- 7 Exploiting Thread IDs to Improve Relational Analyses -- 8 Exploiting Clustered Relational Domains -- 9 Experimental Evaluation -- 10 Related Work -- 11 Conclusion and Future Work -- References -- Adversarial Reachability for Program-level Security Analysis -- 1 Introduction -- 2 Motivation -- 2.1 Fault Injection across Security Fields -- 2.2 Motivating Example -- 3 Background -- 3.1 Software-implemented Fault Injection (SWiFI) -- 3.2 Standard Reachability Formalization -- 3.3 Symbolic Execution -- 4 Adversarial Reachability -- 5 Forkless Adversarial Symbolic Execution (FASE) -- 5.1 Modelling Faults via Forkless Encoding -- 5.2 Building Adversarial Path Predicates -- 5.3 Algorithm Properties -- 5.4 Optimization via Early Detection of Fault Saturation (FASE-EDS) -- 5.5 Optimization via Injection on Demand (FASE-IOD) -- 5.6 Optimizations Combination -- 6 Implementation -- 7 Evaluation -- 7.1 Experimental Setting -- 7.2 Correctness and Completeness in Practice (RQ1). 
505 8 |a 7.3 Scalability (RQ2) -- 7.4 Performance Optimization (RQ3) -- 7.5 Other Experiments and Fault Models -- 8 Case Study: the WooKey Bootloader -- 9 Discussion -- 10 Related Work -- 11 Conclusion -- Automated Grading of Regular Expressions -- Builtin Types Viewed as Inductive Families -- Pragmatic Gradual Polymorphism with References -- Modal Crash Types for Intermittent Computing -- Gradual Tensor Shape Checking -- A Type System for Effect Handlersand Dynamic Labels -- Interpreting Knowledge-based Programs -- Contextual Modal Type Theory with Polymorphic Contexts -- A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests -- 1 Introduction -- 2 Overview -- 3 Introducing Skip-free GKAT -- 3.1 Skip-free Semantics -- 3.2 Axioms -- 4 1-free Star Expressions -- 5 Completeness for Skip-free Bisimulation GKAT -- 5.1 Transforming skip-free automata to labelled transition systems -- 5.2 Translating Syntax -- 6 Completeness for Skip-free GKAT -- 7 Relation to GKAT -- 7.1 Bisimulation semantics -- 7.2 Language semantics -- 7.3 Equivalences -- 8 Related Work -- 9 Discussion -- References -- Quorum Tree Abstractions of Consensus Protocols -- MAG: Types for Failure-Prone Communication -- System F-mu-omega with Context-free Session Types -- Safe Session-Based Concurrency with Shared Linear State -- Bunched Fuzz: Sensitivity for Vector Metrics -- Fast and Correct Gradient-Based Optimisationfor Probabilistic Programming via Smoothing -- Type-safe Quantum Programming in Idris -- Automatic Alignment in Higher-Order Probabilistic Programming Languages -- 1 Introduction -- 2 A Motivating Example -- 2.1 Aligned SMC -- 2.2 Aligned Lightweight MCMC -- 3 Syntax and Semantics -- 3.1 Syntax -- 3.2 Semantics -- 4 Alignment Analysis -- 4.1 A-Normal Form and Alignment -- 4.2 Alignment Analysis -- 4.3 Dynamic Alignment -- 5 Aligned SMC and MCMC -- 5.1 Aligned SMC. 
505 8 |a 5.2 Aligned Lightweight MCMC -- 6 Implementation -- 7 Evaluation -- 7.1 SMC: Constant Rate Birth-Death (CRBD) -- 7.2 SMC: Cladogenetic Diversification Rate Shift (ClaDS) -- 7.3 SMC: State-Space Aircraft Localization -- 7.4 MCMC: Latent Dirichlet Allocation (LDA) -- 7.5 MCMC: Constant Rate Birth-Death (CRBD) -- 8 Related Work -- 9 Conclusion -- References -- Correction to: Programming Languages and Systems -- Correction to: T. Wies (Ed.): Programming Languages and Systems, LNCS 13990, https://doi.org/10.1007/978-3-031-30044-8 -- Author Index. 
588 |a Description based on publisher supplied metadata and other sources. 
590 |a Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2023. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.  
655 4 |a Electronic books. 
776 0 8 |i Print version:  |a Wies, Thomas  |t Programming Languages and Systems  |d Cham : Springer International Publishing AG,c2023  |z 9783031300431 
797 2 |a ProQuest (Firm) 
830 0 |a Lecture Notes in Computer Science Series 
856 4 0 |u https://ebookcentral.proquest.com/lib/matrademy/detail.action?docID=7239158  |z Click to View 

Similar Items