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
38
views
10
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,016
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
From Object-Orientation to Formal Methods
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution
other
Author(s):
Jera Hensel
,
Jürgen Giesl
,
Florian Frohn
,
Thomas Ströder
Publication date
(Online):
June 23 2016
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
10
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
Record
: found
Abstract
: not found
Conference Proceedings
: not found
LLVM: A compilation framework for lifelong program analysis & transformation
V. Adve
,
C. Lattner
(2024)
0
comments
Cited
67
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Proving Termination of Programs Automatically with AProVE
Jürgen Giesl
,
Marc Brockschmidt
,
Fabian Emmes
…
(2014)
0
comments
Cited
18
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
June 23 2016
Pages
: 234-252
DOI:
10.1007/978-3-319-41591-8_16
SO-VID:
e6f18c67-da0e-4885-8332-3d1bc29c8604
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 26
An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language
pp. 50
Experiments in German Treebank Parsing
pp. 83
An English-to-Turkish Interlingual MT System
pp. 125
Efficient Execution of Aggregation Queries over Encrypted Relational Databases
pp. 160
Mild Dementia Care at Home – Integrating Activity Monitoring, User Interface Plasticity and Scenario Verification
pp. 230
Size Matters! How Thumbnail Number, Size, and Motion Influence Mobile Video Retrieval
pp. 234
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution
pp. 517
Hadoop Massive Small File Merging Technology Based on Visiting Hot-Spot and Associated File Optimization
pp. 601
Sentic Medoids: Organizing Affective Common Sense Knowledge in a Multi-Dimensional Vector Space
Similar content
4,016
AI isn’t science fiction: it’s digital design’s reality deep learning proves effective in designing crowns
Authors:
M. TRAN
Towards Automated Functional Equation Proving: A Benchmark Dataset and A Domain-Specific In-Context Agent
Authors:
Mahdi Buali
,
Robert Hoehndorf
On the arithmetic complexity of computing Gr\"obner bases of comaximal determinantal ideals
Authors:
Sriram Gopalakrishnan
See all similar
Cited by
2
Analyzing Program Termination and Complexity Automatically with AProVE
Authors:
Jürgen Giesl
,
Cornelius Aschermann
,
Marc Brockschmidt
…
Symbolic Liveness Analysis of Real-World Software
Authors:
Daniel Schemmel
,
Julian Büning
,
Oscar Soria Dustmann
…
See all cited by