comp.lang.ada
 help / color / mirror / Atom feed
From: mfeldman@seas.gwu.edu (Michael Feldman)
Subject: Re: LRM question - access types and con
Date: 29 Jun 90 03:51:37 GMT	[thread overview]
Message-ID: <1996@sparko.gwu.edu> (raw)
In-Reply-To: 20600054@inmet

In article <20600054@inmet> stt@inmet.inmet.com writes:
 >
 >Re: Allocators and tasking.
 >
 >The programmer need only worry about declared variables which are shared
 >between tasks.  An access collection is not considered an explicitly
 >declared variable in this sense.
 >
 >The implementation must worry about all "hidden" shared data.
 >
 >Therefore, an implementation must protect its run-time data structures
 >from simultaneous access.
This comes as very good news. Is there an AI that governs it, or is it
part of the folklore somewhere? Is it tested in the ACVC?

  parent reply	other threads:[~1990-06-29  3:51 UTC|newest]

Thread overview: 6+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
     [not found] <1394@software.software.org>
1990-06-27 15:53 ` LRM question - access types and con stt
1990-06-28 13:34   ` Jerry Callen
1990-06-29 21:55     ` Charles H. Sampson
1990-06-29  3:51   ` Michael Feldman [this message]
1990-06-29 13:25     ` Vinod Grover
1990-06-29 17:30       ` Michael Feldman
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox