Electronic Notes in Theoretical Computer Science · 2003 · 375 citations · 9 references
ComputingComputer ScienceAlgorithmsFormal MethodsTheory Of ComputationAutomated ReasoningDeductive VerificationInductive ReasoningModel CheckingTemporal LogicVerificationBounded Model CheckingIncremental SolvingInduction HypothesisSafety PropertiesSatisfiability Problem
We show how a very modest modification to a typical modern SAT-solver enables it to solve a series of related SAT-instances efficiently. We apply this idea to checking safety properties by means of temporal induction , a technique strongly related to bounded model checking . We further give a more efficient way of constraining the extended induction hypothesis to so called loop-free paths . We have also performed the first comprehensive experimental evaluation of induction methods for safety-checking.
9
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
A machine program for theorem-proving
Martin Davis, George Logemann, Donald Loveland · Communications of the ACM · 1962 · 3.2K citations · Full text
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
Model checking large software specifications
Richard Anderson, Paul Beame, S.M. Burns et al. · 1996 · 309 citations · Full text