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
39
views
18
references
Top references
cited by
8
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
5,460
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Automated Reasoning
Lower Runtime Bounds for Integer Programs
other
Author(s):
F. Frohn
,
M. Naaf
,
J. Hensel
,
M. Brockschmidt
,
J. Giesl
Publication date
(Online):
June 12 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
18
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
Apron: A Library of Numerical Abstract Domains for Static Analysis
Bertrand Jeannet
,
Antoine Miné
(2009)
0
comments
Cited
45
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Linear Ranking with Reachability
Aaron R. Bradley
,
Zohar Manna
,
Henny B. Sipma
(2005)
0
comments
Cited
35
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2016
Publication date (Online):
June 12 2016
Pages
: 550-567
DOI:
10.1007/978-3-319-40229-1_37
SO-VID:
185f6eba-46b7-4dac-aa5c-91db2cce165b
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 362
Effective Normalization Techniques for HOL
pp. 133
Model Finding for Recursive Functions in SMT
pp. 293
System Description: GAPT 2.0
pp. 550
Lower Runtime Bounds for Integer Programs
Similar content
5,460
Verifying Neural Networks with Mixed Integer Programming
Authors:
Russ Tedrake
,
Vincent Tjeng
Evaluating Ising Processing Units with Integer Programming
Authors:
Carleton Coffrin
,
Harsha Nagarajan
,
Russell Bent
Integer Programming
Authors:
Laurence A. Wolsey
,
LA WOLSEY
,
LA Wolsey
See all similar
Cited by
8
Analyzing Program Termination and Complexity Automatically with AProVE
Authors:
Jürgen Giesl
,
Cornelius Aschermann
,
Marc Brockschmidt
…
How long, O Bayesian network, will I sample thee?
Authors:
Kevin Batz
,
Benjamin Kaminski
,
Joost-Pieter Katoen
…
Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations
Authors:
Antonio Flores-Montoya
See all cited by