A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Efficient Distributed SAT and SAT-Based Distributed Bounded Model Checking
[chapter]
2003
Lecture Notes in Computer Science
SAT-based Bounded Model Checking (BMC), though a robust and scalable verification approach, still is computationally intensive, requiring large memory and time. Interestingly, with the recent development of improved SAT solvers, it is frequently the memory limitation of a single server rather than time that becomes a bottleneck for doing deeper BMC search. Distributing computing requirements of BMC over a network of workstations can overcome the memory limitation of a single server, albeit at
doi:10.1007/978-3-540-39724-3_30
fatcat:7kfwjl2x3zhfpe6odfbtfgodzy