Aspect-Oriented Programming (AOP) focuses on precise constructs for modularization of the crosscutting concerns of a program. Crosscutting concerns can be defined as the functionalities that navigate the principal decomposition of software and therefore cannot be assigned to a single modular unit. Aspect mining attempts to find and isolate crosscutting concerns dwelling in legacy systems which ...

-Automated test case generation is an efficient approach for software testing. Slicing of program provides ease to testability and enhances debugging capacity. To generate the dynamic slice, slicing criterion is required in which the input data parameter is the essential component. Most of the research work focuses on deriving the input by random consideration but it simply takes a longest peri...

IC3 is a recently proposed verification technique for the analysis of sequential circuits. IC3 incrementally overapproximates the state space, refuting potential violations to the property at hand by constructing relative inductive blocking clauses. The algorithm relies on aggressive use of Boolean satisfiability (SAT) techniques, and has demonstrated impressive effectiveness. In this paper, we...

Fault localization is a process to find the location of faults. It determines the root cause of the failure. It identifies the causes of abnormal behaviour of a faulty program. It identifies exactly where the bugs are. Existing fault localization techniques are Slice based technique, ProgramSpectrum based Technique, Statistics Based Technique, Program State Based Technique, Machine learning bas...

A common task for security analysts is to determine whether potentially unsafe code constructs (as found by static analysis or code review) can be triggered by an attackercontrolled input to the program under analysis. We refer to this problem as proof-of-concept (POC) exploit generation. Exploit generation is challenging to automate because it requires precise reasoning across a large code bas...

Introduction and basic definitions Finding the independent parts of a Control Flow Graph (CFG) is important for exposing program parallelism. Two types of instruction dependences constrain the order of execution, dataand control-dependences (CD). Abstracting from data-dependences, it is useful to study the idealized parallelism allowed by program control structure. CD’s are assumed as the depen...

Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G’s path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum...

Precise operation of real-time systems depends on functionally correct computations that are delivered within imposed timing constraints. These temporal requirements are often modelled and verified assuming a priori knowledge of the Worst-Case Execution Time (WCET) of each task. Due to complexities resolving the actual WCET, estimates normally suffice. These estimates should be safe, so as not ...

Subverting the flow of instructions (e.g., by use code-reuse attacks) still poses a serious threat to security today’s systems. Various control integrity (CFI) schemes have been proposed as powerful technique detect and mitigate such attacks. In recent years, many hardware-assisted implementations CFI enforcement based on graphs (CFGs) presented academia. Such approaches check whether transfers...

Most modern compilers are based on variants of the Control Flow Graph. Developments on this representation—specifically, SSA form and the Program Dependence Graph (PDG)—have focused on adding and refining data dependence information, and these suggest the next step is to use a purely data-dependence-based representation such as the VDG (Ernst et al.) or VSDG (Johnson et al.). This thesis studie...