Sciweavers

1760 search results - page 33 / 352
» Program Analysis Using Weighted Pushdown Systems
Sort
View
ECRTS
2002
IEEE
14 years 3 months ago
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
Most WCET analysis techniques only provide an upper bound on the worst case execution time as a constant value. However, it often appears that the execution time of a piece of cod...
Antoine Colin, Guillem Bernat
TSP
2008
121views more  TSP 2008»
13 years 10 months ago
Stochastic Analysis of the LMS Algorithm for System Identification With Subspace Inputs
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
Neil J. Bershad, José Carlos M. Bermudez, J...
ESOP
2010
Springer
14 years 8 months ago
Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs
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 and Martin Hofmann
CADE
2009
Springer
14 years 11 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
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