Institutional Repository

Browsing South African Computer Journal 1999(24) by Subject "Pattern matching"

Browsing South African Computer Journal 1999(24) by Subject "Pattern matching"

Sort by: Order: Results:

  • 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 ...

Search UnisaIR


Browse

My Account