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
51
views
28
references
Top references
cited by
15
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,262
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Static Analysis
On Solving Universally Quantified Horn Clauses
other
Author(s):
Nikolaj Bjørner
,
Ken McMillan
,
Andrey Rybalchenko
Publication date
(Print):
2013
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
ScienceOpen Research
Most cited references
28
Record
: found
Abstract
: not found
Article
: not found
Constraint logic programming: a survey
Joxan Jaffar
,
Michael Maher
(1994)
0
comments
Cited
104
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Lazy Abstraction with Interpolants
Kenneth McMillan
(2006)
0
comments
Cited
79
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Simplify: a theorem prover for program checking
David Detlefs
,
Greg Nelson
,
James Saxe
(2005)
0
comments
Cited
52
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2013
Pages
: 105-125
DOI:
10.1007/978-3-642-38856-9_8
SO-VID:
36ba2702-63d8-415b-93e5-a9c455bf557d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 84
Predicate Abstraction for Relaxed Memory Models
pp. 105
On Solving Universally Quantified Horn Clauses
Similar content
2,262
Patterns From a Signed Language Corpus: Clause-like Units in Auslan (Australian sign language).
Authors:
G HODGE
The Constitutional Property Clause and Immaterial Property Interests
Authors:
M Kellerman
The structure of complement clauses in Lunda
Authors:
Boniface Kawasha
See all similar
Cited by
15
The SeaHorn Verification Framework
Authors:
Arie Gurfinkel
,
Temesghen Kahsai
,
Anvesh Komuravelli
…
From Invariant Checking to Invariant Inference Using Randomized Search
Authors:
Rahul Sharma
,
Alex Aiken
VeriMAP: A Tool for Verifying Programs through Transformations
Authors:
Emanuele De Angelis
,
Fabio Fioravanti
,
Alberto Pettorossi
…
See all cited by