Sciweavers

5863 search results - page 157 / 1173
» Calculating Functional Programs
Sort
View
WCET
2003
15 years 6 months ago
Fully Automatic, Parametric Worst-Case Execution Time Analysis
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
Björn Lisper
146
Voted
WCET
2007
15 years 6 months ago
Data-Flow Based Detection of Loop Bounds
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
Christoph Cullmann, Florian Martin
177
Voted
BMCBI
2006
175views more  BMCBI 2006»
15 years 5 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
FLOPS
2006
Springer
15 years 8 months ago
Crossing State Lines: Adapting Object-Oriented Frameworks to Functional Reactive Languages
Functional reactive programming integrates dynamic dataflow with functional programming to offer an elegant and powerful model for expressing computations over time-varying values....
Daniel Ignatoff, Gregory H. Cooper, Shriram Krishn...
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 5 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...