Proceedings of the Symposium on Testing, Analysis, and Verification
ISSTA, 1991.

@proceedings{TAV-1991,
	address       = "Victoria, British Columbia, Canada",
	publisher     = "{ACM}",
	title         = "{Proceedings of the Symposium on Testing, Analysis, and Verification}",
	year          = 1991,
}

Contents (19 items)

5 ×#data flow
4 ×#analysis
4 ×#testing
2 ×#algebra
2 ×#approach
2 ×#c
2 ×#comparison
2 ×#concurrent
2 ×#pointer
2 ×#question

TAV-1991-WeyukerWH #comparison #testing

Comparison of Program Testing Strategies (EJW, SNW, RGH), pp. 1–10.

TAV-1991-Podgurski #algorithm #reliability

Reliability, Sampling, and Algorithmic Randomness (AP), pp. 11–20.

TAV-1991-LongC #analysis #concurrent #data flow

Data Flow Analysis of Concurrent Systems that Use the Rendezvous Model of Synchronization (DLL, LAC), pp. 21–35.

TAV-1991-DuesterwaldS #analysis #concurrent #data flow #framework #using

Concurrency Analysis in the Presence of Procedures Using a Data-Flow Framework (ED, MLS), pp. 36–48.

TAV-1991-YehY #algebra #analysis #composition #process #reachability #using

Compositional Reachability Analysis Using Process Algebra (WJY, MY), pp. 49–59.

TAV-1991-AgrawalDS #pointer #slicing

Dynamic Slicing in the Presence of Unconstrained Pointers (HA, RAD, EHS), pp. 60–73.

TAV-1991-OstrandW #analysis #data flow #pointer #test coverage #testing

Data Flow-Based Test Adequacy Analysis for Languages with Pointers (TJO, EJW), pp. 74–86.

TAV-1991-HorgnaL #c #data flow

Data Flow Coverage and the C Language (JRH, SL), pp. 87–97.

TAV-1991-GuptaS #approach #detection #performance #runtime

Loop Monotonic Computations: An Approach for the Efficient Run-Time Detection of Races (RG, MS), pp. 98–111.

TAV-1991-GhezziK #approach #specification

Executing Formal Specifications: The ASTRAL to TRIO Translation Approach (CG, RAK), pp. 112–122.

TAV-1991-Sankar #algebra #consistency #runtime #specification

Run-Time Consistency Checking of Algebraic Specifications (SS), pp. 123–129.

TAV-1991-Harrold #data flow #optimisation #testing

The Effects of Optimizing Transformations on Data-Flow Adequate Test Sets (MJH), pp. 130–138.

TAV-1991-PandeL #c #interprocedural #source code

Interprocedural Def-Use Associations in C Programs (HDP, WL), pp. 139–153.

TAV-1991-FranklW #comparison #effectiveness

An Experimental Comparison of the Effectiveness of the All-Uses and All-Edges Adequacy Criteria (PGF, SNW), pp. 154–164.

TAV-1991-DoongF #case study #object-oriented #source code #testing

Case Studies on Testing Object-Oriented Programs (RKD, PGF), pp. 165–177.

TAV-1991-AvruninBCDW #tool support

Experiments with an Improved Constrained Expression Toolset (GSA, UAB, JCC, LKD, JCW), pp. 178–187.

TAV-1991-Young #formal method #question #re-engineering

Formal Methods versus Software Engineering: Is There a Conflict? (WDY), pp. 188–189.

TAV-1991-Marick

The Weak Mutation Hypothesis (BM), pp. 190–199.

TAV-1991-OffuttL #how #question

How Strong is Weak Mutation? (AJO, SDL), pp. 200–213.