Abstract Problems arising in many scientific disciplines are often modelled using edge-coloured directed graphs. These can be enormous the number of both vertices and colours. Given such a graph, original problem frequently translates to detection graph’s strongly connected components, which is challenging at this scale. We propose new, symbolic algorithm that computes all monochromatic compone...

Program slicing is a technique for simplifying programs by focusing on selected aspects of their behavior. Current mainstream static methods operate dependence graph PDG (program graph) or SDG (system graph), but these friendly representations may be bit expensive some users. In this paper we attempt to study light-weight approach program slicing, called Symbolic Slicing (SymPas), which works a...