One or more embodiments of the invention relate to computer software analysis and testing in general.
One of the challenges encountered by designers of static analysis engines is designing static analysis engines that are able to analyze large computer software applications. Typically when performing static analysis of a computer software application, a model representation is built of the application. The model is then analyzed in accordance with a specification. Unfortunately, some applications are so large and complex, that just translating them from their initial state (e.g., source code or object code) and into an analyzable artifact presents difficult challenges. Furthermore, the larger the application, the larger the model, the greater the complexity and processing requirements when analyzing the model, and the greater the chance the capacity of the static analysis engine will be exceeded.
In one aspect of the invention a method is provided for statically analyzing a computer software application. The method can include identifying a plurality of objects within the instructions of a computer software application, where the objects in the plurality of objects are of the same object type, and preparing a modified version of the instructions in which any of the objects in the plurality of objects determined to be extraneous is omitted.
Systems and computer-program products embodying the operations and functions disclosed within this specification are also provided.
The invention will be understood and appreciated more fully from the following detailed description taken in conjunction with the appended drawings in which:
The invention is now described within the context of one or more embodiments, although the description is intended to be illustrative of the invention as a whole, and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical data storage device, a magnetic data storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Reference is now made to
An input reducer 110 is preferably configured to prepare a modified version of the instructions of computer software application 102 in which any of the objects identified by object identifier 100 is omitted. Thus, continuing with the previous example, where object identifier 100 identifies multiple table records as being extraneous to statically analyzing the instructions of computer software application 102 when checking for illegal variable names, input reducer 110 preferably prepares a modified version of the instructions of computer software application 102 in which one or more of the table records are removed, thus reducing the size of the computer software application 102 before it is input to static analysis engine 104. Static analysis engine 104 is preferably configured in accordance with conventional techniques to construct a model representation of the modified version of the instructions of computer software application 102, and statically analyze the model representation of the modified version of the instructions.
Any of the elements shown in
Reference is now made to
Reference is now made to
Referring now to
As shown, the techniques for controlling access to at least one resource may be implemented in accordance with a processor 510, a memory 512, I/O devices 514, and a network interface 516, coupled via a computer bus 518 or alternate connection arrangement.
It is to be appreciated that the term “processor” as used herein is intended to include any processing device, such as, for example, one that includes a CPU (central processing unit) and/or other processing circuitry. It is also to be understood that the term “processor” may refer to more than one processing device and that various elements associated with a processing device may be shared by other processing devices.
The term “memory” as used herein is intended to include memory associated with a processor or CPU, such as, for example, RAM, ROM, a fixed memory device (e.g., hard drive), a removable memory device (e.g., diskette), flash memory, etc. Such memory may be considered a computer readable storage medium.
In addition, the phrase “input/output devices” or “I/O devices” as used herein is intended to include, for example, one or more input devices (e.g., keyboard, mouse, scanner, etc.) for entering data to the processing unit, and/or one or more output devices (e.g., speaker, display, printer, etc.) for presenting results associated with the processing unit.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It will be appreciated that any of the elements described hereinabove may be implemented as a computer program product embodied in a computer-readable medium, such as in the form of computer program instructions stored on magnetic or optical storage media or embedded within computer hardware, and may be executed by or otherwise accessible to a computer.
While the methods and apparatus herein may or may not have been described with reference to specific computer hardware or software, it is appreciated that the methods and apparatus described herein may be readily implemented in computer hardware or software using conventional techniques.
While the invention has been described with reference to one or more specific embodiments, the description is intended to be illustrative of the invention as a whole and is not to be construed as limiting the invention to the embodiments shown. It is appreciated that various modifications may occur to those skilled in the art that, while not specifically shown herein, are nevertheless within the true spirit and scope of the invention.
Number | Name | Date | Kind |
---|---|---|---|
5832271 | Devanbu | Nov 1998 | A |
7284274 | Walls | Oct 2007 | B1 |
7340726 | Chelf | Mar 2008 | B1 |
7434202 | Kramer | Oct 2008 | B2 |
7467376 | Le Metayer et al. | Dec 2008 | B2 |
7685471 | Rajan et al. | Mar 2010 | B2 |
8234627 | Floyd | Jul 2012 | B2 |
8370938 | Daswani | Feb 2013 | B1 |
8516590 | Ranadive | Aug 2013 | B1 |
8555391 | Demir | Oct 2013 | B1 |
8683584 | Daswani | Mar 2014 | B1 |
8850405 | Fink | Sep 2014 | B2 |
8903702 | Artzi | Dec 2014 | B2 |
9154364 | Daswani | Oct 2015 | B1 |
20040168152 | Kramer | Aug 2004 | A1 |
20060150160 | Taft | Jul 2006 | A1 |
20070016894 | Sreedhar | Jan 2007 | A1 |
20070107057 | Chander | May 2007 | A1 |
20070226281 | Joisha | Sep 2007 | A1 |
20070288899 | Fanning | Dec 2007 | A1 |
20080098361 | Kumar | Apr 2008 | A1 |
20080155511 | Cohen | Jun 2008 | A1 |
20080189686 | Rajan | Aug 2008 | A1 |
20080300851 | Chakrabarti | Dec 2008 | A1 |
20090132991 | Ganai | May 2009 | A1 |
20090204968 | Kahlon | Aug 2009 | A1 |
20090282288 | Wang | Nov 2009 | A1 |
20100058256 | El-Zein | Mar 2010 | A1 |
20100088678 | AlTurki | Apr 2010 | A1 |
20100257603 | Chander | Oct 2010 | A1 |
20110138373 | Lane | Jun 2011 | A1 |
20110307954 | Melnik | Dec 2011 | A1 |
20110314091 | Podjarny | Dec 2011 | A1 |
20120030661 | Porras | Feb 2012 | A1 |
20120072887 | Basak | Mar 2012 | A1 |
20120102471 | Artzi | Apr 2012 | A1 |
20120204163 | Marathe | Aug 2012 | A1 |
20120216177 | Fink | Aug 2012 | A1 |
20130054221 | Artzi | Feb 2013 | A1 |
Number | Date | Country |
---|---|---|
102231134 | Nov 2011 | CN |
Entry |
---|
Kinn,Byung-Ik, Chae-Tae Im, and Hyun-Chul Jung. “Suspicious malicious web site detection with strength analysis of a javascript obfuscation.” International Journal of Advanced Science and Technology 26 (2011): 19-32. (Year: 2011). |
Devanbu, Premkumar T. “GENOA: a customizable language-and front-end independent code analyzer.” Proceedings of the 14th international conference on Software engineering. ACM, 1992. (Year: 1992). |
Liang, D., et al., “Equivalence Analysis and its Application in Improving the Efficiency of Program Slicing,” ACM Transactions on Software Engineering and Methodology, vol. 11, No. 3, pp. 347-383, 2002. |
Number | Date | Country | |
---|---|---|---|
20130111449 A1 | May 2013 | US |