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
37
views
16
references
Top references
cited by
18
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,341
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Deduction – CADE-23
Automated Cyclic Entailment Proofs in Separation Logic
other
Author(s):
James Brotherston
,
Dino Distefano
,
Rasmus Lerchedahl Petersen
Publication date
(Print):
2011
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
16
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Separation logic: a logic for shared mutable data structures
J.C. Reynolds
(2024)
0
comments
Cited
81
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A Local Shape Analysis Based on Separation Logic
Dino Distefano
,
Peter O’Hearn
,
Hongseok Yang
(2006)
0
comments
Cited
44
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Scalable Shape Analysis for Systems Code
Hongseok Yang
,
Oukseh Lee
,
Josh Berdine
…
(2008)
0
comments
Cited
32
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 131-146
DOI:
10.1007/978-3-642-22438-6_12
SO-VID:
4e4de174-5b19-4bb8-b37c-8e869b021cf0
License:
http://www.springer.com/tdm
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 162
Experimenting with Deduction Modulo
pp. 101
Blocked Clause Elimination for QBF
pp. 116
Extending Sledgehammer with SMT Solvers
pp. 131
Automated Cyclic Entailment Proofs in Separation Logic
pp. 192
Optimized Query Rewriting for OWL 2 QL
pp. 207
Sort It Out with Monotonicity
pp. 476
An Efficient Decision Procedure for Imperative Tree Data Structures
pp. 499
CSI – A Confluence Tool
Similar content
2,341
Explaining Answers with Entailment Trees
Authors:
Bhavana Dalvi
,
Peter G. Jansen
,
Oyvind Tafjord
…
Does doxastic responsibility entail the ability to believe otherwise?
Authors:
R Peels
,
Rik Peels
Temporal interpretation, discourse relations and commonsense entailment
Authors:
Alex Lascarides
,
Nicholas Asher
See all similar
Cited by
18
A Generic Cyclic Theorem Prover
Authors:
James Brotherston
,
Nikos Gorogiannis
,
Rasmus L Petersen
On Automated Lemma Generation for Separation Logic with Inductive Definitions
Authors:
Constantin Enea
,
Mihaela Sighireanu
,
Zhilin Wu
Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
Authors:
Stefano Berardi
,
Makoto Tatsuta
See all cited by