A. Gupta Page 1 of 4

ASHOK GUPTA B-317, Patel Hall of Residence,

Indian Institute of Technology, Kharagpur, Kharagpur-721 302, West Bengal, India.

Email: ashlucky.rajgarh@gmail.com Phone: +919932729843

OBJECTIVE

To seek a Summer Internship in an Institute of international recognition in the field of Computer Science and Engineering so as attain excellent standards while delivering my best to meet the goals.

PERSONAL INFORMATION

Gender: Male Date of Birth: 4th January 1982 Linguistic Skills: English, Hindi and Gujrati Educational Status: 4th Year of Bachelor of Technology Degree Program, Department of Computer Science and Engineering

I have been placed in The Server Technology Group of Oracle Corporation Bangalore, India

EDUCATION

YEAR STANDARD INSTITUTE PERFORMANCE 2005 7th semester IIT Kharagpur CGPA=8.58,SGPA=8.412005 6th semester IIT Kharagpur CGPA=8.61 SGPA=8.052004 5th semester IIT Kharagpur CGPA=8.70 SGPA=9.402004 4th semester IIT Kharagpur CGPA=8.52 SGPA=8.582003 3rd semester IIT Kharagpur CGPA=8.50 SGPA=8.242003 2nd semester IIT Kharagpur CGPA=8.60 SGPA=8.802002 1st semester IIT Kharagpur CGPA=8.43 SGPA=8.432000 Senior Secondary( CBSE -AISSCE) JNV SEHORE 84.2% 1998 Matriculation( CBSE-AISSE) JNV RAJGARH 86.8%

• Awarded a Certificate of Merit for reasons of outstanding performance and for being among

the top 0.1 percent of the successful candidates of AISSE’1998 in Science. • Awarded a Certificate of Merit in recognition of the high position secured by me in the list of

meritorious candidates of AISSE’1998.

SKILLS • Competent in C, C++, Java, Verilog, MS SQL, Assembly Language of Intel 8085. • Exposed to Windows, Linux, Solaris and DEC Alpha platforms. • Experienced in Lex and Yacc, ANTLR, Circuit Maker, AutoCAD, Visual Paradigm tools,

Microsoft SQL Server 2000, Cadence and Synopsys’ Design and Testing Tools for Circuit Analysis. Continued.....

A. Gupta Page 2 of 4

PROJECTS / MAJOR ASSIGNMENTS / TRAINING • Currently working on my B.tech. Project “A New Static Representation of Object-Oriented

Programs for Coverage Analysis” under Prof. Rajib Mall. • Successfully completed Summer Training at SYNOPSYS INC., Bangalore, the leading company

for EDA tool design and services. I worked on NativeTestBench technology of VCS, the leading simulation tool from Synopsys, and also tested critical features of the DPI (Direct Programming Interface) technology.

• Successfully completed one month Summer Course in Integrated Circuit Design conducted by the Advanced VLSI Design Laboratory, IIT Kharagpur with an “Excellent” remark.

• Designed and implemented a 4-bit CPU performing 11 Instructions on bread-board using micro-programming.

• Designed and implemented an automatic 8 Floor Lift-Controller on bread-board. • Generated a complete Compiler for a Tiny C language using Lex and Yacc tools. • Build a Caching Proxy HTTP Server in java. It acts both a client and a server. To serve certain

pages, it must act as a client to other servers to obtain a copy of the requested content. • A solution to Paragraph Adjustment Problem using dynamic programming. • Designed a LL (1) Parser for a Tiny-C language. • Designed a Preprocessor for C which does nested and conditional file inclusion, purgation of

comments, Nested macro and Textual replacement and shows line numbers in respective files. • Designed a Generic Lexical Analyser Generator using NFA, DFA and Thompson’s Construction

which takes regular expressions as its input and generate the lexer. • Designed a Library Information System in Java with several features like Issue, Return, Reissue,

Disposal of books and account keeping of members. • Designed a GUI based Sequential Circuit Tutor, displaying inserted scan chain and graphically

illustrating the operation of the circuit in normal and test modes in a step by step manner. • Designed a Paint Tool using OpenGL. • Implemented Triangulation Algorithms and Convex Hull using OpenGL. • Designed a 2D animation of a natural scene in OpenGL.

PARTICIPATION AND ACHIEVEMENTS

• Secured an All India Rank 280 out of 150000 students appeared for JEE-2002 the Joint Entrance Examination for admission to the IIT's.

• Awarded a Merit Certificate in ACIF (Academic Council for International Fraternity) GK TEST’1995.I had secured an All India Rank 13th.

• Secured 2nd and 3rd position for two consecutive days in the ‘SFCoder’ programming contest in the SF2005, the cultural fest of IITKGP.

• Secured 10th position in the online programming contest CodeCraft in the felicity’06, the technology festival of IIT Hyderabad.

• Designed and build a client application of the “Mission Mars” event organized by the Robotics Team of IIT kharagpur in Feb’05. Task was to code robot ants which can coordinate among themselves during their mission and to help them probe as much area of the virtual arena as possible. Continued....

A. Gupta Page 3 of 4

RELEVANT COURSES TAKEN

Programming and Data structure Design and Analysis of Algorithms Discrete Structures Switching Circuits and Logic Design. Formal Languages and Automata Theory Computer Organization and Architecture.Basic Electronics Electrical Technology. Mathematics-I Mathematics-II. Probability and Statistics Compiler Construction Operating Systems Signals and Networks Linear Algebra Software Engineering Computer Networks Artificial Intelligence Advanced Computer Architecture Embedded Systems VLSI Testing And Verification Machine Learning Database Management System Electronics Commerce Technology

EXTRA-CURRICULAR ACTIVITIES • Subcommittee Member and Hall Representative on the team of IIT Kharagpur magazine

“Alankar “. • Contributed several Hindi Poems to Hall-Magazines and IIT Kharagpur magazine. • Participated in Inter Hall Dramatics. • Member of Inter-Hall Weight-lifting and Inter-Hall Hindi Creative Writing Teams. Participated

in various literary events like Debate, Elocution. • Worked as a volunteer in IDEON’03(then Technology festival of IIT Kharagpur). • NCC Cadet in First and Second Year and obtained a ‘B’ Certificate year with an ‘A’ grade.

▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬

A. Gupta Page 4 of 4

B. Tech PROJECT ABSTRACT “A New Static Representation of Object-Oriented Programs for Coverage Analysis”

It has been widely recognized that graphs provide an interesting formalism for modeling the complex

structures that occur in software engineering. The various visual sublanguages of the UML and other graphical representations are therefore vastly used for the analysis and design of large software. The concepts of inheritance and polymorphism are the strengths of Object-Oriented Programming languages; however they pose special difficulties in program representation. Due to inheritance and dynamic binding the process of tracing dependencies becomes more complex than that in a procedural program.

This project is about to find a suitable representation which can show two important features of an OO

program namely Inheritance and Polymorphism and can also give values of inheritance and polymorphism coverage metrics. After developing the representation we instrument the existing program so as to do runtime updating for measuring coverage for a particular test case or test set. We develop the static structure of program by program analysis techniques taking conservative approaches about data dependencies.

The source of motivation to find a new representation comes from the detailed and complex structure of the

graphs statically designed to represent a program till now. The CFG (Control flow graph), PDG (Program Dependence Graph), SDG (System Dependence Graph), ESDG (Extended System Dependence Graph) representations are rather detailed: They contain information about every class, and most of the control flow details for every method. Thus even for relatively small programs, the graphs involved are large and not really useful for visualization. Moreover, we are not always interested in the finest program details, when studying about inherited method calls and polymorphic method call which are operations at the method level. In this project a possible solution to this problem is investigated: the introduction of a hierarchical structure for the graphs that represent programs. Integration of our representation with ESDG representation of Object-Oriented Program will be the next stage of the project.

To build the program we performed static analysis of the program code. Static analysis derives information

by inspection of the source code. The information must be valid for all possible executions of the program. Conservative assumptions must be taken if the program uses conditional branches and iteration since it is not known at compile time which branches will be taken at run time and how much iteration there will be

However there are three main sources of imprecision of static analysis; dynamic types of

polymorphic variables, alias definitions and faulty control flow constructs. In most cases the exact destination of polymorphic call sites cannot be determined by static analysis. Dynamic binding can only be handled conservatively by considering the effects of all possible call destinations at polymorphic call sites. Many aliases may refer to the same object and therefore it poses several problems. Faulty control flow can lead to an overestimation of data dependencies and therefore can cause an imprecision about various candidate methods in a polymorphic call.