Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. - Anna Beletska; Wlodzimierz Bielecki; Pierluigi San Pietro (ISPDC, 2007)

Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. - Wlodzimierz Bielecki; Anna Beletska; Marek Palkowski; Pierluigi San Pietro (ICA3PP, 2008)

Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. - Anna Beletska; Wlodzimierz Bielecki; Krzysztof Siedlecki; Pierluigi San Pietro (ICCSA (2), 2008)

Computing the Transitive Closure of a Union of Affine Integer Tuple Relations. - Anna Beletska; Denis Barthou; Wlodzimierz Bielecki; Albert Cohen 001 (COCOA, 2009)

Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. - Anna Beletska; Wlodzimierz Bielecki; Albert Cohen 001; Marek Palkowski (LCPC, 2009)

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations. - Wlodzimierz Bielecki; Tomasz Klimek; Marek Palkowski; Anna Beletska (COCOA (1), 2010)

Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations. - Sven Verdoolaege; Albert Cohen 001; Anna Beletska (SAS, 2011)

Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations. - Anna Beletska; Wlodzimierz Bielecki; Albert Cohen 001; Marek Palkowski; Krzysztof Siedlecki (Parallel Comput., 2011)

An Iterative Algorithm of Computing the Transitive Closure of a Union of Parametrized Affine Integer Tuple Relations. - Wlodzimierz Bielecki; Tomasz Klimek; Marek Palkowski; Anna Beletska (Discret. Math. Algorithms Appl., 2012)