{"title":"The performance of combining multiway decision graphs and HOL theorem prover","authors":"Sa'ed Abed, O. Mohamed, G. A. Sammane","doi":"10.1109/FDL.2008.4641435","DOIUrl":null,"url":null,"abstract":"In this paper, we are interested in defining a platform for high level model checking using multiway decision graphs (MDGs) within high order logic. The platform is based on the logical formulation of an MDG as a directed formulae (DF). The DF is defined in the HOL theorem prover where the many sorted first-order logic is characterized as a HOL built-in data type. Then, the HOL inference rules are defined to check the well-formedness conditions of any directed formula. Based on this formalization, the MDGs operations are defined as inference rules and consistency and well-formedness proof of each operation is provided. Finally, some experimental results are presented to show the performance of the MDG-HOL platform. The obtained results show that this platform offers a considerable gain in terms of automation without sacrificing CPU time and memory usage.","PeriodicalId":202172,"journal":{"name":"2008 Forum on Specification, Verification and Design Languages","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Forum on Specification, Verification and Design Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FDL.2008.4641435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we are interested in defining a platform for high level model checking using multiway decision graphs (MDGs) within high order logic. The platform is based on the logical formulation of an MDG as a directed formulae (DF). The DF is defined in the HOL theorem prover where the many sorted first-order logic is characterized as a HOL built-in data type. Then, the HOL inference rules are defined to check the well-formedness conditions of any directed formula. Based on this formalization, the MDGs operations are defined as inference rules and consistency and well-formedness proof of each operation is provided. Finally, some experimental results are presented to show the performance of the MDG-HOL platform. The obtained results show that this platform offers a considerable gain in terms of automation without sacrificing CPU time and memory usage.