[Colloquium] Darko Marinov on Monday, April 5th, 2004

[Margery Ishmael]

DEPARTMENT OF COMPUTER SCIENCE - TALK

Date: Monday, April 5, 2004
Time: 2:30 p.m.
Place: Ryerson 251

-------------------------------------------

Speaker:  DARKO MARINOV, CS & AI Lab at MIT

Url: http://www.cag.lcs.mit.edu/~marinov/

Title: Automatic Testing of Software with Structurally Complex Inputs

Abstract:

Modern software pervasively uses structurally complex data such as 
linked data structures. The standard approach to generating test suites 
for such software, manual generation of the inputs in the suite, is 
tedious and error-prone. This talk presents Korat, a new technique that 
automates the generation of suites with structurally complex test 
inputs. Korat allows the developer to describe the properties of valid 
inputs using a familiar implementation language such as Java. Given a 
description and a bound on the input size, a Korat tool automatically 
generates the test suite.

Korat tools have been implemented and used in both academia and 
industry. Developers typically use these tools to generate 
bounded-exhaustive test suites that contain all nonequivalent inputs up 
to a given size. Our results show that this approach provides 
high-quality test suites that achieve excellent code coverage for 
data-structure libraries. Moreover, developers have successfully used 
this approach to discover errors in real applications, including a 
naming architecture for networks, a solver for declarative predicates, 
a fault-tree analyzer, and several tools for XML languages.

Short Bio: Darko Marinov is a Ph.D. student in Computer Science at MIT, 
where he leads the MulSaw project on software reliability. He received 
an S.M. from MIT for work on credible compilation and a B.S. in 
Computer Science and Engineering from the University of Belgrade, 
Yugoslavia.

--------------------------------------------

Host: Robert Findler

*Refreshments will follow the talk in Ryerson 255*

People in need of assistance should call 773-834-8977 in advance.