Programming Languages and Systems : 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings (Programming and Software Engineering)

個数:

Programming Languages and Systems : 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings (Programming and Software Engineering)

  • オンデマンド(OD/POD)版です。キャンセルは承れません。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 321 p.
  • 言語 ENG
  • 商品コード 9783030890506

Full Description

This book constitutes the proceedings of the 19th Asian Symposium on Programming Languages and Systems, APLAS 2021, held in Chicago, USA, in October 2021.*

The 17 papers presented in this volume were carefully reviewed and selected from 43 submissions. They were organized in topical sections named: analysis and synthesis, compilation and transformation, language, and verification.

* The conference was held in a hybrid format due to the COVID-19 pandemic.

Contents

Analysis and Synthesis.- Scalable and Modular Robustness Analysis of Deep Neural Networks.- Function Pointer Eliminator for C Programs.- PyCT: A Python Concolic Tester.- Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications.- Server-Side Computation of Package Dependencies in Package-Management Systems.- Compilation and Transformation.- Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly.- A Dictionary-Passing Translation of Featherweight Go.- Hybrid quantum-classical circuit simplification with the ZX-calculus.- A compilation method for dynamic typing in ML.- Language Design.- The Choice Construct in the Soufflé Language.- Latent Effects for Reusable Language Components.- Adaptable Traces for Program Explanations.- A Typed Programmatic Interface to Contracts on the Blockchain.- Verification.- Simplifying of Alternating Automata for Emptiness Testing.- Termination Analysis for the pi-Calculus byReduction to Sequential Program Termination.- Proving LTL Properties of Bitvector Programs and Decompiled Binaries.- Solving Not-Substring Constraint with Flat Abstraction.-

最近チェックした商品