Effective static race detection for Java

M Naik, A Aiken, J Whaley - Proceedings of the 27th ACM SIGPLAN …, 2006 - dl.acm.org
We present a novel technique for static race detection in Java programs, comprised of a
series of stages that employ a combination of static analyses to successively reduce the …

A staged static program analysis to improve the performance of runtime monitoring

E Bodden, L Hendren, O Lhoták - … , Berlin, Germany, July 30-August 3 …, 2007 - Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of
events occurs during program execution. Our work is based on tracematches, an extension …

LZ77-like compression with fast random access

S Kreft, G Navarro - 2010 Data Compression Conference, 2010 - ieeexplore.ieee.org
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy
and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of a …

May-happen-in-parallel analysis of X10 programs

S Agarwal, R Barik, V Sarkar… - Proceedings of the 12th …, 2007 - dl.acm.org
X10 is a modern object-oriented programming language designed for high performance,
high productivity programming of parallel and multi-core computer systems. Compared to …

Featherweight X10: a core calculus for async-finish parallelism

JK Lee, J Palsberg - ACM Sigplan Notices, 2010 - dl.acm.org
We present a core calculus with two of X10's key constructs for parallelism, namely async
and finish. Our calculus forms a convenient basis for type systems and static analyses for …

Component-based lock allocation

RL Halpert, CJF Pickett… - … Conference on Parallel …, 2007 - ieeexplore.ieee.org
The allocation of lock objects to critical sections in concurrent programs affects both
performance and correctness. Recent work explores automatic lock allocation, aiming …

Efficient computation of may-happen-in-parallel information for concurrent java programs

R Barik - International Workshop on Languages and Compilers …, 2005 - Springer
Modeling of runtime threads in static analysis of concurrent programs plays an important role
in both reducing the complexity and improving the precision of the analysis. Modeling based …

A new algorithm for low-deterministic security

D Giffhorn, G Snelting - International Journal of Information Security, 2015 - Springer
We present a new algorithm for checking probabilistic noninterference in concurrent
programs. The algorithm, named RLSOD, is based on the Low-Security Observational …

Analysis of may-happen-in-parallel in concurrent objects

E Albert, AE Flores-Montoya, S Genaim - International Conference on …, 2012 - Springer
This paper presents a may-happen-in-parallel (MHP) analysis for OO languages based on
concurrent objects. In this concurrency model, objects are the concurrency units such that …

Scalable thread sharing analysis

J Huang - Proceedings of the 38th International Conference on …, 2016 - dl.acm.org
We present two scalable algorithms for identifying program locations that access thread-
shared data in concurrent programs. The static algorithm, though simple, and without …