Towards Better Heuristics for Solving Bounded Model Checking Problems (Short Paper)
Kheireddine, Anissa, Renault, Etienne, Baarir, Souheib
Abstract
This paper presents a new way to improve the performance of the SAT-based bounded model checking problem by exploiting relevant information identified through the characteristics of the original problem. This led us to design a new way of building interesting heuristics based on the structure of the underlying problem. The proposed methodology is generic and can be applied for any SAT problem. This paper compares the state-of-the-art approach with two new heuristics: Structure-based and Linear Programming heuristics and show promising results.
Topics & Concepts
Community structureModularity (biology)Computer scienceSolverExploitPartition (number theory)Theoretical computer scienceComplex networkRandom graphGraphData structureGraph partitionMathematicsProgramming languageBiologyGeneticsWorld Wide WebComputer securityCombinatoricsConstraint Satisfaction and OptimizationLogic, Reasoning, and KnowledgeSemantic Web and Ontologies