1 / 3

Formal Verification and Randomized Testing of Flash Memory Reading Unit and Tower of Hanoi Solutions

This assignment focuses on the formal verification of a flash memory reading unit and solving the Tower of Hanoi problem. Students must demonstrate the correctness of the `flash_read()` function via randomized and exhaustive testing, generating 43,680 distinct test cases without printing them. Additionally, students will write a C program for the Tower of Hanoi using a random approach to obtain 100 solutions, analyze the results for the shortest solution, and create a second program using CBMC for verification. Documentation of the environment model and comparison of results is required.

august
Télécharger la présentation

Formal Verification and Randomized Testing of Flash Memory Reading Unit and Tower of Hanoi Solutions

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. HW#3: Due Oct 15 NOTE. Submit both hardcopy and softcopy. 10% penalty for missing hardcopy or softcopy • Formal verification a flash memory reading unit (70 pts) • Show the correctness of the flash_read() • By using randomized testing • Randomly select the physical sectors to write four characters and set the corresponding SAMs • By using exhaustive testing • Create 43680 (16*15*14*13) distinct test cases • Do not print test cases in your hardcopy to save trees • By using CBMC • Create environment model satisfying the invariant formula by using __CPROVER_assume() and nested loops • Submit the above three answers • The above three versions of code including the target program and your environment • Describe your environment model in detail • Compare the three verification results

  2. typedefstruct _SAM_type{ unsigned char offset[SECT_PER_U]; }SAM_type; typedefstruct _PU_type{ unsigned char sect[SECT_PER_U]; }PU_type; // Environment assumption // 0. Each unit contains 4 sectors. // 1. There is one logical unit containing "abcd" // 2. There are 4 physical units // 3. The value of SAM table is 255 if the corresponding // physical sector does not have a valid data void flash_read(char *buf, SAM_type *SAM, PU_type *pu ){ unsigned char nSamIdx = 0; unsigned char pu_id = 0; unsigned char n_scts = 4; // number of sectors to read unsigned char offset = 0; //offset of the physical sector to read unsigned char pBuf = 0; while(n_scts > 0){ pu_id=0; offset = 255; // read 1 character while(1) { if (SAM[pu_id].offset[nSamIdx] != 255){ offset = SAM[pu_id].offset[nSamIdx++]; buf[pBuf] = PU[pu_id].sect[offset]; break; } pu_id ++; } n_scts--; pBuf ++; } }

  3. Write down a C program to solve the Tower of Hanoi game (3 poles and 5 disks) in a random manner (10 pts) • Do not solve the game using an intelligent strategy, but random sequence of moving choices • Obtain 100 random solutions and get the average step #. • Describe the shortest solution among the above 100 solutions • Write down a C program to solve the Tower of Hanoi game (3 poles and 5 disks) by using CBMC (20 pts) • Hint: the C program will be quite similar to the random one • Find the shortest solution by analyzing counter examples. Also explain why your solution is the shortest one. • Use non-determinism and __CPROVER_assume() properly for the moving choice • Use assert statement to detect when all the disks are moved to the destination

More Related