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=unavailable autolearn_force=no version=3.4.4
Path: 
 eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!.POSTED!not-for-mail
From: Paul Rubin <no.email@nospam.invalid>
Newsgroups: comp.lang.ada
Subject: Re: Languages don't  matter.  A mathematical refutation
Date: Fri, 03 Apr 2015 20:05:01 -0700
Organization: A noiseless patient Spider
Message-ID: <877fts7fvm.fsf@jester.gateway.sonic.net>
References: <b3592526-729a-4198-a630-696542b3f3be@googlegroups.com>
	<87h9t95cly.fsf@jester.gateway.sonic.net>
	<04f0759d-0377-4408-a141-6ad178f055ed@googlegroups.com>
	<mfkt8l$u4j$1@dont-email.me> <871tk1z62n.fsf@theworld.com>
	<w19y3129v8q1.jkn83uwyte4p$.dlg@40tude.net>
	<87oan56rpn.fsf@jester.gateway.sonic.net>
	<ojcuhapfmqleoec1r4fu7ierr3p85in78r@4ax.com>
Mime-Version: 1.0
Content-Type: text/plain
Injection-Info: mx02.eternal-september.org;
 posting-host="c694756f1077760bb5296aae16c74092";
	logging-data="3751"; mail-complaints-to="abuse@eternal-september.org";
	posting-account="U2FsdGVkX1+e3fYuPjnqaHkZW+X4qoaE"
User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/24.3 (gnu/linux)
Cancel-Lock: sha1:Yy4+vjz97dsYHHJ83okQhb/lBNY=
	sha1:eKXsY4Buga0olryl4MURc/dtXe8=
Xref: news.eternal-september.org comp.lang.ada:25412
Date: 2015-04-03T20:05:01-07:00
List-Id: <comp.lang.ada>

Dennis Lee Bieber <wlfraed@ix.netcom.com> writes:
> 	Yet that is also the feature that tends to keep it from the realms I'm
> currently working in... Avionics tend to use a scheme in which all heap
> allocation is done during an initialization phase (pre-allocating queue
> entries, for example), and NO memory allocation/freeing is performed once
> the system transitions to "operational".

How big and complicated do those programs tend to be, if you don't mind
my asking?  Do they have a lot of complex decision paths?

I know that Galois.com does some critical systems (probably not
avionics) in Haskell, which allocates like crazy and is garbage
collected, but deals with complicated algorithms exceptionally well.  I
don't know what safeguards (other than testing) they use to ensure the
absence of memory leaks.