Amazon cover image
Image from Amazon.com

Programming languages and systems : 13th Asian symposium, APLAS 2015, Pohang, South Korea, November 30 - December 2, 2015, proceedings / Xinyu Feng, Sungwoo Park (eds.).

By: Contributor(s): Material type: TextTextSeries: LNCS sublibrary. SL 2, Programming and software engineering. | Lecture notes in computer science ; 9458.Publisher: Cham : Springer, 2015Description: 1 online resource (xix, 506 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319265292
  • 3319265296
Other title:
  • APLAS 2015
Subject(s): Genre/Form: Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.13 23
LOC classification:
  • QA76.7
Online resources:
Contents:
Intro -- Preface -- Organization -- Invited Talks -- Programming with "Big Code" -- Analyzing JavaScript Web Applications in the Wild (Mostly) Statically -- Probabilistic Programming -- Contents -- Invited Talk -- Programming with ``Big Code'' -- References -- Compilers -- Memory-Efficient Tail Calls in the JVM with Imperative Functional Objects -- 1 Introduction -- 2 FCore and IFOs, Informally -- 2.1 Encoding Functions with IFOs -- 2.2 Tail-Call Elimination -- 3 Compiling FCore -- 4 Tail-Call Elimination -- 5 Implementation and Evaluation -- 5.1 Implementation -- 5.2 Evaluation
6 Related Work -- 7 Conclusion and Future Work -- References -- A Secure Compiler for ML Modules -- 1 Introduction -- 2 Overview -- 2.1 The Source Language ModuleML -- 2.2 The Low-Level Target Language A+I -- 2.3 The Attacker -- 2.4 The Secure Abstract Data Type Pattern -- 3 A Secure Compiler for ModuleML -- 3.1 Booleans, Integers and Pairs -- 3.2 Abstract Types -- 3.3 Structures and Signatures -- 3.4 Higher-Order Functions -- 3.5 Locations -- 3.6 Functors -- 4 Compiler Reflection -- 5 Implementation and Experimental Results -- 6 Related Work -- 7 Conclusions -- References
Detection of Redundant Expressions: A Complete and Polynomial-Time Algorithm in SSA -- 1 Introduction -- 2 Motivation -- 2.1 Kildall's Algorithm -- 2.2 Gulwani's Algorithm -- 2.3 Our View -- 3 Terminology -- 4 Basic Concept -- 4.1 Value -function -- 4.2 Proposed Method -- 5 Algorithm -- 5.1 Join -- 5.2 Transfer Function -- 5.3 The Iterative Algorithm -- 5.4 Complexity Analysis -- 6 Implementation and Results -- 7 Related Work -- 8 Conclusion -- References -- Separation Logic -- Separation Logic with Monadic Inductive Definitions and Implicit Existentials -- 1 Introduction
2 Separation Logic with Inductive Definitions -- 2.1 Symbolic Heaps with Inductive Definitions -- 2.2 Implicit Existential -- 2.3 Separation Logic Sep -- 2.4 Semantics -- 2.5 Related Work -- 2.6 Main Ideas -- 3 Translation in Sep -- 3.1 Transformation of Weak Progress into Progress -- 3.2 Simplification of Definition Clauses -- 3.3 Separation Logic Sep -- 3.4 Translation of Inductive Predicates in Sep -- 3.5 Translation of Symbolic Heaps in Sep -- 4 Translation in Bounded-Treewidth Separation Logic -- 5 Main Theorems -- 6 Undecidability of SLRDbtw with Implicit Existentials -- 7 Conclusion
Summary: This book constitutes the refereed proceedings of the 13th Asian Symposium on Programming Languages and Systems, APLAS 2015, held in Pohang, South Korea, in November/December 2015. The 24 regular papers presented together with 1 short paper were carefully reviewed and selected from 74 submissions. The papers cover a variety of foundational and practical issues in programming languages and systems and have been organized in topical sections on compilers, separation logic, static analysis and abstract interpretation, Hoare logic and types, functional programming and semantics, model checking, program analysis, medley, and programming models.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

International conference proceedings.

Includes bibliographical references and author index.

Online resource; title from PDF title page (SpringerLink, viewed December 14, 2015).

This book constitutes the refereed proceedings of the 13th Asian Symposium on Programming Languages and Systems, APLAS 2015, held in Pohang, South Korea, in November/December 2015. The 24 regular papers presented together with 1 short paper were carefully reviewed and selected from 74 submissions. The papers cover a variety of foundational and practical issues in programming languages and systems and have been organized in topical sections on compilers, separation logic, static analysis and abstract interpretation, Hoare logic and types, functional programming and semantics, model checking, program analysis, medley, and programming models.

English.

Intro -- Preface -- Organization -- Invited Talks -- Programming with "Big Code" -- Analyzing JavaScript Web Applications in the Wild (Mostly) Statically -- Probabilistic Programming -- Contents -- Invited Talk -- Programming with ``Big Code'' -- References -- Compilers -- Memory-Efficient Tail Calls in the JVM with Imperative Functional Objects -- 1 Introduction -- 2 FCore and IFOs, Informally -- 2.1 Encoding Functions with IFOs -- 2.2 Tail-Call Elimination -- 3 Compiling FCore -- 4 Tail-Call Elimination -- 5 Implementation and Evaluation -- 5.1 Implementation -- 5.2 Evaluation

6 Related Work -- 7 Conclusion and Future Work -- References -- A Secure Compiler for ML Modules -- 1 Introduction -- 2 Overview -- 2.1 The Source Language ModuleML -- 2.2 The Low-Level Target Language A+I -- 2.3 The Attacker -- 2.4 The Secure Abstract Data Type Pattern -- 3 A Secure Compiler for ModuleML -- 3.1 Booleans, Integers and Pairs -- 3.2 Abstract Types -- 3.3 Structures and Signatures -- 3.4 Higher-Order Functions -- 3.5 Locations -- 3.6 Functors -- 4 Compiler Reflection -- 5 Implementation and Experimental Results -- 6 Related Work -- 7 Conclusions -- References

Detection of Redundant Expressions: A Complete and Polynomial-Time Algorithm in SSA -- 1 Introduction -- 2 Motivation -- 2.1 Kildall's Algorithm -- 2.2 Gulwani's Algorithm -- 2.3 Our View -- 3 Terminology -- 4 Basic Concept -- 4.1 Value -function -- 4.2 Proposed Method -- 5 Algorithm -- 5.1 Join -- 5.2 Transfer Function -- 5.3 The Iterative Algorithm -- 5.4 Complexity Analysis -- 6 Implementation and Results -- 7 Related Work -- 8 Conclusion -- References -- Separation Logic -- Separation Logic with Monadic Inductive Definitions and Implicit Existentials -- 1 Introduction

2 Separation Logic with Inductive Definitions -- 2.1 Symbolic Heaps with Inductive Definitions -- 2.2 Implicit Existential -- 2.3 Separation Logic Sep -- 2.4 Semantics -- 2.5 Related Work -- 2.6 Main Ideas -- 3 Translation in Sep -- 3.1 Transformation of Weak Progress into Progress -- 3.2 Simplification of Definition Clauses -- 3.3 Separation Logic Sep -- 3.4 Translation of Inductive Predicates in Sep -- 3.5 Translation of Symbolic Heaps in Sep -- 4 Translation in Bounded-Treewidth Separation Logic -- 5 Main Theorems -- 6 Undecidability of SLRDbtw with Implicit Existentials -- 7 Conclusion

Powered by Koha