47 search results - page 2 / 10 » Computing the Least Fixed Point of Positive Polynomial Syste... |
HYBRID
2010
Springer
14 years 4 days ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
APLAS
2005
ACM
13 years 11 months ago
2005
ACM
Many situations can be modeled as solutions of systems of simultaneous equations. If the functions of these equations monotonically increase in all bound variables, then the existe...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
SAS
1994
Springer
13 years 9 months ago
1994
Springer
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
CC
1999
Springer
13 years 9 months ago
1999
Springer
In processors that do not support floating-point instructions, using fixed-point arithmetic instead of floating-point emulation trades off computation accuracy for execution spe...