1 Hit in 3.9 sec

A Theory of Predicate-Complete Test Coverage and Generation [chapter]

Thomas Ball
2005 Lecture Notes in Computer Science  
The goal of predicate-complete testing (PCT) is to cover every reachable observable state (at most m × 2 n of them) in a program.  ...  Consider a program with m statements and n predicates, where the predicates are derived from the conditional statements and assertions in a program, as well as from implicit run-time safety checks.  ...  Acknowledgements Thanks to Daniel Kroening for his help with the CBMC model checker. Thanks also to Byron Cook, Tony Hoare, Vladimir Levin, Orna Kupferman and Andreas Podelski for their comments.  ... 
doi:10.1007/11561163_1 fatcat:ibyvj2iczrhurl3v5lqs76rjf4