Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
25
views
7
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,808
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Correct Hardware Design and Verification Methods
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
other
Author(s):
Ofer Shtrichman
Publication date
(Online):
August 24 2001
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Journal of Paleontological Techniques
Most cited references
7
Record
: found
Abstract
: not found
Article
: not found
A Computing Procedure for Quantification Theory
Martin Davis
,
Hilary Putnam
(1960)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
GRASP: a search algorithm for propositional satisfiability
J.P. Marques-Silva
,
K.A. Sakallah
(1999)
0
comments
Cited
126
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Checking Safety Properties Using Induction and a SAT-Solver
Mary Sheeran
,
Satnam Singh
,
Gunnar Stålmarck
(2000)
0
comments
Cited
30
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2001
Publication date (Online):
August 24 2001
Pages
: 58-70
DOI:
10.1007/3-540-44798-9_4
SO-VID:
0bd6dfbb-4f72-472f-bfb5-d04cb3117d55
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 58
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
pp. 179
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
Similar content
4,808
StructADMM: Achieving Ultrahigh Efficiency in Structured Pruning for DNNs.
Authors:
Tianyun Zhang
,
Shaokai Ye
,
Xiaoyu Feng
…
Effects of accession, spacing and pruning management on in-situ leaf litter decomposition of Jatropha curcas L. in Zambia
Authors:
Aklilu Negussie
,
Jeroen Degerickx
,
Lindsey Norgrove
…
Coverage-centric coreset selection for high pruning rates
Authors:
Zheng Haizhong
See all similar
Cited by
9
Temporal Induction by Incremental SAT Solving
Authors:
Niklas Een
,
Niklas Sörensson
On Solving the Partial MAX-SAT Problem
Authors:
Zhaohui Fu
,
Sharad Malik
A survey of recent advances in SAT-based formal verification
Authors:
Armin Biere
,
Mukul Prasad
,
Aarti Gupta
See all cited by