BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/494
DTSTAMP:20230914T125926Z
SUMMARY:Automated Test Generation Using Concolic Testing
DESCRIPTION:Speaker: Koushik Sen (University of California\, Berkeley\nDepa
 rtment of Electrical Engineering  and\nComputer Sciences\n581 Soda Hall #
  1776\nUnited States of America)\n\nAbstract: \nAbstract: In this talk\, I
  will describe concolic testing\, also known as directed automated random 
 testing (DART) or dynamic symbolic execution\, an efficient way to automat
 ically and systematically generate test inputs for programs. Concolic test
 ing uses a combination of runtime symbolic execution and automated theorem
  proving techniques to automatically generate non-redundant and exhaustive
  test inputs. Specifically\, concolic testing performs symbolic execution 
 along a concrete execution path\, generates a logical formula denoting a c
 onstraint on the input values\, and solves a constraint to generate new te
 st inputs that would execute the program along previously unexplored paths
 . Concolic testing has inspired the development of several industrial and 
 academic automated testing and security tools such as PEX\, SAGE\, and YOG
 I at Microsoft\, Apollo at IBM\, Conbol at Samsung\, and CUTE\, jCUTE\, CA
 TG\, Jalangi\, SPLAT\, BitBlaze\, jFuzz\, Oasis\, and SmartFuzz in academi
 a. A central reason behind the wide adoption of concolic testing is that\,
  while concolic testing uses program analysis and automated theorem provin
 g techniques internally\, it exposes a testing usage model that is familia
 r to most software developers.\n
URL:https://www.tcs.tifr.res.in/web/events/494
DTSTART;TZID=Asia/Kolkata:20140603T113000
DTEND;TZID=Asia/Kolkata:20140603T123000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR