软件模型检测中的抽象模型研究综述.pdfVIP

DOI ：１０ ．７５４４/issn１０００‐１２３９ ．２０１５ Journal of Computer Research and Development ５２（７）：１５８０ １６０３ ，２０１５ １ １ １ ，２ １ １ 　 　 　 　 　 　 １ （　 　 ２１００１６） ２ （　 　 ２１００３７） （ow ei＠ nuaa ．edu ．cn ） Abstract Modeling Formalisms in Software Model Checking Wei Ou１ ，Shi Yuf eng１ ，Xu Bingf eng１ ，２ ， Huang Zhiqiu１ ，and Chen Zhe１ １ （Colle e o Com ute r Science and Technolo ， N an ing Univ e rs it o A e ronautics and A s tronautics ， N an ing ２１００１６） g f p gy j y f j ２ （Colle e o I n o rmation Sc ience and Technolo ， N an ing Fo res tr Univ e rs it ， N an ing ２１００３７） g f f gy j y y j Abstract 　 A bstraction is a f undamental technique f or solving the state‐ex plo sion problem in sof tw are model checking ．In this paper ， w e survey a variety of abstract modeling f ormalisms that have been developed f or this over the y ears ．We first provide an overview of abstract sof tw are model checking based on the theoretical f ramew ork of abstract interpretation ． We then discuss in detail several abstract modeling f ormalism s that are represented by １ ） boolean Kripke structures ， supporting traditional over ‐approx imation or under‐approximation ；２） Kripke modal transition sy stem s and mix ed transition sy stem s ，respectively corresponding to ３‐valued and ４‐valued Kripke structures ，supporting both over‐approximation and under‐approximation on a single model ； and ３ ） models w ith hy per transitions ， including generalized Kripke modal transition sy stems and hy per transition sy stems ， allow ing f or more precise abstract model checking ． We discuss the correspond