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
42
views
11
references
Top references
cited by
19
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,287
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Verification, Model Checking, and Abstract Interpretation
Termination of Polynomial Programs
other
Author(s):
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Publication date
(Print):
2005
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
11
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
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
George C. Necula
,
Scott McPeak
,
Shree P. Rahul
…
(2002)
0
comments
Cited
55
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Transition invariants
A. Podelski
,
A. Rybalchenko
(2004)
0
comments
Cited
37
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2005
Pages
: 113-129
DOI:
10.1007/978-3-540-30579-8_8
SO-VID:
c9a32c2e-766e-4454-a1c7-040bfdc7477d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 113
Termination of Polynomial Programs
pp. 147
Abstract Interpretation with Alien Expressions and Heap Structures
pp. 164
Shape Analysis by Predicate Abstraction
pp. 199
Purity and Side Effect Analysis for Java Programs
pp. 346
Information Flow Analysis for Java Bytecode
pp. 363
Cryptographic Protocol Analysis on Real C Code
pp. 413
Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives
Similar content
2,287
Permutation-invariant qudit codes from polynomials
Authors:
Yingkai Ouyang
Large-scale long terminal repeat insertions produced a significant set of novel transcripts in cotton
Authors:
Yan Yang
,
Xingpeng Wen
,
Zhiguo Wu
…
Caring for terminally Ill patients: the impact on oncologists
Authors:
Nagavalli Somasundaram
,
Halah Ibrahim
,
Ranitha Govindasamy
…
See all similar
Cited by
19
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
Authors:
Josh Berdine
,
Byron Cook
,
Dino Distefano
…
The Polyranking Principle
Authors:
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
Abstraction Refinement for Termination
Authors:
Byron Cook
,
Andreas Podelski
,
Andrey Rybalchenko
See all cited by