ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
23
views
19
references
Top references
cited by
1
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,459
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Deduction – CADE 26
Scalable Fine-Grained Proofs for Formula Processing
other
Author(s):
Haniel Barbosa
,
Jasmin Christian Blanchette
,
Pascal Fontaine
Publication date
(Online):
July 11 2017
Publisher:
Springer International Publishing
Read this book at
Publisher
Further versions
oa repository (via OAI-PMH doi match)
oa repository (via OAI-PMH doi match)
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
International Polymer Processing
Most cited references
19
Record
: found
Abstract
: not found
Book
: not found
Isabelle/HOL
Tobias Nipkow
,
Markus Wenzel
,
Lawrence Paulson
(2002)
0
comments
Cited
198
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Edinburgh LCF
Michael J. C. Gordon
,
Arthur Milner
,
Christopher Wadsworth
(1979)
0
comments
Cited
89
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
First-Order Theorem Proving and Vampire
Laura Kovacs
,
Andrei Voronkov
(2013)
0
comments
Cited
40
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
: 398-412
DOI:
10.1007/978-3-319-63046-5_25
SO-VID:
cd151f9e-ea55-42b6-8892-f7c29cd79423
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
1,459
A database for fine grained activity detection of cooking activities
Authors:
M. Rohrbach
,
B. Schiele
,
M. Andriluka
…
CherryChèvre: A fine-grained dataset for goat detection in natural environments
Authors:
Jehan-Antoine Vayssade
,
Rémy Arquet
,
Willy Troupe
…
HiVG: Hierarchical Multimodal Fine-grained Modulation for Visual Grounding
Authors:
Linhui Xiao
,
Xiaoshan Yang
,
Fang Peng
…
See all similar
Cited by
1
Language and Proofs for Higher-Order SMT (Work in Progress)
Authors:
Jasmin Christian Blanchette
,
Pascal Fontaine
,
Daniel Ouraoui
…
See all cited by