OpenAlex
PricingAboutJobs
Log inGet started
Work

Pruning Techniques for the SAT-Based Bounded Model Checking Problem

HTML

Year: 2001
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Correct Hardware Design and Verification Methods: 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001 Livingston, Scotland, UK, September 4–7, 2001 Proceedings
DOI: 10.1007/3-540-44798-9_4
Author: Ofer Shtrichman
Institutions: IBM Research - Haifa, Weizmann Institute of Science
Language: English

Topic: Formal Methods in Verification
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: bounded model checking, SAT-based verification, pruning techniques, search space reduction, temporal features, verification time reduction

Open Access status: closed
OpenAlex ID: W2107470986
FWCI: 2.479
Cites: 15
Cited by: 159
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security