Cantitate/Preț
Produs
Total produse
Vezi coșul
Programming Languages and Systems: 9th Asian Symposium, APLAS 2011, Kenting, Taiwan, December 5-7, 2011. Proceedings de Hongseok Yang

Programming Languages and Systems: 9th Asian Symposium, APLAS 2011, Kenting, Taiwan, December 5-7, 2011. Proceedings: Lecture Notes in Computer Science, cartea 7078

Editat de Hongseok Yang
en Limba Engleză Paperback – 18 noi 2011
This book constitutes the refereed proceedings of the 9th Asian Symposium on Programming Languages and Systems, APLAS 2011, held in Kenting, Taiwan, in December 2011. The 22 revised full papers presented together with 4 invited talks and one system and tool presentations were carefully reviewed and selected from 64 submissions. The papers are organized in topical sections on program analysis; functional programming; compiler; concurrency; semantics; as well as certification and logic.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33186 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 18 noi 2011 33186 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 19 mar 2017 66912 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 33186 lei

Preț vechi: 41482 lei
-20% Nou

Puncte Express: 498
Preț estimativ în valută:
6351€ • 6617$ • 5281£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642253171
ISBN-10: 3642253172
Pagini: 400
Ilustrații: XI, 372 p. 114 illus., 6 illus. in color.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.56 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Programming and Software Engineering

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 9th Asian Symposium on Programming Languages and Systems, APLAS 2011, held in Kenting, Taiwan, in December 2011. The 22 revised full papers presented together with 4 invited talks and one system and tool presentations were carefully reviewed and selected from 64 submissions. The papers are organized in topical sections on program analysis; functional programming; compiler; concurrency; semantics; as well as certification and logic.

Caracteristici

Up to date results State of the art research Fast track conference proceedings

Cuprins

Disjoint Polymorphism.- Generalizing inference systems by coaxioms.- Observed Communication Semantics for Classical Processes.- Is your software on dope? – Formal analysis of surreptitiously "enhanced" programs.- Friends with Benefits: Implementing Corecursion in Foundational Proof Assistants.- Confluence of Graph Rewriting with Interfaces.- Verifying Robustness of Event-Driven Asynchronous Programs against Concurrency.- Incremental update for graph rewriting.- Linearity, Control Effects, and Behavioral Types.- Temporary Read-Only Permissions for Separation Logic.- Faster Algorithms for Weighted Recursive State Machines.- ML and Extended BVASS. – Metric Reasoning about Lambda Terms: the General Case.- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring.- Probabilistic Termination by Monadic Affine Sized Typing.- Caper: Automatic Verification for Fine-grained Concurrency.- Tackling Real-Life Relaxed Concurrency with FSL++. - Extensible DatasortRefinements.- Programs Using Syntax with First-Class Binders. - Lincx: A Linear Logical Framework with First-class Context.- APLicative Programming with Naperian Functors.- Verified Characteristic Formulae for CakeML.- Unified Reasoning about Robustness Properties of Symbolic-Heap Separation Logic.- Proving Linearizability Using Partial Orders.- The Power of Non-Determinism in Higher-Order Implicit Complexity.- The Essence of Higher-Order Concurrent Separation Logic.- Comprehending Isabelle/HOL’s Consistency.-The essence of functional programming on semantic data.- A Classical Sequent Calculus with Dependent Types.- Context-Free Session Type Inference.- Modular Verification of Higher-order Functional Programs.- Commutative semantics for probabilistic programming.- Conditional Dyck-CFL Reachability Analysis for Complete and Efficient Library Summarization.- A Higher-Order Logic for Concurrent Termination-Preserving Refinement.- Modular Verification of Procedure Equivalence in the Presence of Memory Allocation.- Abstract Specifications for Concurrent Maps.