Enhanced operating system security through efficient and fine-grained address space randomization

C Giuffrida, A Kuijsten, AS Tanenbaum - 21st USENIX Security …, 2012 - usenix.org
In recent years, the deployment of many application-level countermeasures against memory
errors and the increasing number of vulnerabilities discovered in the kernel has fostered a …

Automated atomicity-violation fixing

G Jin, L Song, W Zhang, S Lu, B Liblit - Proceedings of the 32nd ACM …, 2011 - dl.acm.org
Fixing software bugs has always been an important and time-consuming process in software
development. Fixing concurrency bugs has become especially critical in the multicore era …

Automated {Concurrency-Bug} Fixing

G Jin, W Zhang, D Deng - … Symposium on Operating Systems Design and …, 2012 - usenix.org
Concurrency bugs are widespread in multithreaded programs. Fixing them is time-
consuming and error-prone. We present CFix, a system that automates the repair of …

R2Fix: Automatically generating bug fixes from bug reports

C Liu, J Yang, L Tan, M Hafiz - 2013 IEEE Sixth international …, 2013 - ieeexplore.ieee.org
Many bugs, even those that are known and documented in bug reports, remain in mature
software for a long time due to the lack of the development resources to fix them. We …

Failure sketching: A technique for automated root cause diagnosis of in-production failures

B Kasikci, B Schubert, C Pereira, G Pokam… - Proceedings of the 25th …, 2015 - dl.acm.org
Developers spend a lot of time searching for the root causes of software failures. For this,
they traditionally try to reproduce those failures, but unfortunately many failures are so hard …

Parrot: A practical runtime for deterministic, stable, and reliable threads

H Cui, J Simsa, YH Lin, H Li, B Blum, X Xu… - Proceedings of the …, 2013 - dl.acm.org
Multithreaded programs are hard to get right. A key reason is that the contract between
developers and runtimes grants exponentially many schedules to the runtimes. We present …

Detecting and surviving data races using complementary schedules

K Veeraraghavan, PM Chen, J Flinn… - Proceedings of the …, 2011 - dl.acm.org
Data races are a common source of errors in multithreaded programs. In this paper, we
show how to protect a program from data race errors at runtime by executing multiple …

Paxos made transparent

H Cui, R Gu, C Liu, T Chen, J Yang - Proceedings of the 25th …, 2015 - dl.acm.org
State machine replication (SMR) leverages distributed consensus protocols such as Paxos
to keep multiple replicas of a program consistent in face of replica failures or network …

Efficient deterministic multithreading through schedule relaxation

H Cui, J Wu, J Gallagher, H Guo, J Yang - Proceedings of the Twenty …, 2011 - dl.acm.org
Deterministic multithreading (DMT) eliminates many pernicious software problems caused
by nondeterminism. It works by constraining a program to repeat the same thread …

Concurrency attacks

J Yang, A Cui, S Stolfo, S Sethumadhavan - 4th USENIX Workshop on …, 2012 - usenix.org
Just as errors in sequential programs can lead to security exploits, errors in concurrent
programs can lead to concurrency attacks. Questions such as whether these attacks are …