*banner
 

From Automated Software Testing to Likely Program Invariant Generation
Koushik Sen

Citation
Koushik Sen. "From Automated Software Testing to Likely Program Invariant Generation". Talk or presentation, 18, March, 2008.

Abstract
Testing with manually generated test cases is the primary technique used in industry to improve reliability of software--in fact, such testing is reported to account for over half of the typical cost of software development. I will describe Concolic Testing, a systematic and efficient method which combines random and symbolic testing. Concolic testing enables automatic and systematic testing of large programs, avoids redundant test cases and does not generate false warnings. Experiments on real-world software show that concolic testing can be used to effectively catch generic errors such as assertion violations, memory leaks, uncaught exceptions, and segmentation faults. In the second part of my talk, I will present a novel application of concolic testing to generate likely data structure invariants.

Electronic downloads


(No downloads are available for this publication.)
Citation formats  
  • HTML
    Koushik Sen. <a
    href="http://chess.eecs.berkeley.edu/pubs/406.html"
    ><i>From Automated Software Testing to Likely
    Program Invariant Generation</i></a>, Talk or
    presentation,  18, March, 2008.
  • Plain text
    Koushik Sen. "From Automated Software Testing to Likely
    Program Invariant Generation". Talk or presentation, 
    18, March, 2008.
  • BibTeX
    @presentation{Sen08_FromAutomatedSoftwareTestingToLikelyProgramInvariant,
        author = {Koushik Sen},
        title = {From Automated Software Testing to Likely Program
                  Invariant Generation},
        day = {18},
        month = {March},
        year = {2008},
        abstract = {Testing with manually generated test cases is the
                  primary technique used in industry to improve
                  reliability of software--in fact, such testing is
                  reported to account for over half of the typical
                  cost of software development. I will describe
                  Concolic Testing, a systematic and efficient
                  method which combines random and symbolic testing.
                  Concolic testing enables automatic and systematic
                  testing of large programs, avoids redundant test
                  cases and does not generate false warnings.
                  Experiments on real-world software show that
                  concolic testing can be used to effectively catch
                  generic errors such as assertion violations,
                  memory leaks, uncaught exceptions, and
                  segmentation faults. In the second part of my
                  talk, I will present a novel application of
                  concolic testing to generate likely data structure
                  invariants.},
        URL = {http://chess.eecs.berkeley.edu/pubs/406.html}
    }
    

Posted by Douglas Densmore on 17 Mar 2008.
Groups: chess
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

You are not logged in 
©2002-2014 Chess