Sciweavers

1204 search results - page 40 / 241
» Termination of Polynomial Programs
Sort
View
AC
2000
Springer
14 years 3 months ago
Operational Semantics and Program Equivalence
This tutorial paper discusses a particular style of operational semantics that enables one to give a ‘syntax-directed’ inductive definition of termination which is very useful...
Andrew M. Pitts
ARC
2008
Springer
85views Hardware» more  ARC 2008»
13 years 11 months ago
Dynamic programming for impulse controls
: This paper describes the theory of feedback control in the class inputs which allow delta-functions and their derivatives. It indicates a modification of dynamic programming tech...
Alexander B. Kurzhanski, Alexander N. Daryin
FSTTCS
2009
Springer
14 years 5 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
CONCUR
2006
Springer
14 years 2 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
ESOP
2010
Springer
14 years 5 months ago
Amortized Resource Analysis with Polynomial Potential
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs....
Jan Hoffmann 0002, Martin Hofmann