Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
