Extensions to the Predicate Programming Language for Efficient Graph Processing

High-performance and correct implementation of graph algorithms for parallel hardware is a challenge. A set-based approach to develop efficient and correct graph processing algorithms in the framework of predicate software engineering is proposed. The efficiency of predicate programs is achieved by applying optimizing transformations.