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
21
views
57
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
2,100
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Automating Induction for Solving Horn Clauses
other
Author(s):
Hiroshi Unno
,
Sho Torii
,
Hiroki Sakamoto
Publication date
(Online):
July 13 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
57
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Abstract interpretation
Patrick Cousot
,
Radhia Cousot
(1977)
0
comments
Cited
364
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Isabelle/HOL
Tobias Nipkow
,
Markus Wenzel
,
Lawrence Paulson
(2002)
0
comments
Cited
199
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Z3: An Efficient SMT Solver
Leonardo de Moura
,
Nikolaj Bjørner
(2008)
0
comments
Cited
132
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2017
Publication date (Online):
July 13 2017
Pages
: 571-591
DOI:
10.1007/978-3-319-63390-9_30
SO-VID:
fba3f794-655e-4e2d-bde8-2619af527350
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Verified Compilation of Space-Efficient Reversible Circuits
pp. 217
Cutoff Bounds for Consensus Algorithms
pp. 571
Automating Induction for Solving Horn Clauses
pp. 126
SMTCoq: A Plug-In for Integrating SMT Solvers into Coq
pp. 325
BoSy: An Experimentation Framework for Bounded Synthesis
pp. 453
Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification
pp. 592
A Storm is Coming: A Modern Probabilistic Model Checker
Similar content
2,100
Adopting academic values: Student use of that-complement clauses in academic writing
Authors:
Jean Parkinson
Exploring and explaining the “Santa Claus effect”: cross-sectional study of jollity in 21 European countries
Authors:
Brendan Kelly
Effects of contrastive focus on prosodic cues to clause boundaries
Authors:
AJ Schafer
,
SA Jun
See all similar
Cited by
6
Automating Induction for Solving Horn Clauses
Authors:
Hiroshi Unno
,
Sho Torii
,
Hiroki Sakamoto
Relational Verification via Invariant-Guided Synchronization
Authors:
Qi Zhou
,
David G Heath
,
William Harris
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
Authors:
Emanuele De Angelis
,
Fabio Fioravanti
,
Alberto Pettorossi
…
See all cited by