Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Journals
Archaeology International
Architecture_MPS
Europe and the World: A law review
Film Education Journal
History Education Research Journal
International Journal of Development Education and Global Learning
International Journal of Social Pedagogy
Jewish Historical Studies: A Journal of English-Speaking Jewry
Journal of Bentham Studies
London Review of Education
Radical Americas
Research for All
The Journal of the Sylvia Townsend Warner Society
The London Journal of Canadian Studies
About
About UCL Press
Who we are
Contact us
My ScienceOpen
Sign in
Register
Dashboard
Search
49
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
4,421
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
4,421
Exploiting Partial Runtime Reconfiguration for High-Performance Reconfigurable Computing
Authors:
Tarek El-Ghazawi
,
Iván González
,
Esam El-Araby
A Tool for Optimizing Runtime Parameters of Open MPI
Authors:
Mohamad Chaarawi
,
Jeffrey M. Squyres
,
Edgar Gabriel
…
Is integer arithmetic fundamental to mental processing?: the mind's secret arithmetic.
Authors:
Shane Snyder
,
Elizabeth D Mitchell
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