Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
48
views
25
references
Top references
cited by
6
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,889
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Deduction – CADE 26
Efficient Verified (UN)SAT Certificate Checking
other
Author(s):
Peter Lammich
Publication date
(Online):
July 11 2017
Publisher:
Springer International Publishing
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
ScienceOpen Research
Most cited references
25
Record
: found
Abstract
: not found
Article
: not found
Program development by stepwise refinement
Niklaus Wirth
(1971)
0
comments
Cited
81
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Refinement Calculus
Ralph-Johan Back
,
Joakim Wright
(1998)
0
comments
Cited
55
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Extending SAT Solvers to Cryptographic Problems
Mate Soos
,
Karsten Nohl
,
Claude Castelluccia
(2009)
0
comments
Cited
31
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
July 11 2017
Pages
: 237-254
DOI:
10.1007/978-3-319-63046-5_15
SO-VID:
30f0db14-fe83-4ae6-9eed-8861796444d6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Reasoning About Concurrency in High-Assurance, High-Performance Software Systems
pp. 8
Towards Logic-Based Verification of JavaScript Programs
pp. 42
Satisfiability Modulo Theories and Assignments
pp. 60
Notions of Knowledge in Combinations of Theories Sharing Constructors
pp. 77
On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic
pp. 95
Satisfiability Modulo Transcendental Functions via Incremental Linearization
pp. 114
Satisfiability Modulo Bounded Checking
pp. 130
Short Proofs Without New Variables
pp. 148
Relational Constraint Solving in SMT
pp. 166
Decision Procedures for Theories of Sets with Measures
pp. 185
A Decision Procedure for Restricted Intensional Sets
pp. 202
Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints
pp. 220
Efficient Certified RAT Verification
pp. 237
Efficient Verified (UN)SAT Certificate Checking
pp. 255
Translating Between Implicit and Explicit Versions of Proof
pp. 274
A Unifying Principle for Clause Elimination in First-Order Logic
pp. 291
Splitting Proofs for Interpolation
pp. 310
Detecting Inconsistencies in Large First-Order Knowledge Bases
pp. 326
Theorem Proving for Metric Temporal Logic over the Naturals
pp. 344
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
pp. 357
WorkflowFM: A Logic-Based Framework for Formal Process Specification and Composition
pp. 371
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL
pp. 385
CSI: New Evidence – A Progress Report
pp. 398
Scalable Fine-Grained Proofs for Formula Processing
pp. 413
Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems
pp. 432
A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms
pp. 454
Certifying Safety and Termination Proofs for Integer Transition Systems
pp. 472
Biabduction (and Related Problems) in Array Separation Logic
pp. 491
Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof
pp. 509
Satisfiability of Compositional Separation Logic with Tree Predicates and Data Constraints
pp. 528
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
pp. 546
The Binomial Pricing Model in Finance: A Formalization in Isabelle
pp. 563
Monte Carlo Tableau Proof Search
Similar content
5,889
van der Waals PtO2/MoS2 heterostructure verified from first principles
Authors:
Junlin Li
,
Sheng-Yi Xie
Verifying the identity of high-redshift massive galaxies through the clustering of lower mass galaxies around them
Authors:
Joseph Muñoz
,
Abraham Loeb
Verifying likelihoods for low template DNA profiles using multiple replicates
Authors:
Christopher D Steele
,
Matthew Greenhalgh
,
David Balding
See all similar
Cited by
5
Efficient Certified RAT Verification
Authors:
Luís Cruz-Filipe
,
Marijn Heule
,
Warren A. Hunt
…
What a Difference a Variable Makes
Authors:
Marijn Heule
,
Armin Biere
From LCF to Isabelle/HOL
Authors:
Lawrence Paulson
,
Tobias Nipkow
,
Makarius Wenzel
See all cited by