Efficient distributed SAT and SAT-based distributed bounded model checking

DOI10.1007/B93958zbMATH Open1179.68084OpenAlexW219731125MaRDI QIDQ5897077FDOQ5897077

Authors: Aarti Gupta, Zijiang Yang, Pranav Ashar, Malay K. Ganai 

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b93958

Recommendations

• Parallel SAT solving in bounded model checking
• scientific article; zbMATH DE number 1670796
• scientific article; zbMATH DE number 2087634
• Distributed symbolic bounded property checking
• Accelerating bounded model checking of safety properties

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (8)

• Distributed breadth-first search LTL model checking
• Tools and Algorithms for the Construction and Analysis of Systems
• Correct Hardware Design and Verification Methods
• Towards better heuristics for solving bounded model checking problems
• Distributed symbolic bounded property checking
• Bounded model checking with parametric data structures
• Distributing the workload in a lazy theorem-prover
• Computer Aided Verification

Uses Software

• PSATO
• SATO
• Chaff

This page was built for publication: Efficient distributed SAT and SAT-based distributed bounded model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897077)