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
28
views
30
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
3,348
similar
All similar
Record
: found
Abstract
: found
Book Chapter
: found
Is Open Access
Tools and Algorithms for the Construction and Analysis of Systems
A Verified Implementation of the Bounded List Container
other
Author(s):
Raphaël Cauderlier
,
Mihaela Sighireanu
Publication date
(Online):
April 12 2018
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Download
XML
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
RWTH Aachen Physics Collection
Most cited references
30
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
Local Reasoning about Programs that Alter Data Structures
Peter O’Hearn
,
John Reynolds
,
Hongseok Yang
(2001)
0
comments
Cited
52
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
Shengchao Qin
,
Wei-Ngan Chin
,
Cristina David
…
(2012)
0
comments
Cited
31
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2018
Publication date (Online):
April 12 2018
Pages
: 172-189
DOI:
10.1007/978-3-319-89960-2_10
SO-VID:
ff9f0c37-5c93-4be7-949a-bef131c66168
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning
pp. 23
Efficient Verification of Imperative Programs Using Auto2
pp. 41
Frame Inference for Inductive Entailment Proofs in Separation Logic
pp. 61
Verified Model Checking of Timed Automata
pp. 81
Chain Reduction for Binary and Zero-Suppressed Decision Diagrams
pp. 99
CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving
pp. 115
Automatic Generation of Precise and Useful Commutativity Conditions
pp. 133
Bit-Vector Model Counting Using Statistical Estimation
pp. 155
Hoare Logics for Time Bounds
pp. 172
A Verified Implementation of the Bounded List Container
pp. 190
Automating Deductive Verification for Weak-Memory Programs
pp. 213
Property Checking Array Programs Using Loop Shrinking
pp. 232
Invariant Synthesis for Incomplete Verification Engines
pp. 251
Accelerating Syntax-Guided Invariant Synthesis
pp. 270
Daisy - Framework for Analysis and Optimization of Numerical Programs (Tool Paper)
pp. 291
Oink: An Implementation and Evaluation of Modern Parity Game Solvers
pp. 309
More Scalable LTL Model Checking via Discovering Design-Space Dependencies ($$D^{3}$$D3)
pp. 328
Generation of Minimum Tree-Like Witnesses for Existential CTL
pp. 344
From Natural Projection to Partial Model Checking and Back
pp. 365
ICE-Based Refinement Type Discovery for Higher-Order Functional Programs
pp. 385
Strategy Representation by Decision Trees in Reactive Synthesis
Similar content
3,348
Verifying Neural Networks with Mixed Integer Programming
Authors:
Russ Tedrake
,
Vincent Tjeng
Building and Verifying a Model for Mass Transfer and Reaction Kinetics of the Bunsen Reaction in the Iodine–Sulfur Process
Authors:
Ping Zhang
,
Laijun Wang
,
Songzhe Chen
…
Electrocardiographic criteria for the diagnosis of right ventricular hypertrophy verified at autopsy.
Authors:
P Pääkkö
,
H Lehtonen
,
S Sutinen
…
See all similar
Cited by
1
A Verified Implementation of the Bounded List Container
Authors:
Raphaël Cauderlier
,
Mihaela Sighireanu
See all cited by