Cantitate/Preț
Produs

Programming Languages and Systems: 18th Asian Symposium, APLAS 2020, Fukuoka, Japan, November 30 – December 2, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12470

Editat de Bruno C. d. S. Oliveira
en Limba Engleză Paperback – 27 noi 2020
This book constitutes the proceedings of the 18th Asian Symposium on Programming Languages and Systems, APLAS 2020, held in Fukuoka, Japan, in December 2020.* The 19 papers presented in this volume were carefully reviewed and selected from 46 submissions. They were organized in topical sections named: Invited Papers, Types, Program Analysis, Semantics, Language Design and Implementation, Concurrency, Verification, and Logic and Automata.
* The conference was held virtually due to the COVID-19 pandemic.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32758 lei

Preț vechi: 40948 lei
-20% Nou

Puncte Express: 491

Preț estimativ în valută:
6270 6535$ 5219£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030644369
ISBN-10: 3030644367
Pagini: 374
Ilustrații: XVI, 374 p. 187 illus., 88 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.55 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering

Locul publicării:Cham, Switzerland

Cuprins

Program Analysis and Verification.- A Set-Based Context Model for Program Analysis.- Declarative Stream Runtime Verification (hLola).- Formal Verification of Atomicity Requirements for Smart Contracts.- Types.- Neural Networks, Secure by Construction: An Exploration of Refinement Types.- A New Refinement Type System for Automated nu-HFLZ Validity Checking.- Behavioural Types for Memory and Method Safety in a Core Object-Oriented Language.- Syntactically Restricting Bounded Polymorphism for Decidable Subtyping.- Semantics.- An Abstract Machine for Strong Call by Value.- Certified Semantics for Relational Programming.- Algebraic and Coalgebraic Perspectives on Interaction Laws.- Program Generation, Transactions and Automation.- Stack-Driven Program Generation of WebAssembly.- Banyan: Coordination-free Transactions over Mergeable Replicated Data Types.- Automatically Generating Descriptive Texts in Logging Statements: How Far Are We?.- Synthesis and ProgramTransformation.- Synthesis and Program Transformation.- Relational Synthesis for Pattern Matching.- REFINITY to Model and Prove Program Transformation Rules.- Debugging, Profiling and Constraint Solving.- A Counterexample-Guided Debugger for Non-Recursive Datalog.- A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving.- P3: A Profiler Suite for Parallel Applications on the Java Virtual Machine.