1 / 3

HW8: Due Dec 17 23:59

HW8: Due Dec 17 23:59. Show the equivalence of the following two circuits by using a SMT solver. 1.1 Specify the left circuit in QF_UF 1.2 Specify the right circuit in QF_UF 1.3 Show the equivalence between the two circuit designs (note. you are required to s how the

baka
Download Presentation

HW8: Due Dec 17 23:59

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. HW8: Due Dec 17 23:59 • Show the equivalence of the following two circuits by using a SMT solver 1.1 Specify the left circuit in QF_UF 1.2 Specify the right circuit in QF_UF 1.3 Show the equivalence between the two circuit designs (note. you are required to show the validity of L5= L5’, not satisfiability)

  2. 2. Show the correctness of the following max() /* max() should return a bigger value between a and b if a!=b. If a==b, max() should return the value of b*/ int max(int a, int b) { int bigger=0; if( a >= b +1) bigger = a; else bigger= b; return bigger; } 2.1 Write down a proper assert statement to check the correctness of max() 2.2 Transform max()into a SSA form. 2.3 Write down a corresponding QF_LIA specification and check the correctness by using a SMT solver (note. you should show validity, not satisfiability for software verification) 2.4 Write down a corresponding QF_BV and check the correctness by using a SMT solver 2.5 Compare the result of 2.3 and 2.4. Why are the results different?

  3. 3. Transform the following sort program into QF_AUFLIA specification and check the correctness by using a SMT solver. #define N 3 int main(){ // local variables are initialized with random values int data[N], i, j, tmp; for (i=0; i<N-1; i++) for (j=i+1; j<N; j++) if (data[i] > data[j]){ tmp = data[i]; data[i] = data[j]; data[j] = tmp; } assert(data[0] <= data[1] && data[1] <= data[2]); }

More Related