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
50
views
13
references
Top references
cited by
22
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
953
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Computer Aided Verification
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
other
Author(s):
Josh Berdine
,
Byron Cook
,
Dino Distefano
,
Peter W. O’Hearn
Publication date
(Print):
2006
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
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
Journal of Deliberate Democracy
Most cited references
13
Record
: found
Abstract
: not found
Book Chapter
: not found
A Complete Method for the Synthesis of Linear Ranking Functions
Andreas Podelski
,
Andrey Rybalchenko
(2004)
0
comments
Cited
68
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
Symbolic Execution with Separation Logic
Josh Berdine
,
Cristiano Calcagno
,
Peter O’Hearn
(2005)
0
comments
Cited
42
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2006
Pages
: 386-400
DOI:
10.1007/11817963_35
SO-VID:
68c9b6f0-db5e-4b63-9a4a-6efecf5166cc
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Formal Specifications on Industrial-Strength Code—From Myth to Reality
pp. 17
Antichains: A New Algorithm for Checking Universality of Finite Automata
pp. 31
Safraless Compositional Synthesis
pp. 45
Minimizing Generalized Büchi Automata
pp. 59
Ticc: A Tool for Interface Compatibility and Composition
pp. 63
FAST Extended Release
pp. 81
A Fast Linear-Arithmetic Solver for DPLL(T)
pp. 137
Using Statically Computed Invariants Inside the Predicate Abstraction and Refinement Loop
pp. 234
Symmetry Reduction for Probabilistic Model Checking
pp. 249
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
pp. 278
DiVinE – A Tool for Distributed Verification
pp. 286
Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions
pp. 300
Model Checking Multithreaded Programs with Asynchronous Atomic Methods
pp. 358
Repair of Boolean Programs with an Application to C
pp. 372
Termination of Integer Linear Programs
pp. 386
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
pp. 401
Termination Analysis with Calling Context Graphs
pp. 415
Terminator: Beyond Safety
pp. 419
CUTE and jCUTE: Concolic Unit Testing and Explicit Path Model-Checking Tools
pp. 452
Lookahead Widening
pp. 475
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
pp. 517
Programs with Lists Are Counter Automata
Similar content
953
MAZE: Towards automated heap feng shui
Authors:
Thermophilic heap leaching of a chalcopyrite concentrate
Authors:
D.G. Dixon
,
J. Petersen
The Position Heap of a Trie
Authors:
Yuto Nakashima
,
Tomohiro I
,
Shunsuke Inenaga
…
See all similar
Cited by
22
Comparison Under Abstraction for Verifying Linearizability
Authors:
Daphna Amit
,
Noam Rinetzky
,
Thomas Reps
…
A Generic Cyclic Theorem Prover
Authors:
James Brotherston
,
Nikos Gorogiannis
,
Rasmus L Petersen
Interprocedural Shape Analysis with Separated Heap Abstractions
Authors:
Alexey Gotsman
,
Josh Berdine
,
Byron Cook
See all cited by