VERIFIKASI BERBASIS ASERSI OTOMATIS MODULAR DENGAN METODE SEPARATION LOGIC

Luh Putu Ary Tjahyanti, Sarwosri Sarwosri, Bain Khusnul Khotimah

Abstract


In doing assertion design program as in the driver of hardware, wrong logic
problems is often unpredictable which is caused a complicated listing problems.
Proved Mathematics will not solve the problems, but it needs tool detector for wrong logic and programmer who detect the problems. The available compilers verify the code program and warn when mistakes are found. On other hand, listing program having wrong logic often can be compiled, this result in ineffectiveness of programmer’s performance. This research tries to offer Accsrtion-Based verification with otomata technique. Accertion- Based Verification covers the specification,design and implementation with separation logic method .Accertion-Based Verification also supports intellegent debug system to help users effectively in understanding the accertain programs and its result. Its principal is that the listing program having Boolean expression will be separated to be verified every variable, modul and used class. This tool is examined with the examples of listing problem having logic debug mistake and listing of the correct logic. The result of toon Accertion- Based Verification may detect the maistake logic and do the process of writing in accertionbased programing.


Keywords


Assertion Based Verification, Separation Logic, Boolean Expression

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


This work is licensed under a Creative Commons Attribution 4.0 International License.