摘要:
A method of analyzing target software for security vulnerabilities comprises, with a processor, scanning a codebase of a target software using a static analysis scan to identify a number of security flaws, and calculating a number of code metrics of the codebase of the target software for a number of iterations over a period of time to obtain a number of historical scans.
摘要:
A method and system detect vulnerabilities in source code. Source code (134) is processed by a parser (136) into an intermediate representation. Models (e.g., in the form of lattices) are derived (138) for the variables in the code and for the variables and/or expressions using in conjunction with routine calls. The models are then analyzed in conjunction with pre-specified rules in a vulnerability database (142), about the routines to determine (140) if the routine call possesses one or more pre-selected vulnerabilities.
摘要:
A scriptor and interpreter are disclosed. The scriptor and interpreter each not only check the syntax of a command in a script, but also that the values for the variables passed as arguments to command are consistent with the values attributed to those variables in preceding portions of the script.
摘要:
State of the art code matching approaches have the disadvantage that they rely on the line numbers provided by source code and binary parsers to establish mapping and do not work since changes introduced by compiler may be much more complex. Some approaches do not work as the source code of application and its binary version may not share the vocabulary. Machine learning based techniques have the disadvantage that they require significant amount of training data, which may not be available in abundance. Method and system disclosed herein provide a mechanism matching score for each of a plurality of code fragments in the intermediate representation of the source code file for each of a plurality of binary fragments in the intermediate representation of the binary file.
摘要:
Technologies for generating composable library functions include a first computing device that includes a library compiler configured to compile a composable library and second computing device that includes an application compiler configured to compose library functions of the composable library based on a plurality of abstractions written at different levels of abstractions. For example, the abstractions may include an algorithm abstraction at a high level, a blocked-algorithm abstraction at medium level, and a region-based code abstraction at a low level. Other embodiments are described and claimed herein.
摘要:
This disclosure provides various embodiments for performing operations on entities of a meta model modeling one or more software components. A request is received to perform a particular operation of a particular type on each of a plurality of model entities, each model entity modeling at least one attribute of a software component. The request includes an identification of the particular type of operation in a plurality of operation types. The model entities are retrieved in response to the request. A handler object is instantiated of the particular type adapted to perform the particular operation by calling a set of reusable software modules, each software module providing functionality used to perform at least a portion of the particular operation on at least one entity in the plurality of entities. Result data is generated based on the performance of the particular operation using the instantiated handler and reusable software modules.
摘要:
The invention relates to a system for building a parser. According to the invention, such a system comprises of: - a grammar input module for inputting in said parser generator a grammar expressed in a given formalism; - a checking module for formally verifying that a given grammar belongs to a predetermined class of grammars for which a translation to a correct, terminating parser is feasible; - a checking module for formally verifying that a grammar expressed in the said formalism is well-formed; - a semantic action module defining a parsing result depending on semantic actions embedded in said grammar, said semantic action module ensuring in a formal way that all semantic actions of said grammar are terminating and - a formal module generating a parser with total correctness guarantees, using said modules to verify that the grammar is well-formed, belongs to a certain class of feasible, terminating grammars and all its semantic actions are terminating.