Cantitate/Preț
Produs
Total produse
Vezi coșul
Programming Languages and Systems de Hakjoo Oh

Programming Languages and Systems: Lecture Notes in Computer Science, cartea 13008

Editat de Hakjoo Oh
en Limba Engleză Paperback – 9 oct 2021
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 48860 lei

Preț vechi: 61076 lei
-20%

Puncte Express: 733
Preț estimativ în valută:
8640€ • 9907$ • 7467£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030890506
ISBN-10: 3030890503
Pagini: 336
Ilustrații: XIV, 321 p. 111 illus., 55 illus. in color.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.-