- Record: found
- Abstract: found
- Book Chapter: found
Foundations of Software Science and Computation Structures
Tight Worst-Case Bounds for Polynomial Loop Programs
other
Read this book at
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
Most cited references28
- Record: found
- Abstract: not found
- Book Chapter: not found
A Complete Method for the Synthesis of Linear Ranking Functions
Andreas Podelski, Andrey Rybalchenko (2004)
- Record: found
- Abstract: not found
- Article: not found
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
- Record: found
- Abstract: not found
- Article: not found
Factorization forests of finite height
Imre Simon (1990)