From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,ba6120170d8e7faf X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-12-05 09:29:13 PST Message-ID: <3C0E5927.5657963A@baesystems.com> Date: Wed, 05 Dec 2001 17:28:07 +0000 From: Stuart Palin Organization: BAE SYSTEMS Avionics, Rochester X-Mailer: Mozilla 4.5 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 Newsgroups: comp.lang.ada Subject: Re: Worst Case Execution Time Tool? References: <3C0D536C.2E059EE8@computer.org> <0CdP7.48989$xS6.81382@www.newsranger.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit NNTP-Posting-Host: rc2966.rochstr.gmav.gecm.com X-Trace: 5 Dec 2001 17:29:03 GMT, rc2966.rochstr.gmav.gecm.com Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news.tele.dk!small.news.tele.dk!212.74.64.35!colt.net!newspeer.clara.net!news.clara.net!news-hub.cableinet.net!blueyonder!btnet-peer!btnet-peer0!btnet-peer1!btnet-feed5!btnet!newreader.ukcore.bt.net!pull.gecm.com!rc2966.rochstr.gmav.gecm.com Xref: archiver1.google.com comp.lang.ada:17458 Date: 2001-12-05T17:28:07+00:00 List-Id: Ted Dennison wrote: > In article <3C0D536C.2E059EE8@computer.org>, StationSteve says... > >Are there any tools that quantitatively determine the worst case > >execution time (WCET) of an Ada83 program or subprogram? > Wouldn't such a tool also be able to solve the Halting Problem? ( > http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?query=halting+problem ) No! If a WCET tool was developed on general terms with the intention of dealing with all forms of program, then it is most likely that if a non-terminating program was submitted for analysis the analysis itself would not halt. In more practical terms, this type of tool will typically constrain the types of program that it will analyze. Typically this might prohibit recursion and demand upper limits for loops to be statically determinable (either from the code or from annotations). Such rarified problems as the Halting Problem are hardly a consideration. -- Stuart Palin Principal Software Engineer BAE SYSTEMS Avionics Ltd, Rochester G-NET 791 3364 mailto:stuart.palin@baesystems.com