Programming Languages and Systems
Springer International Publishing (Verlag)
978-3-319-71236-9 (ISBN)
The 24 papers presented in this volume were carefully reviewed and selected from 56 submissions. They were organized in topical sections named: security; heap and equivalence reasoning; concurrency and verification; domain-specific languages; semantics; and numerical reasoning. The volume also contains two invited talks in full-paper length.
Invited Contributions.- Programming by Examples: PL meets ML.- Synthesizing SystemC Code from Delay Hybrid CSP.- Security.- Taming Message-passing Communication in Compositional Reasoning about Confidentiality.- Capabilities for Java: Secure Access to Resources.- Enforcing Programming Guidelines with Region-Types and Effects.- Automatically generating secure wrappers for SGX enclaves from separation logic specifications.- Heap and Equivalence Reasoning.- Black-box equivalence checking across compiler optimizations.- Weakly Sensitive Analysis for Unbounded Iteration over JavaScript Objects.- Decision Procedure for Entailment of Symbolic Heaps with Arrays.- Bringing order to the separation logic jungle.- Concurrency and Verification.- Programming and proving with classical types.- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous.- Verified Root-Balanced Trees.- Safety and Liveness of MCS Lock - Layer by Layer.- Domain-Specific Languages.- Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access.- Efficient Functional Reactive Programming through Incremental Behaviors.- Implementing Algebraic Effects in C - Monads for Free in C.- Sound and Efficient Language-Integrated Query: Maintaining the ORDER.- Semantics.- A Computational Interpretation of Context-Free Expressions.- Partiality and container monads.- The Negligible and Yet Subtle Cost of Pattern Matching.- A lambda calculus for density matrices wth classical and probabilistic controls.- Numerical Reasoning.- Compact Difference Bound Matrices.- Sharper and Simpler Nonlinear Interpolants for Program Verification.- A Nonstandard Functional Programming Language.- Counterexample-Guided Bit-Precision Selection.
| Erscheinungsdatum | 11.01.2018 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science | Programming and Software Engineering |
| Zusatzinfo | XIX, 555 p. 116 illus. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 860 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
| Schlagworte | Applications • Computer Architecture • Computer Science • Concurrency and parallelism • conference proceedings • design of languages • domain-specific languages • Formal Logic • foundational calculi • Informatics • logics • Model-Checking • program analysis • program compilers • program derivation • Programming Languages • Program Synthesis • Program Transformation • Research • Semantics • Software engineering • Software Security • Type Systems • verification |
| ISBN-10 | 3-319-71236-5 / 3319712365 |
| ISBN-13 | 978-3-319-71236-9 / 9783319712369 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
