Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cwjcc!gatech!uflorida!stat!stat.fsu.edu!mccalpin
From: mccalpin@masig3.ocean.fsu.edu (John D. McCalpin)
Newsgroups: comp.lang.fortran
Subject: Re: Scope of intrinsics
Message-ID: 
Date: 16 Aug 89 12:59:48 GMT
References: <1989Aug8.232014.9265@agate.berkeley.edu> <603@mbph.UUCP>
	<1397@bnlux0.bnl.gov> <2847@cbnewsm.ATT.COM>
Sender: news@stat.fsu.edu
Organization: Supercomputer Computations Research Institute
Lines: 19
In-reply-to: cdm@mhgya.att.com's message of 16 Aug 89 09:35:20 GMT

In message <2847...> cdm@mhgya.ATT.COM (45266-mclaughlin, charles d) writes:

>....  For that reason, the PFORT approach was to use the compiler itself
>as the definition of the language for any given machine and look for a common
>subset of compiler-accepted constructs that produced the same results on the
>class of machines of interest.  So far as I know, no one has taken that
>approach to develop a comparable verifier for Fortran-77.

There is a FORTRAN-77 portability verifier in TOOLPACK that I have
used to find a (distressingly) large number of unportable things in my
codes.

Unfortunately, TOOLPACK has trouble with even moderately large codes
(my 7500 line code breaks it regularly).  Splitting the code into
sections works fine for some tests, but disables the interprocedural
argument checking that I find the most useful test of the tool....
--
John D. McCalpin - mccalpin@masig1.ocean.fsu.edu - mccalpin@nu.cs.fsu.edu
		   mccalpin@delocn.udel.edu