Nomenclature for deterministic algorithms that might fail
I do not have an authorative answer but two proposals.

Such algorithms compute partial functions, so you could call them partial or partially correct algorithms.

Working off your literature, the class of algorithms you defined is that of Las Vegas algorithms. Even though the implication  is that the algorithm is randomised it certainly need not be; even though you have access to random bits you don't have to use them.
If you want to stress determinism, you can use deterministic Las Vegas algorithm.