From: Niklas Holsti on
No-cost downloads of size-limited versions of the Bound-T static WCET
and stack-usage analyser are now offered on the Bound-T website at
http://www.bound-t.com/.

Bound-T applies static program analysis to the machine code of
executable binary files to compute upper bounds on the worst-case
execution time (WCET) and the worst-case stack usage of selected
subprograms. The results are useful for verifying that real-time
programs are schedulable and do not fail due to stack overflow.

Bound-T is now available for the target processors Intel-8051, Atmel
AVR, ARM7TDMI, ERC32 (SPARC V7), Renesas H8/300, and ADSP-21020.

Bound-T can be used on Intel/Linux, Intel/MS-Windows, and Mac OS/X host
PCs. The website offers downloads for the first two hosts. Bound-T for
the Mac will be provided on request.

Bound-T analyses the target program by reading and decoding binary
instructions from the executable file; building the control-flow graphs
and call graph; modelling the computation to find bounds on the number
of iterations of (some) loops and bounds on the stack usage; and finally
computing an upper bound on the execution time with Integer Linear
Programming (the Implicit Path Enumeration technique). At present, WCET
analysis in Bound-T works for processors with fixed, deterministic
instruction execution times. Pipeline effects are modelled, but caches
and other dynamic accelerators are not.

The no-cost downloadable versions are limited to about 1000 instructions
per analysis. The total size of the target program is not limited. The
no-cost versions are offered under a liberal licence
(http://www.bound-t.com/download/tr-li-no-cost.pdf) that allows any kind
of use, including commercial use.

On behalf of Tidorum Ltd, the developer of Bound-T, I hope that you will
find the tool useful. While the no-cost versions of course do not
include a promise of technical support, Tidorum welcomes all feedback on
Bound-T and will respond within our resources.

--
Niklas Holsti
Tidorum Ltd
niklas holsti tidorum fi
. @ .