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
22
views
8
references
Top references
cited by
20
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,451
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
other
Author(s):
Clark W. Barrett
,
David L. Dill
,
Aaron Stump
Publication date
(Online):
September 20 2002
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
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
Genome Engineering using CRISPR
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
Simplification by Cooperating Decision Procedures
Greg Nelson
,
Derek Oppen
(1979)
0
comments
Cited
102
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Test pattern generation using Boolean satisfiability
T. Larrabee
(1992)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Leonardo de Moura
,
Harald Rueß
,
Maria Sorea
(2002)
0
comments
Cited
22
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2002
Publication date (Online):
September 20 2002
Pages
: 236-249
DOI:
10.1007/3-540-45657-0_18
SO-VID:
26dc89bd-b450-485e-a112-ccb092615931
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 65
Symbolic Localization Reduction with Reconstruction Layering and Backtracking
pp. 17
The Quest for Efficient Boolean Satisfiability Solvers
pp. 58
Infinite Games and Verification
pp. 78
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
pp. 107
Liveness with (0,1, ∞)- Counter Abstraction
pp. 209
Deciding Separation Formulas with SAT
pp. 223
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
pp. 236
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
pp. 265
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
pp. 349
The AVISS Security Protocol Analysis Tool
pp. 365
The d/dt Tool for Verification of Hybrid Systems
pp. 414
Synchronous and Bidirectional Component Interfaces
pp. 428
Interface Compatibility Checking for Software Modules
pp. 442
Practical Methods for Proving Program Termination
pp. 485
Vacuum Cleaning CTL Formulae
pp. 500
CVC: A Cooperating Validity Checker
pp. 526
Temporal-Safety Proofs for Systems Code
pp. 539
Extrapolating Tree Transformations
pp. 555
Regular Tree Model Checking
pp. 610
Fair Simulation Minimization
Similar content
2,451
ScoreWrite: A guide to preparing for the new SAT essay
Authors:
Neither we are satisfied nor they”-users and provider’s perspective: a qualitative study of maternity care in secondary level public health facilities, Uttar Pradesh, India
Authors:
S Bhattacharyya
,
A. Issac
,
P Rajbangshi
…
Are multimodal travelers more satisfied with their lives? A study of accessibility and wellbeing in the Denver, Colorado metropolitan area
Authors:
Carrie Makarewicz
,
Jeremy Németh
See all similar
Cited by
20
DPLL(T): Fast Decision Procedures
Authors:
Harald Ganzinger
,
George Hagen
,
Robert Nieuwenhuis
…
Answer Set Programming Based on Propositional Satisfiability
Authors:
Marco Maratea
,
Yuliya Lierler
,
Enrico Giunchiglia
Satisfiability Modulo Theories
Authors:
Clark Barrett
,
Cesare Tinelli
See all cited by