Amazon cover image
Image from Amazon.com

Programming languages and systems : 9th Asian Symposium, APLAS 2011, Kenting, Taiwan, December 5-7, 2011, Proceedings / Hongseok Yang (ed.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 7078. | LNCS sublibrary. SL 2, Programming and software engineering.Publication details: Berlin ; New York : Springer, ©2011.Description: 1 online resource (xi, 383 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642253188
  • 3642253180
Subject(s): Genre/Form: Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.13 23
LOC classification:
  • QA76.7 .A65 2011
Online resources:
Contents:
Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Invited Talks -- Program Analysis and Machine Learning: A Win-Win Deal -- References -- Software Verification with Liquid Types -- Engineering Theories with Z3 -- Introduction -- SMT, DPLL(T), and Z3 -- SMT -- DPLL(T) -- Z3's Theory Solver API -- Weighted MaxSMT -- Theories for Partial Orders and Class Inheritance -- A Basic Solver for Partial Orders -- Sub-typing Closure -- A Theory of Object Graphs -- An Encoding Using Arrays -- An Encoding Using Recursive Data-Types and Arrays -- Not All Encodings are Equal -- HOL
Leveraging Theories -- Conclusions -- References -- Algebra, Logic, Locality, Concurrency -- References -- Session 1: Program Analysis -- Modular Abstractions of Reactive Nodes Using Disjunctive Invariants -- Introduction -- Invariants by Predicate Abstraction -- Solution of a Universally Quantified Formula -- Naive Algorithm for a Given Postcondition -- Performance Improvements -- Iterative Refinement of Invariants -- Extensions -- Step-by-Step Example of Invariant Inference -- Construction of the Abstract Automaton -- Related Work -- Conclusion
Modular Abstractions of Reactive Nodes Using Disjunctive Invariants -- Introduction -- Invariants by Predicate Abstraction -- Solution of a Universally Quantified Formula -- Naive Algorithm for a Given Postcondition -- Performance Improvements -- Iterative Refinement of Invariants -- Extensions -- Step-by-Step Example of Invariant Inference -- Construction of the Abstract Automaton -- Related Work -- Conclusion -- References -- Template-Based Unbounded Time Verification of Affine Hybrid Automata -- Introduction -- Basics -- Our Approach: Getting into the Corset of the Monotone Framework
Adapting the Max-Strategy Approach -- Conclusion -- References -- Access-Based Localization with Bypassing -- Introduction -- Setting: Analysis Framework -- Graph Representation of Programs -- Static Analysis -- Access-Based Localization with Bypassing -- Access-Based Localization: Previous Approach -- Access-Based Localization with Bypassing: Our Approach -- Delivery Points Optimization -- Experiments -- Setting Up -- Results -- Related Work -- Conclusion -- References -- Session 2: Functional Programming -- A Deductive Database with Datalog and SQL Query Languages -- Introduction
System Architecture -- Source-to-Source Program Transformations -- Compile-Time Analyses -- Strong Constraints -- Tracing and Debugging -- Conclusions -- References -- Constructing List Homomorphisms from Proofs -- Introduction -- Preliminaries -- Folds and List Homomorphisms -- From Duality to Homomorphism -- The Steep List Problem -- Constructing () Formally -- Computing Capacity by a List Homomorphism -- Parallel Scan -- Reasoning with Conditionals -- Conclusions -- References -- Extending Hindley-Milner Type Inference with Coercive Structural Subtyping -- Introduction
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and author index.

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.

Intro -- Title Page -- Preface -- Organization -- Table of Contents -- Invited Talks -- Program Analysis and Machine Learning: A Win-Win Deal -- References -- Software Verification with Liquid Types -- Engineering Theories with Z3 -- Introduction -- SMT, DPLL(T), and Z3 -- SMT -- DPLL(T) -- Z3's Theory Solver API -- Weighted MaxSMT -- Theories for Partial Orders and Class Inheritance -- A Basic Solver for Partial Orders -- Sub-typing Closure -- A Theory of Object Graphs -- An Encoding Using Arrays -- An Encoding Using Recursive Data-Types and Arrays -- Not All Encodings are Equal -- HOL

Leveraging Theories -- Conclusions -- References -- Algebra, Logic, Locality, Concurrency -- References -- Session 1: Program Analysis -- Modular Abstractions of Reactive Nodes Using Disjunctive Invariants -- Introduction -- Invariants by Predicate Abstraction -- Solution of a Universally Quantified Formula -- Naive Algorithm for a Given Postcondition -- Performance Improvements -- Iterative Refinement of Invariants -- Extensions -- Step-by-Step Example of Invariant Inference -- Construction of the Abstract Automaton -- Related Work -- Conclusion

Modular Abstractions of Reactive Nodes Using Disjunctive Invariants -- Introduction -- Invariants by Predicate Abstraction -- Solution of a Universally Quantified Formula -- Naive Algorithm for a Given Postcondition -- Performance Improvements -- Iterative Refinement of Invariants -- Extensions -- Step-by-Step Example of Invariant Inference -- Construction of the Abstract Automaton -- Related Work -- Conclusion -- References -- Template-Based Unbounded Time Verification of Affine Hybrid Automata -- Introduction -- Basics -- Our Approach: Getting into the Corset of the Monotone Framework

Adapting the Max-Strategy Approach -- Conclusion -- References -- Access-Based Localization with Bypassing -- Introduction -- Setting: Analysis Framework -- Graph Representation of Programs -- Static Analysis -- Access-Based Localization with Bypassing -- Access-Based Localization: Previous Approach -- Access-Based Localization with Bypassing: Our Approach -- Delivery Points Optimization -- Experiments -- Setting Up -- Results -- Related Work -- Conclusion -- References -- Session 2: Functional Programming -- A Deductive Database with Datalog and SQL Query Languages -- Introduction

System Architecture -- Source-to-Source Program Transformations -- Compile-Time Analyses -- Strong Constraints -- Tracing and Debugging -- Conclusions -- References -- Constructing List Homomorphisms from Proofs -- Introduction -- Preliminaries -- Folds and List Homomorphisms -- From Duality to Homomorphism -- The Steep List Problem -- Constructing () Formally -- Computing Capacity by a List Homomorphism -- Parallel Scan -- Reasoning with Conditionals -- Conclusions -- References -- Extending Hindley-Milner Type Inference with Coercive Structural Subtyping -- Introduction

Powered by Koha