From: JP Thornley <jpt@diphi.demon.co.uk>
Subject: WCET Analysis (was For GNAT People)
Date: 1996/08/03
Date: 1996-08-03T00:00:00+00:00 [thread overview]
Message-ID: <719669884wnr@diphi.demon.co.uk> (raw)
In-Reply-To: 320021F4.3A59@ee.ubc.ca
Greg Bond <bond@ee.ubc.ca> writes (talking about analysing code for
worst case execution times):
> Any approach I'm familiar with analyzes RTL, or byte code i.e.
> the result of compiling (completed) code.
How do these approaches deal with problems such as:-
semantically infeasible paths,
maximum loop iterations,
etc.
where you need information that isn't provided by the typical compiler?
I've used one tool that takes a rather crude approach to these, but
would be interested in experience of other tools.
Phil Thornley
--
------------------------------------------------------------------------
| JP Thornley EMail jpt@diphi.demon.co.uk |
------------------------------------------------------------------------
prev parent reply other threads:[~1996-08-03 0:00 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
1996-07-24 0:00 For GNAT People grt
1996-07-25 0:00 ` Frank Mueller
1996-07-31 0:00 ` Greg Bond
1996-08-03 0:00 ` JP Thornley [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox