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=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,1ff5003422436e4
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1994-10-11 17:45:47 PST
Path: 
 bga.com!news.sprintlink.net!howland.reston.ans.net!swiss.ans.net!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Easily-Read C++?
Date: 11 Oct 1994 14:55:46 -0400
Organization: Courant Institute of Mathematical Sciences
Message-ID: <37en3i$sn7@gnat.cs.nyu.edu>
References: <371a3p$nos@gnat.cs.nyu.edu>
 <1994Oct7.153254.29848@swlvx2.msd.ray.com> <374uke$8mo@delphi.cs.ucla.edu>
 <37bno4$ko4@gnat.cs.nyu.edu> <37eej8$6ie@siberia.gatech.edu>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1994-10-11T14:55:46-04:00
List-Id: <comp.lang.ada>

John (Mills), I assume that you see from my previous post that the question
I posed is indeed a well defined one. I assumed that we are dealing with
a volatile variable here, since otherwise all bets are off of course in
the presence of concurrent access), but assuming the variable is atomic in
the Ada sense (something you can't specify in C, but you can in practice
count on, given a reasonable guess about the hardware and the compiler), 
there is still a fundamental question: how many reads are you allowed,
only 1, or are you allowed 2?