formal property qualification
Post on 31-Dec-2015
39 Views
Preview:
DESCRIPTION
TRANSCRIPT
Formal Property Qualification
: :
Formal Property Qualification
Model Checking Model
What is mutant??Original program code:a = b | c;Mutated program:a = b & c;b|c b&c livekilledlivekilledGoalmutation-based Problem Description
MPMPMPMMP
(2) MFunctions and Features
MPPMMARCHDLPMPMPM (Contributions and Results)
Model checking & Input / Output Input Design M: written in DIMACS CNF format
10 Input Property P[1] : written in DIMACS CNF format
Model checking & Input / Output 11 Input The concatenation of M and P[1]: (M, P[1])
Given a (M, P[i]) pair, we denote the model checking as SAT (M, P[i])
If the solver returns TRUE M satisfies the property P[i] Otherwise, returns FALSE M violates P[i]Model checking & Input / Output 12 Model checkingforeach P[i], ( 0 < i
top related