Abstract
This paper is a technical supplement of our original research in the combination of genetic programming (GP), Hoare logic, model checking, and finite state automaton for Hoare triple constructions. Although there is no problem in achieving this goal by first constructing the generalized models for some given Hoare triples, the desired Hoare triples from the application of general GP approaches to them still produce ineffective results and hence needs further improvement. In this paper, we solve it through the use of some semantically valid genetic operations. Precisely, we check logic relationships among Hoare triples and generalized models for their consistence.KeywordsGenetic programmingHoare logicmodel checkingfinite state automaton
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
