RESEARCH

1. Data Flow Testing. This is a collection of white-box (structural coverage)
   testing strategies that utilize patterns of data flow in the
   program to synthesize the test suite. The simplest of such a strategy,
   Definition-Use coverage, requires that every variable assignment
   be used in every possible place in the program. A more complex, U-context
   testing has been shown to be a strongest testing coverage
   method around, being equivalent to a well-thought out Black-Box, specification
   based testing.
2. A prototype System for Testing And Debugging (STAD Pascal), which integrates
   static and dynamic analysis into a coherent whole.
3. Dynamic Slicing of computer programs, a debugging technique. It uses the
   recorded execution history to identify statements in the
   program that most likely are faulty.
4. Program Clustering, a method for automatic identification of program
   modifications. It allows one to encapsulate the modification
   within single-entry single-exit part of code, thus facilitating regression
   testing and analysis.
5. Dynamic Mutation Testing, a method for the estimation of the existence
   of faults in programs, for a passing test suite.
6. The first theoretical model of programming faults, errors, and their propagation.

• Dependency Analysis of Ada programs
  
• Combining Testing and Formal Verification
  
• Formulating and testing Fault Hypotheses in software testing and debugging
  
  

Selected Publications

1. J. Laski, B. Korel, "A Data Flow Oriented Program Testing Strategy," IEEE Trans. Software Engineering, V.SE-9, No.3., May 1983, pp. 347-354.
2. J. Laski, "An Algorithm for the Derivation of Codefinitions in Computer Programs," Information Processing Letters, 23, August 1986, pp. 85-90.
3. J. Laski, "Data Flow Testing in STAD," Journal of Systems and Software, v. 12, 1990, pp. 3-14.
4. B. Korel, J. Laski, "Dynamic Slicing of Computer Programs," The Journal of Systems and Software, V. 13, 1990, pp. 187-195
5. B. Korel, J. Laski, "Dynamic Program Slicing," Information Processing Letters, 29, October 1988, pp. 155-163
6. J. Laski, "Testing in Program Development Cycle," Software Engineering Journal, March 1989, pp. 95-106.
7. J. Laski, "Path Expressions in Data Flow Program Testing," Proc. Compsaq 1990, The 14th International Computer Software and Applications Conference, Chicago, Illinois, Oct 29-Nov 2, 1990, pp. 570-576.
8. B. Korel, J. Laski, "Algorithmic Software Fault Localization," Proc. 24th Annual Hawaii International Conference on System Science, Jan 1991, Vol II, pp. 246-252.
9. J. Laski, W. Szermer, "Identification of Program Modifications and its Applications in Software Maintenance," Proc.IEEE Conference on Software Maintenance, Orlando, Florida, November 10-13, 1992, pp. 282-290.
10. J. Laski, W. Szermer, "Regression Analysis of Reusable Software Components," Advances in Software Reuse, Second International Workshop on Software Reusability, Lucca, Italy, March 24-26, 1993, pp. 134-141.
11. J. Laski, W. Szermer, P. Luczycki, "Dynamic Mutation Testing in Integrated Regression Analysis," Proc. 15th International Conference on Software Engineering, May 17-21, Baltimore, Maryland, pp. 108-117, 1993.
12. J. Laski, "An Integrated Approach to Software Testing and Analysis," Proc. International Software Quality Week QW'93, San Francisco, June 25-28, 1993.
13. J. Laski, W. Szermer, P. Luczycki, "Error Masking in Computer Programs," Journal for Software Testing, Verification and Reliability, Vol.5, pp. 81-105, 1995.
14. J. Laski, "Programming faults and errors: Towards a theory of program incorrectness," Annals of Software Engineering, 4 (1997) pp. 79-114.
15. J. Laski, W. Stanley, J. Hurst, "Dependency Analysis of Ada Programs," Proc. ACM SIGAda Annual International Conference (SIGAda98), Nov. 8-12, 1998, Washington, DC, pp. 263-275.