This paper presents a tool, LLOV, which leverages polyhedral compilation for fast data-race checking for OpenMP Programs.
This paper is primarily about NP-completeness of $(k,i)$-coloring of graph and giving a parameterized algorithm for this problem using feedback vertex set as the parameter.
This paper presents a couple of incomplete Weighted MaxSAT solving techniques along with analysis on the deviation to the optimal value.
This paper shows NP-completeness of deadlock detection in certain class of MPI programs. It also presents encoding to analyze a class of MPI programs with respect to deadlocks.
This paper is an extended version of the CP 2014 paper where incremental encoding is extended to weighted MaxSAT.