Optimisation procedures in affine model checking
Natalia Olegovna Garanina · Automatic Control and Computer Sciences · 2012
The symbolic model checking is based on the compact representation of a set. Up to now, there are three general directions of symbolic model checking: methods based on binary decision diagrams, bounded model checking with SAT solvers, and various algebraic approaches to effective data representation. In the present work, improved manipulation algorithms for algebraic data representations are considered, namely, optimisation algorithms of affine data representations.