Programming Languages and Systems 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings /
The 23 papers presented together with 4 invited papers 2 system and tool presentations and 1 tutorial lecture were carefully reviewed and selected from 95 initial submissions. The papers are devoted to both foundational and practical issues in programming languages and systems and feature current re...
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
| Σειρά: | Lecture Notes in Computer Science,
6461 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Invited Talks
- A Calculus for Hybrid CSP
- Foundations of Quantum Programming (Extended Abstract)
- From a Verified Kernel towards Verified Systems
- Reasoning about Computations Using Two-Levels of Logic
- Session 1
- Typechecking Higher-Order Security Libraries
- Towards Deriving Type Systems and Implementations for Coroutines
- Liberal Typing for Functional Logic Programs
- Session 2
- A Provably Correct Stackless Intermediate Representation for Java Bytecode
- JNI Light: An Operational Model for the Core JNI
- An Interactive Tool for Analyzing Embedded SQL Queries
- Session 3
- Simple and Precise Widenings for H-Polyhedra
- Metric Spaces and Termination Analyses
- Session 4
- Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
- Interprocedural Control Flow Reconstruction
- Data Structure Fusion
- Session 5
- Categorical Descriptional Composition
- Bisimulation Proof Methods in a Path-Based Specification Language for Polynomial Coalgebras
- Context-Preserving XQuery Fusion
- Session 6
- Index-Compact Garbage Collection
- Live Heap Space Bounds for Real-Time Systems
- Session 7
- A Quick Tour of the VeriFast Program Verifier
- Verification of Tree-Processing Programs via Higher-Order Model Checking
- Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
- Session 8
- Relational Parametricity for a Polymorphic Linear Lambda Calculus
- A Certified Implementation of ML with Structural Polymorphism
- Type Inference for Sublinear Space Functional Programming
- Session 9
- Liveness of Communicating Transactions (Extended Abstract)
- Model Independent Order Relations for Processes
- Concurrency Can’t Be Observed, Asynchronously
- Tutorial
- A Logical Mix of Approximation and Separation.