Sciweavers

Abstract. We study the efﬁcient implementation of call-by-value using the structure of interactive computation models. This structure has been useful in applications to resource-...

Ulrich Schöpp

claim paper

Read More »

104

click to vote

APLAS
2015
ACM

14views Programming Languages» more APLAS 2015»

Quasi-Linearizability is Undecidable

9 years 10 months ago

Download lcs.ios.ac.cn

Abstract. Quasi-linearizability is a quantitative relaxation of linearizability. It preserves the intuition of the standard notion of linearizability and permits more ﬂexibility....

Chao Wang, Yi Lv, Gaoang Liu, Peng Wu 0002

claim paper

Read More »

103

click to vote

APLAS
2015
ACM

23views Programming Languages» more APLAS 2015»

Shifting the Blame - A Blame Calculus with Delimited Control

9 years 10 months ago

Download www.fos.kuis.kyoto-u.ac.jp

We study integration of static and dynamic typing in the presence of delimited-control operators. In a program where typed and untyped parts coexist, the run-time system has to mon...

Taro Sekiyama, Soichiro Ueda, Atsushi Igarashi

claim paper

Read More »

click to vote

APLAS
2015
ACM

25views Programming Languages» more APLAS 2015»

Bottom-Up Context-Sensitive Pointer Analysis for Java

9 years 10 months ago

Download www.cs.utexas.edu

This paper describes a new bottom-up, subset-based, and context-sensitive pointer analysis for Java. The main novelty of our technique is the constraint-based handling of virtual m...

Yu Feng, Xinyu Wang, Isil Dillig, Thomas Dillig

claim paper

Read More »

All Subjects

Algorithms

Applied Computing

Artificial Intelligence