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
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-crg!lll-lcc!styx!twg-ap!amdahl!hplabs!ucbvax!HI-MULTICS.ARPA!SMiller
From: SMiller@HI-MULTICS.ARPA
Newsgroups: net.lang.ada
Subject: Ada semantic analysis
Message-ID: <860912233856.134674@HI-MULTICS.ARPA>
Date: Fri, 12-Sep-86 19:38:00 EDT
Article-I.D.: HI-MULTI.860912233856.134674
Posted: Fri Sep 12 19:38:00 1986
Date-Received: Mon, 15-Sep-86 02:30:40 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
List-Id: <comp.lang.ada>


I have a friend who is looking into building a tool that does static semantic
verification of Ada(tm) programs.  If you could help design this tool, what
sort of programming errors would you try to find ?  What sort of errors are
possible to find ?  Is this tool feasible, useful, practical, etc. ?
Pointers to other people working on things like this would be helpful.

Please reply to me, and I'll post a summary of responses.

Thanks.
          Scott Miller
          SMiller @ Hi-Multics