We have parallelized in BS-Solve two important algorithms: Buchberger's and Waltz's algorithms for computing Gröbner bases and solving CSPs respectively. They were chosen for their effective interaction (observed in the setting of sequential computation) and as representatives of symbolic- and interval-based algorithms. The BS-Solve system allows the user to mix the two algorithms in complex ways through concurrency and interleaving. For the moment, only interleaving has been considered.