comp.lang.ada
 help / color / mirror / Atom feed
* Ada Test Tools
@ 1987-07-07 16:47 Lee McLoughlin
  1987-07-13 23:07 ` Eric Beser sys admin
  0 siblings, 1 reply; 21+ messages in thread
From: Lee McLoughlin @ 1987-07-07 16:47 UTC (permalink / raw)


[[RELAYED ON BEHALF OF anton@ist.co.uk - please reply directly to him.]]

Can anybody help me please ?

I am interested in commercially available test harnesses or coverage monitors
for Ada. Idealy, what I am after is something that is reasonably portable and
not too compiler specific.

If anyone knows of such things, then I would be most grateful to receive
details.

Thank you.

	 Anton Gibbs
	 Imperial Software Technology



E-mail:    anton@ist.co.uk or anton@ist.uucp
Telephone: +44 1 581 8155
Telex:     928476 istech g

Surface:   Imperial Software Technology Ltd.,
	   60 Albert Court,
	   Prince Consort Rd.,
	   London SW7 2BH
	   ENGLAND

==========================================================


----- End of forwarded messages

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada Test Tools
  1987-07-07 16:47 Lee McLoughlin
@ 1987-07-13 23:07 ` Eric Beser sys admin
  0 siblings, 0 replies; 21+ messages in thread
From: Eric Beser sys admin @ 1987-07-13 23:07 UTC (permalink / raw)



The one test tool that we are using is the software analysis
workstation by Northwest Instruments. It is a logic analyzer for
the software engineer.

To call it a logic analyzer may be a bit unfair. It passively sits
on the processor and does monitor the logic states of the machine.
This device connects to the IBM PC/XT or AT by a parallel port that
is memory mapped into the system. Using the Gem operating system
by Digital Research (mouse, etc) it can monitor up to two processors.

It will take the symbol table output of a linker and use the symbols
for software analysis. We are using this tool to integrate the Telesoft
Ada Compiler with a comercial operating system on a distributed
68020 platform. As many of you know, the highest area of risk in this
venture is to solve the intricate timing problems involved with the Ada
RTE, hardware and application code. Because the analysis is symbolic
you get to see what portions of code execute, how much time it takes
to get through a procedure, the percentage of time spent in the RTE,
how interrupts are being serviced and dealt with in the RTE. It provides
2167 spec code coverage to validate the test procedures.

The only requirement for use is that the compiler puts out a symbol map
with enough symbols to do the job. Northwest Instruments supports their
own format, and the Unix Namelist (COFF). We have adapted the map
output of the Telesoft Linker, our own 1750A ada compiler, and various
Jovial compilers. It works well with C too (but we don't talk about
languages that ruin you as software engineers).

We have done a comparison study between the Software Analysis Workstation
and Hewlet Packard's 64000 workstation. Both are good. NWIS beats HP
on price and in many areas on performance as well. HP does statistical
analysis. With NWIS, you can time and size a program with one execution
of the program. 

Eric Beser
Westinghouse DEC
EBESER@ADA20   (arpa)
{seismo,mimsy}aplcen!cp1!sarin!eric  (usenet)

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Ada Test Tools
@ 1991-01-31 20:37 Johan Margono
  0 siblings, 0 replies; 21+ messages in thread
From: Johan Margono @ 1991-01-31 20:37 UTC (permalink / raw)


I am the process of trying to locate possible testing tools to assist in
testing of Ada software. Some of my considerations are:

    1. The platforms that we are using...
          a. Rationals;
          b. MVS on IBM 3090s running TeleSoft Ada;
          c. AIX on IBM RS6000 running TeleSoft/OCS Ada.

    2. The greatest need is for Test Driver generators. A tool that will
       read in an Ada specification and generate an Ada program (with a
       user interface) that will allow a "tester" to call all operations
       and test exceptions, using his/her test cases.

    3. Test Case/Scenario generation tools would be nice.  Possible
       methods could include branch testing, McCabe's basis path method,
       and black-box testing (equivalence class partitioning and
       boundary analysis).

    4. Test tracking tools would be nice. Some tools assume an 'ad hoc'
       method for test case generation, and show branch coverage (so you
       can try a few more cases). Assuming a structured testing
       approach, this tracking does not seem very valuable.  However,
       tracking as a support for Regression Testing would be very
       helpful.

    5. Also related to (4), support for black-box testing of multiple
       instantiations of generics would be helpful (i.e., reuse of
       testing plans and test cases).

    6. Also related to (4) and (5), support for (at least) black-box
       testing of modules (generic/non-generic) on multiple platforms
       (rerunning all, or a subset, of the tests for each target).

    7. Many of the tools I have l looked at, depend on instrumentation
       of the code for test tracking, and possibly test generation.
       Since, instrumentation changes the 'code,' the load module, and
       thus behavior, this method is NOT preferred (it also becomes a
       maintenance headache). Non-intrusive methods are preferred!

    8. We are also restrained by 2167 (not A)!


I have collected information about several tools, but I am interested in
information on:
    1. additional tools not listed below,
    2. evaluations ("consumer reports") on any of the tools (listed or
       appended),
    3. (real) project experience on testing LARGE Ada systems, and the
       tools and techniques that helped/hindered.


----------------------- Current Testing Tool List ------------------------

1. Rational - public domain test driver generator which uses the
         Rational DIANA tree (available from the Rational Catalog). Need
         to check if the test drivers are portable to other platforms.
 
2. Nokia - (From Finland.)  TBGEN and TCMON; will run on the RAT and
         PCs.
 
3. Software Systems Design - TestGen does not have a driver generator.
         The test case generator is written in C so it won't run on the
         Rational.
 
4. McCabe Associates - no test driver, but other nice tools. I don't
         know if it will run on our platforms.

5. Intermetrics - Ada Test Support Tool (ATST) is public domain. It has a
          test driver, but only runs on VAX/VMS/ACS and PC/DOC/Alsys. It
          seems to only support black-box testing.
 
6. General Research Corporation - AdaQuest, was the Ada Test and
          Verification System (ATVS). Only VAX/VMS, with a UNIX platform
          later this year.
 
7. Glazier Electronics - The Automated Real-time Regression Testing
          system (ARRT). Only on VAX, only run time testing.
 
8. CISI Engineering - (From France) was a research project, that was not
          "productized"

--------------------- End Current Testing Tool List ---------------------


Snailmail: Gregory M. Bowen, Reuse Group
           Computer Sciences Corporation
           Advanced Automated System
           15245 Shady Grove Road
           Rockville, Maryland, 20850    USA

Phone:     301.921.3018
FAX:       301.840.8934
AdaNET ID: gbowen
Internet:  margono@grebyn.com   or  gbowen%ceo@asv2.wvnet.edu

^ permalink raw reply	[flat|nested] 21+ messages in thread

* RE: Ada Test Tools
@ 1991-02-07 20:26 Bill Brykczynski
  0 siblings, 0 replies; 21+ messages in thread
From: Bill Brykczynski @ 1991-02-07 20:26 UTC (permalink / raw)



The following is in response to a recent request for information
regarding tools to assist in the testing of Ada software.  We are just
beginning to collect such information.  In the future, we may be doing
an evaluation of several of these tools.  This information is not
currently not complete, but may still be of use.

We are not recommending any of these tools, we are simply collecting
information on them.  If you have additional information on these or
other tools, experience with such tools, etc., please let us know.
As you can see, some of the information is skimpy.

Bill Brykczynski
Institute for Defense Analyses
1801 N. Beauregard St.
Alexandria, VA 22311
703-845-6641
bryk@ida.org 
--------------
                                     - 1 - 
 
 
 
          Alsys, Inc. 
 
                    Tool:          AdaTune, AdaProbe 
                    Contact:       Lori Heyman (617) 270-0030 
                                   One Burlington Business Center 
                                   67 South Bedford Street, Burlington,  MA 
                                   01803-5152 
 
          Application Development System, Inc. 
 
                    Tool:          XPEDITER (Test Driver) 
                    Contact:       E.F. Harris 
                                   1530 Meridian Avenue, San Jose, CA 95125 
 
          Cadre Technologies 
 
                    Tool:          Software  Analysis  Workstation   (SAW), 
                                   real-time performance measurement. 
                    Tool:          CodeMap,  tracking  tool  to  see  which 
                                   software parts are exercised. 
                    Tool:          XRAY, simulator/debugger to execute code 
                                   on workstation (prior to target macine). 
                                   Rapid prototyping. 
                    Tool:          MDD,  design  phase  analysis  to  check 
                                   performance. 
                    Tool:          SoftAnalyst, Sym Trace provides symbolic 
                                   trace of program and data flow. 
                    Contact:       Myra Linch (703) 875-8670 
 
          Convex Computer Corp. 
 
                    Tool  Data:     Interactive  performance  profilers,  & 
                                   Verdix development environment. 
                    Contact:       Larry Grossman (214) 497-4383 
                                   3000 Waterview Pkwy,  P.O.  Box  883851, 
                                   Richardson, TX 78053-5851 
 
          DDC-1 
 
 
 
                                     - 2 - 
 
 
 
                    Tool:          Symbolic  Ada  debugger,  non-intrusive, 
                                   can input file of test data 
                    Contact:       Forest Holeman (602) 944-1883 
 
          Dynamics Research Corp. 
 
                    Tool:          AdaMAT 
                    Contract:      John Ragosta (508) 475-9090 
                                   60 Frontage Road, Andover, MA 01810 
 
          EVB Software Engineering Inc. 
 
                    Tool:          Complexity measurement 
                    Contact:       Jennifer Lot (301) 695-6960 
                                   5320 Spectrum Drive, Frederick, MD 21701 
 
          Generics Software Ltd. 
 
                    Tool:          AnimAda 
                    Contact:       +353-1-954012 
                                   7  Leopardstown  Office  Park,  Foxrock, 
                                   Dublin 18, Ireland 
 
          INRIA 
 
                    Tool:          Mentor-Ada, measurement system 
                    Contact:       Schroeder A. 
                                   Domaine   de   Voluceau,    B.P.    105, 
                                   Rocquencourt, 78153 Le Chesnay, France 
 
          ITT Avionics 
 
                    Tool Data:     Funded by STARS 
 
                                   Tool: UATL: Universal Ada Test  Language 
                                        (Test Driver) 
                    Contact:       Ziegler J.  (201) 284-5030 
                                   390  Washington   Avenue,   Nutley,   NJ 
                                   070110-5603 
 
 
 
                                     - 3 - 
 
 
 
          Jackson Systems Corporation 
 
                    Tool Data:     data against data and program structures 
                                   to   verify    structure    correctness. 
                                   Structures  may  be  derived  form  test 
                                   data. Test  data  may  be  generated  to 
                                   create templates for program testing. 
                    "Contact:"  Michael Jackson Systems Limited, London 
 
          Programming Environments 
 
                    Tool:          T test case generator 
                    Description:   Verifies    requirements    testability, 
                                   produces  test   cases,   and   analyzes 
                                   testing comprehensiveness.   Inputs  and 
                                   outputs are documented, flat ASCII files 
                                   to allow working with descriptions  from 
                                   other   tools.    Designs   test   cases 
                                   automatically  or  provides  help  in  a 
                                   computer-aided mode, for 100% functional 
                                   coverage and  100%  most-probable-error- 
                                   coverage.  Runs under MS-DOS, UNIX,  and 
                                   VAX/VMS.  Single  prince  copy  for  MS- 
                                   DOS/UNIX systems is $7000. 
                    Contact:       Robert Poston work (201) 918-0110,  home 
                                   (201) 922-0968 
                                   PE Inc. 
                                   4043 State Highway 33, Tinton Falls,  NJ 
                                   07753 
 
          SQL Systems International 
 
                    Tool:          PCMS*ADA, dependency analysis 
                    Contact:       England, 44-279-641021 
 
          Set Labs 
 
                    Tool:          UX-metric for  estimates  of  errors  in 
 
 
 
                                     - 4 - 
 
 
 
                                   design. Support for Ada. 
                    Contact:       Teresa Harrison (503) 289-4758 
 
          Software Research 
 
                    Tool Data:     Full Ada support,  several  environments 
                                   including Sun. 
 
                                   Tool: Capbak/UNIX, capture and  playback 
                                        of test sessions. 
                                   Tool: EXDIFF    (Extended     Difference 
                                        Analyzer) 
                                   Tool: SMARTS (Software  Maintenance  and 
                                        Regression Testing Suite) 
                                   Tool: STCAT/C  (System   Test   Coverage 
                                        Analysis    Tool),    function-call 
                                        coverage. 
                                   Tool: TCAT/C  (Test  Coverage   Analysis 
                                        Tool) 
                                   Tool: TCAT/Path,  profiles   paths   and 
                                        produces graph. 
                                   Tool: TDGen, test data generation 
                    Contact:       Frank Vimaggi? (415) 957-1441 
 
          Teledyne Brown Engineering 
 
                    Tool Data: 
 
                                   Tool: ACAT: Ada Complexity Analysis Tool 
                                   Tool: TAGS/CASE2,  diagnostic   analyzer 
                                        provides static analysis to  ensure 
                                        IORL   syntax   is   complete   and 
                                        correct, and analysis library 
                    Contact:       Mike Cario 352-8533 
 
          TeleSoft 
 
                    Tool:          Telegen2      (Telesoft      development 
                                   environment), browser/profiler 
 
 
 
                                     - 5 - 
 
 
 
                    Contact:       Jeff Kelley (619) 457-2700 
                                   5959 Cornerstone Court West, San  Diego, 
                                   CA 92121 
 
          Verilog SA 
 
                    Tool Data: 
 
                                   Tool: LOGISCOPE, control flow testing at 
                                        unit   and    integration    level, 
                                        currently DD-path and PP-path, some 
                                        to include LCSAJ, graphical display 
                                        of   coverage    with    cumulative 
                                        coverage reporting, full Ada. 
                                   Tool: ASA,  support  for   SADT   IDEF0, 
                                        simluation and test case generation 
                                        for validation of requirements  and 
                                        validation   of   system    against 
                                        requirements. 
                                   Tool: GEODE,    supports    CCITT    SDL 
                                        language, in 6 - 8 months  expected 
                                        to generate Ada code. 
                    Contact:       Nandan  Shah  (technical),  Mark  Luciw, 
                                   Susan Weil (sales) (703) 354-0371 

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada Test Tools
@ 1991-02-08  6:34 Scott Layson
  1991-02-09  2:39 ` LRM 4.1.3 paragraphs 17-19 Joe Vlietstra
  0 siblings, 1 reply; 21+ messages in thread
From: Scott Layson @ 1991-02-08  6:34 UTC (permalink / raw)


I am implementing an Ada front end (more or less) and I have
come across a rule in the (mostly very precise) manual that
seems unclear.  Perhaps someone can help me with it.

It has to do with paragraphs 18 and 19 of section 4.1.3.
(Please refer to the manual at this point.)  Paragraph 17 talks
about four kinds of named constructs whose names can be used as
the prefix of an expanded name.  Paragraphs 18 and 19 give
additional rules about only two of those kinds of constructs,
viz., subprograms and accept statements.  What about block
statements and loop statements?

Thanks in advance,

Scott Burson
Gyro@Reasoning.COM

^ permalink raw reply	[flat|nested] 21+ messages in thread

* LRM 4.1.3 paragraphs 17-19
@ 1991-02-09  2:39 ` Joe Vlietstra
  1991-02-11 14:57   ` Michael Feldman
  0 siblings, 1 reply; 21+ messages in thread
From: Joe Vlietstra @ 1991-02-09  2:39 UTC (permalink / raw)


In article <1991Feb8.063458.850@kestrel.edu> gyro@kestrel.edu (Scott Layson) writes:
>It has to do with paragraphs 18 and 19 of section 4.1.3.
>(Please refer to the manual at this point.)  Paragraph 17 talks
>about four kinds of named constructs whose names can be used as
>the prefix of an expanded name.  Paragraphs 18 and 19 give
>additional rules about only two of those kinds of constructs,
>viz., subprograms and accept statements.  What about block
>statements and loop statements?
>
>Scott Burson
>Gyro@Reasoning.COM

When the LRM is unclear, check the "Approved Ada Language
Commentaries" (published in ACM Ada Letters, Vol IX, No 3, 1989).

For your specific problem, check commentary AI-0016.
This commentary addresses prefixes for renamed packages.
But the discussion section describes how to interpret 4.1.3, and
ends with the statement:
  In short, since the Standard is unclear on the legality of
  such names, and since implementations tend to allow them, it
  is reasonable to interpret the Standard as allowing such names.
When in doubt, be permissive.

In the case of block statements and loop statements, the only
restrictions are those imposed by the scoping rules.  Variables
declared within a block cannot be referenced outside of the block,
even with a prefix.
Loop statements implicitly declare a variable: the loop index.
So the following works (but may get the programmer fired):
	LOOP1:
	for I in 1..10 loop
	   LOOP2:
	   for I in 1..10 loop
	      X (LOOP1.I,LOOP2.I) := 100.0;
	   end loop LOOP2;
	end loop LOOP1;
But LOOP1.I cannot be referenced outside of the loop.
Hope this helps.
------------------------------------------------------------------
Joe Vlietstra        | Checked Daily:  ...!uunet!mojsys!joevl
Mojave Systems Corp  | Checked Weekly: mojave@hmcvax.claremont.edu
1254 Harvard Avenue  | Iffy Routing:   joevl@mojsys.com
Claremont, CA 91711  ! Voice:          (714) 621-7372
------------------------------------------------------------------
-- 
------------------------------------------------------------------
Joe Vlietstra        | Checked Daily:  ...!uunet!mojsys!joevl
Mojave Systems Corp  | Checked Weekly: mojave@hmcvax.claremont.edu
1254 Harvard Avenue  | Iffy Routing:   joevl@mojsys.com

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-09  2:39 ` LRM 4.1.3 paragraphs 17-19 Joe Vlietstra
@ 1991-02-11 14:57   ` Michael Feldman
  1991-02-12  9:48     ` (George C. Harrison) Norfolk State University
  1991-02-15  4:11     ` Jim Showalter
  0 siblings, 2 replies; 21+ messages in thread
From: Michael Feldman @ 1991-02-11 14:57 UTC (permalink / raw)


In article <1991Feb09.023913.524@mojsys.com> joevl@mojsys.com (Joe Vlietstra) writes:
>Loop statements implicitly declare a variable: the loop index.
>So the following works (but may get the programmer fired):
>	LOOP1:
>	for I in 1..10 loop
>	   LOOP2:
>	   for I in 1..10 loop
>	      X (LOOP1.I,LOOP2.I) := 100.0;
>	   end loop LOOP2;
>	end loop LOOP1;
>But LOOP1.I cannot be referenced outside of the loop.

Perhaps this will start a new thread. I'd fire the programmer for two reasons
(I presume Joe had both reasons in mind):

1. using the same name for the two loop indices is gratuitously obscure
   (thus violates a common-sense style principle); it doesn't even save a
   variable in this case.

2. IMHO one shouldn't use a loop like this in Ada to begin with, to
   clear an array to a single value. An aggregate like
       X := (others => (others => 100.0));
   expresses the intention of the programmer more clearly not only to the
   human reader but also to the compiler, which can - perhaps - generate
   better code accordingly.

What I figure could start a new thread is this: in your experience, what are
the sequential Ada constructs that (may) lead to _better_ optimized code
than the "old way" would?IMHO aggregates, universal assignment (i.e.
assignment operator for structured types) and universal equality are three
such things. Which others? What is the actual experience with code generators?
Do they exploit this possible optimization (yet)?

If I am correct, we in the Ada community should be using these arguments to
rebut the arguments of the anti-Ada crowd that Ada code is _necessarily_
worse than its equivalent in (pick your other language). I believe that
Ada code is not only non-worse, it has the potential to be considerably 
better once the compilers and the programmers catch on.

Am I correct?

Mike

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-11 14:57   ` Michael Feldman
@ 1991-02-12  9:48     ` (George C. Harrison) Norfolk State University
  1991-02-12 19:13       ` Michael Feldman
  1991-02-15  4:11     ` Jim Showalter
  1 sibling, 1 reply; 21+ messages in thread
From: (George C. Harrison) Norfolk State University @ 1991-02-12  9:48 UTC (permalink / raw)


In article <2704@sparko.gwu.edu>, mfeldman@seas.gwu.edu (Michael Feldman) writes:
> What I figure could start a new thread is this: in your experience, what are
> the sequential Ada constructs that (may) lead to _better_ optimized code
> than the "old way" would?

What do you mean by "_better_ optimized code?"  If you mean what constructs
_might_ lead the compiler to produce more optimized code than the "Brute Force"
methods like in the example of this original posting, I'd agree with your
assessment below.  "Optimized" to programmers generally means what the compiler
(and often the linker) does to make a faster, smaller executable.  These
constructs, I believe, leave their implementations better open to
these optimizations.

> IMHO aggregates, universal assignment (i.e.
> assignment operator for structured types) and universal equality are three
> such things. 


The other kind of optimization is that which saves the programmers time and
makes him/her more effective.  These include generics, separate compilation,
exceptions, overloading, and other supports for abstraction.  The problem is
that this kind of programmer optimization does not necessarily lead to
executable optimization.  

As an example...  Suppose I have a generic package "MATRIX_OPS" that performs
operations on matrices with elements from an instantiated field of elements. 
By using (and "withing") this package I can solve the system of linear
equations "Coefficient_Matrix * Unknowns_Vector = Constant_Vector" by simply
doing    

       Unknowns_Vector := Coefficient_Matrix ** (-1) * Constant_Vector

That CERTAINLY can save a programmer a lot of time, and with some guarantees of
correctness, it will save his/her job.  However, the implementation of the
exceptions involved, the operators * and **, the hidden implementation of the
underlying field, etc. may have been done by someone else with only abstraction
in mind.  

Ada, unlike most other languages, seems to be (or is getting to be) very
programmer-dependent.  That is, as the compilers and program libraries start
maxing out on optimization, then programmers can really take great pride in
using abstractions effectively.  

I hope I havn't changed Mike's change-in-thread topic, but I thought it
important to make a note on the two kind of optimizations.

-- George C. Harrison -------------- || -- My opinions and observations --
---|| Professor of Computer Science  || -- Only. -------------------------
---|| Norfolk State University, ---- || ----------- Pray for Peace -------
---|| 2401 Corprew Avenue, Norfolk, Virginia 23504 -----------------------
---|| INTERNET:  g_harrison@vger.nsu.edu ---------------------------------

^ permalink raw reply	[flat|nested] 21+ messages in thread

* LRM 4.1.3 paragraphs 17-19
@ 1991-02-12 19:13       ` Michael Feldman
  1991-02-12 21:44         ` Billy Yow 283-4009
  0 siblings, 1 reply; 21+ messages in thread
From: Michael Feldman @ 1991-02-12 19:13 UTC (permalink / raw)


In article <631.27b781ac@vger.nsu.edu> g_harrison@vger.nsu.edu ((George C. Harrison) Norfolk State University) writes:
>
>What do you mean by "_better_ optimized code?"  If you mean what constructs
>_might_ lead the compiler to produce more optimized code than the "Brute Force"
>methods like in the example of this original posting, I'd agree with your
>assessment below.  "Optimized" to programmers generally means what the compiler
>(and often the linker) does to make a faster, smaller executable.  These
>constructs, I believe, leave their implementations better open to
>these optimizations.
>
>> IMHO aggregates, universal assignment (i.e.
>> assignment operator for structured types) and universal equality are three
>> such things. 
That is what I meant, inarticulately though I may have written it. The point is
that many Ada programmers do not focus on some of these constructs, which not
only save their own time and make their code clearer, but may make their
code faster as well. I see a lot of code written with the brute force
structures used in older languages - this is a shame because the Ada is not
only not as "good" but also potentially not as fast.
>
>The other kind of optimization is that which saves the programmers time and
>makes him/her more effective.  These include generics, separate compilation,
>exceptions, overloading, and other supports for abstraction.  The problem is
>that this kind of programmer optimization does not necessarily lead to
>executable optimization.  
>
Well, sure. I certainly wouldn't argue against using the real abstraction
power of Ada. I was really trying to make a different point, namely that
even if one sticks to the "classical" part of Ada - the inner, program-
level syntax, one can potentially get some nice optimization just by
using the language well, without doing tricks. I am still astounded by
the number of programmers who know all about (or think they know all about)
packages, generics, renaming declarations, etc., and who continue to
assert that Ada executables are _necessarily_ slow. They are actually pleased 
when I point out the "little" ways in which Ada can be faster.
They say "hmmmm... I never focused on that..."

Mike

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-12 19:13       ` Michael Feldman
@ 1991-02-12 21:44         ` Billy Yow 283-4009
  1991-02-13  4:32           ` Michael Feldman
  0 siblings, 1 reply; 21+ messages in thread
From: Billy Yow 283-4009 @ 1991-02-12 21:44 UTC (permalink / raw)


... [Stuff Deleted]
  
>assert that Ada executables are _necessarily_ slow. They are actually pleased 
>when I point out the "little" ways in which Ada can be faster.
>They say "hmmmm... I never focused on that..."

What are the ""little" ways"? 

                           Bill Yow
                           yow@sweetpea.jsc.nasa.gov
                           
My opinions are my own!

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-12 21:44         ` Billy Yow 283-4009
@ 1991-02-13  4:32           ` Michael Feldman
  1991-02-13 16:32             ` jncs
  0 siblings, 1 reply; 21+ messages in thread
From: Michael Feldman @ 1991-02-13  4:32 UTC (permalink / raw)


In article <1991Feb12.154418@riddler.Berkeley.EDU> yow@riddler.Berkeley.EDU (Billy Yow 283-4009) writes:
>  
>>assert that Ada executables are _necessarily_ slow. They are actually pleased 
>>when I point out the "little" ways in which Ada can be faster.
>>They say "hmmmm... I never focused on that..."
>
>What are the ""little" ways"? 
>
Well, I think that universal assignment and equality testing are one way.
(That's what started this thread...)

Another is the parameter passing scheme, in which reference semantics can
be used to pass arrays to IN parameters with no danger that the actual
will be changed (because IN parameters can't be written to).
Less copying (though a colleague of mine pointed out that the extra
indirection could actually make the program _slower_.)

I think pragma INLINE could be considered one of these, too, in that
it can reduce the number of procedure calls (at the cost of space,
of course) without giving up the abstraction.

I had a few more, but can't think of 'em offhand. Getting old...

Mike

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-13  4:32           ` Michael Feldman
@ 1991-02-13 16:32             ` jncs
  0 siblings, 0 replies; 21+ messages in thread
From: jncs @ 1991-02-13 16:32 UTC (permalink / raw)


In article <2715@sparko.gwu.edu>, mfeldman@seas.gwu.edu (Michael Feldman) writes:
>In article <1991Feb12.154418@riddler.Berkeley.EDU> yow@riddler.Berkeley.EDU (Billy Yow 283-4009) writes:
>>  
>
>Another is the parameter passing scheme, in which reference semantics can
>be used to pass arrays to IN parameters with no danger that the actual
>will be changed (because IN parameters can't be written to).
>Less copying (though a colleague of mine pointed out that the extra
>indirection could actually make the program _slower_.)
>
The LRM leaves to the implementor to actually decide on the method of parameter
passing IMPLEMENTATION in the case of structured types and IN parameters. I
may use IN for arrays hoping for the COPY-semantics, but the LRM tells me not
to trust it!

J. Nino

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: LRM 4.1.3 paragraphs 17-19
  1991-02-11 14:57   ` Michael Feldman
  1991-02-12  9:48     ` (George C. Harrison) Norfolk State University
@ 1991-02-15  4:11     ` Jim Showalter
  1 sibling, 0 replies; 21+ messages in thread
From: Jim Showalter @ 1991-02-15  4:11 UTC (permalink / raw)


I wouldn't fire the programmer, but I WOULD send him/her to reeducation camp.

^ permalink raw reply	[flat|nested] 21+ messages in thread

* Ada test tools
@ 2002-09-10 19:59 d
  2002-09-11  4:27 ` R. Tim Coslet
                   ` (5 more replies)
  0 siblings, 6 replies; 21+ messages in thread
From: d @ 2002-09-10 19:59 UTC (permalink / raw)


Looking into some test tools like AdaCAST (from VectorCAST) and also
LDRA.  Unit testing, MC/DC, integration level tests, coverage
analysis, auto test driver a plus.

What is the current state of test tools using primarily Ada?

Suggestions?

Cheers



^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
@ 2002-09-11  4:27 ` R. Tim Coslet
  2002-09-12 15:37   ` Colin Paul Gloster
  2002-09-11 15:03 ` John Kern
                   ` (4 subsequent siblings)
  5 siblings, 1 reply; 21+ messages in thread
From: R. Tim Coslet @ 2002-09-11  4:27 UTC (permalink / raw)


I've used AdaCAST quite a bit.

Overall it seems to work very well for CUT level testing.

However the initial versions we got had severe problems testing packages
that contained tasks. I spent ALOT of time sending them sample test
environments that would not work correctly to get various bugs fixed.
Current versions seem to be working reasonably well for us.


Another one you could look at is AdaTest (from a British company, I don't
recall their name). What I see of their ads they look more "stable" and
"mature" than AdaCAST, but I've never had a chance to try it out.


-- 
        R. Tim Coslet
        r_tim_coslet@pacbell.net

Technology, n. Domesticated natural phenomena.


> From: coolpages@excite.com (d)
> Organization: http://groups.google.com/
> Newsgroups: comp.lang.ada
> Date: 10 Sep 2002 12:59:29 -0700
> Subject: Ada test tools
> 
> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.
> 
> What is the current state of test tools using primarily Ada?
> 
> Suggestions?
> 
> Cheers




^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
  2002-09-11  4:27 ` R. Tim Coslet
@ 2002-09-11 15:03 ` John Kern
  2002-09-11 16:00 ` Peter Amey
                   ` (3 subsequent siblings)
  5 siblings, 0 replies; 21+ messages in thread
From: John Kern @ 2002-09-11 15:03 UTC (permalink / raw)


How about TestRT from Rational Corporation.
http://www.rational.com/products/testrt/index.jsp

d wrote:
> 
> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.
> 
> What is the current state of test tools using primarily Ada?
> 
> Suggestions?
> 
> Cheers



^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
  2002-09-11  4:27 ` R. Tim Coslet
  2002-09-11 15:03 ` John Kern
@ 2002-09-11 16:00 ` Peter Amey
  2002-09-11 20:33 ` Simon Wright
                   ` (2 subsequent siblings)
  5 siblings, 0 replies; 21+ messages in thread
From: Peter Amey @ 2002-09-11 16:00 UTC (permalink / raw)




d wrote:
> 
> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.
> 
> What is the current state of test tools using primarily Ada?
> 
> Suggestions?
> 

AdaTest from IPL (http://www.iplbath.com/products/tools/pt600.shtml)

Peter



^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
                   ` (2 preceding siblings ...)
  2002-09-11 16:00 ` Peter Amey
@ 2002-09-11 20:33 ` Simon Wright
  2002-09-12 16:30 ` Patricia Langle
  2002-09-30 23:58 ` KSW
  5 siblings, 0 replies; 21+ messages in thread
From: Simon Wright @ 2002-09-11 20:33 UTC (permalink / raw)


coolpages@excite.com (d) writes:

> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.

We are using AUnit from ACT, it doesn't do all the fancy stuff (MC/DC
etc) but it is working very well.

Also gcov for coverage; not always completely straightforward,
especially with generics, but still useful.



^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-11  4:27 ` R. Tim Coslet
@ 2002-09-12 15:37   ` Colin Paul Gloster
  0 siblings, 0 replies; 21+ messages in thread
From: Colin Paul Gloster @ 2002-09-12 15:37 UTC (permalink / raw)


In article <B9A41295.52F2%R_Tim_Coslet@pacbell.net>, R. Tim Coslet wrote:
"[..]  

Another one you could look at is AdaTest (from a British company, I don't
recall their name). [..]"

Peter Amey already posted about IPL before I saw your message, but I can
add to the thread a mention of an exclusively coverage testing aid from
elsewhere in the British Isles: HTTP://Glasnost.ITCarlow.Ie/~meudecc/atgen/
(Christophe Meudec, +353 503 76266).



^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
                   ` (3 preceding siblings ...)
  2002-09-11 20:33 ` Simon Wright
@ 2002-09-12 16:30 ` Patricia Langle
  2002-09-30 23:58 ` KSW
  5 siblings, 0 replies; 21+ messages in thread
From: Patricia Langle @ 2002-09-12 16:30 UTC (permalink / raw)



As Vector Software partner, Aonix France has now a good experience of
using VectorCAST/Ada on big projects.
Our professional services and our customers have successfully tested Ada
applications. The last one was for SIL4 certification (highest critical
level in ground transportation systems).
Our teams appreciate the tools (user friendly) and the efficiency of
Vector Software customer support.
Just have a look on their Web site www.vectorcast.com, you could
download all the documentation you need.

Best regards

Patricia


d a �crit :

> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.
>
> What is the current state of test tools using primarily Ada?
>
> Suggestions?
>
> Cheers







^ permalink raw reply	[flat|nested] 21+ messages in thread

* Re: Ada test tools
  2002-09-10 19:59 Ada test tools d
                   ` (4 preceding siblings ...)
  2002-09-12 16:30 ` Patricia Langle
@ 2002-09-30 23:58 ` KSW
  5 siblings, 0 replies; 21+ messages in thread
From: KSW @ 2002-09-30 23:58 UTC (permalink / raw)


d- I would be happy to review our unit testing and code coverage product
suite with you.  Feel free to contact me.
Kyle Wilbur
Vector Software
ksw@vectors.com
(401)295-5855 x117

"d" <coolpages@excite.com> wrote in message
news:f2652562.0209101159.4b4ec60b@posting.google.com...
> Looking into some test tools like AdaCAST (from VectorCAST) and also
> LDRA.  Unit testing, MC/DC, integration level tests, coverage
> analysis, auto test driver a plus.
>
> What is the current state of test tools using primarily Ada?
>
> Suggestions?
>
> Cheers





^ permalink raw reply	[flat|nested] 21+ messages in thread

end of thread, other threads:[~2002-09-30 23:58 UTC | newest]

Thread overview: 21+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1991-02-08  6:34 Ada Test Tools Scott Layson
1991-02-09  2:39 ` LRM 4.1.3 paragraphs 17-19 Joe Vlietstra
1991-02-11 14:57   ` Michael Feldman
1991-02-12  9:48     ` (George C. Harrison) Norfolk State University
1991-02-12 19:13       ` Michael Feldman
1991-02-12 21:44         ` Billy Yow 283-4009
1991-02-13  4:32           ` Michael Feldman
1991-02-13 16:32             ` jncs
1991-02-15  4:11     ` Jim Showalter
  -- strict thread matches above, loose matches on Subject: below --
2002-09-10 19:59 Ada test tools d
2002-09-11  4:27 ` R. Tim Coslet
2002-09-12 15:37   ` Colin Paul Gloster
2002-09-11 15:03 ` John Kern
2002-09-11 16:00 ` Peter Amey
2002-09-11 20:33 ` Simon Wright
2002-09-12 16:30 ` Patricia Langle
2002-09-30 23:58 ` KSW
1991-02-07 20:26 Ada Test Tools Bill Brykczynski
1991-01-31 20:37 Johan Margono
1987-07-07 16:47 Lee McLoughlin
1987-07-13 23:07 ` Eric Beser sys admin

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