2

LLOV: A Fast Static Data-Race Checker for OpenMP Programs

This paper presents a tool, LLOV, which leverages polyhedral compilation for fast data-race checking for OpenMP Programs.

On the tractability of $(k,i)$-coloring (Extended Journal Version)

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.

Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT

This paper presents a couple of incomplete Weighted MaxSAT solving techniques along with analysis on the deviation to the optimal value.

Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs

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.

On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving

This paper is an extended version of the CP 2014 paper where incremental encoding is extended to weighted MaxSAT.