Hazelhurst, S
(South African Computer Society (SAICSIT), 1999)
Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g ==> m( h). This problem has important applications in hardware verification, where finding such ...