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.1 required=5.0 tests=BAYES_40,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,7a3aa57541148364,start
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-11-15 14:10:30 PST
Path: 
 nntp.gmd.de!xlink.net!howland.reston.ans.net!news.moneng.mei.com!uwm.edu!lll-winken.llnl.gov!ames!waikato!auckland.ac.nz!abstract.co.nz!abstract.co.nz!not-for-mail
From: craig@abstract.co.nz (Craig Anderson)
Newsgroups: comp.lang.ada
Subject: Ada 9X and deadlocks
Date: 16 Nov 1994 10:33:02 +1300
Organization: Abstract Technologies New Zealand Limited, Auckland
Message-ID: <3ab9ee$fhe@abstract.co.nz>
NNTP-Posting-Host: abstract.co.nz
Date: 1994-11-16T10:33:02+13:00
List-Id: <comp.lang.ada>

Hi.
How does one write multi-tasking Ada 9X programs with any reasonable
assurance of freedom from deadlock?  Should we expect to see robust
static deadlock analysis programs?  Are code coverage tools available
that would help in designing test cases to find deadlocks?  How would
we go about specifying a static locking order -- would we want to? --
and perhaps why wasn't this included in Ada 9X?  I guess you can assume
that real-time support isn't available or that an MP platform is being
used.

Thanks,
-Craig
-- 
Craig Anderson (craig@abstract.co.nz)
Abstract Technologies New Zealand Limited
Ada 9X: the language for the 90's; finger or mail ada@abstract.co.nz for info