Efficient testing of concurrent programs with abstraction-guided symbolic execution

N Rungta, EG Mercer, W Visser - … SPIN Workshop on Model Checking of …, 2009 - Springer
In this work we present an abstraction-guided symbolic execution technique that quickly
detects errors in concurrent programs. The input to the technique is a set of target locations …

ML + FV = ? A Survey on the Application of Machine Learning to Formal Verification

M Amrani, L Lúcio, A Bibal - arXiv preprint arXiv:1806.03600, 2018 - arxiv.org
Formal Verification (FV) and Machine Learning (ML) can seem incompatible due to their
opposite mathematical foundations and their use in real-life problems: FV mostly relies on …

Clash of the titans: tools and techniques for hunting bugs in concurrent programs

N Rungta, EG Mercer - Proceedings of the 7th Workshop on Parallel and …, 2009 - dl.acm.org
In this work we focus on creating a benchmark suite of concurrent programs for various
programming languages to evaluate the bug detection capabilities of various tools and …

A meta heuristic for effectively detecting concurrency errors

N Rungta, EG Mercer - Haifa Verification Conference, 2008 - Springer
Mainstream programming is migrating to concurrent architectures to improve performance
and facilitate more complex computation. The state of the art static analysis tools for …

Generating counter-examples through randomized guided search

N Rungta, EG Mercer - International SPIN Workshop on Model Checking of …, 2007 - Springer
Computational resources are increasing rapidly with the explosion of multi-core processors
readily available from major vendors. Model checking needs to harness these resources to …

Experience with a concurrency bugs benchmark

Y Eytani, R Tzoref, S Ur - 2008 IEEE International Conference …, 2008 - ieeexplore.ieee.org
We describe a benchmark of publicly-available multi-threaded programs with documented
bugs in them. This project was initiated a few years ago with the goal of helping research …

Vector-clock based partial order reduction for jpf

E Noonan, E Mercer, N Rungta - ACM SIGSOFT Software Engineering …, 2014 - dl.acm.org
Java Pathfinder (JPF) employs a dynamic partial order reduction based on sharing and state
hashing to reduce the schedules in concurrent systems. That partial order reduction is …

Search algorithms for automated validation

TAN Engels, JF Groote, MJ van Weerdenburg… - The Journal of Logic and …, 2009 - Elsevier
A novel search technique called highway search is introduced. The search technique relies
on a highway simulation which takes several homogeneous walks through a (possibly …

Refinement of structural heuristics for model checking of concurrent programs through data mining

R Milewicz, P Pirkelbauer - Computer Languages, Systems & Structures, 2017 - Elsevier
Detecting concurrency bugs in multi-threaded programs through model-checking is
complicated by the combinatorial explosion in the number of ways that different threads can …

Complementarity of error detection techniques

R Pelánek, V Rosecký, P Moravec - Electronic notes in theoretical computer …, 2008 - Elsevier
We study explicit techniques for detection of safety errors, eg, depth-first search, directed
search, random walk, and bitstate hashing. We argue that it is not important to find the best …