Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"call graph"”.

  1. Funqual: User-Defined, Statically-Checked Call Graph Constraints in C++

    … ``in the wild'' and checks that the function call graph follows a set of rules which can be defined by the user. This sort of analysis can help the programmer to avoid errors such as accidentally calling blocking functions in time-sensitive contexts or accidentally allocating memory in …

    calpoly Repository record for Funqual: User-Defined, Statically-Checked Call Graph Constraints in C++ (opens in a new tab)

  2. A Feature-Based Call Graph Distance Measure for Program Similarity Analysis

    … programs is a complex task. By extracting call graphs (graphs of caller-callee relationships of the program's functions, where nodes denote functions and directed edges denote function calls) from the programs, the similarity measurement can be changed into a graph problem. Previously, …

    helsinki Repository record for A Feature-Based Call Graph Distance Measure for Program Similarity Analysis (opens in a new tab)

  3. Software Analytics for Improving Program Comprehension

    … to facilitate program comprehensions, such as call graphs, which represent the system’s structure and its implementation as a directed graph. Furthermore, some studies focused on semantic enrichment of the software system problems using systematic learning analytics, including machine learning …

    umkc Repository record for Software Analytics for Improving Program Comprehension (opens in a new tab)

  4. Dynamic Model Generation and Semantic Search for Open Source Projects using Big Data Analytics

    … information from the source code using a call graph. A call graph is a directed graph that represents the execution logic of the program and helps with analyzing the relationships between various classes. The extracted data is then transformed using Natural language processing (NLP) [15] …

    umkc Repository record for Dynamic Model Generation and Semantic Search for Open Source Projects using Big Data Analytics (opens in a new tab)

  5. Understanding asynchronous code

    … thesis presents a programming editor extension called Theseus that uses program tracing to provide real-time in-editor feedback so that programmers can answer questions quickly as they write new code and interact with their application. Theseus augments the call graph with semantic edges that …

    mit Repository record for Understanding asynchronous code (opens in a new tab)

  6. Secure and Efficient In-Process Monitor and Multi-Variant Execution

    … of recent MVX defenses through selective program call graph protection and in-process monitoring, maintaining security guarantees either by breaking attacker assumptions or creating a scenario where a particular attack only works on a single variant.

    vt Repository record for Secure and Efficient In-Process Monitor and Multi-Variant Execution (opens in a new tab)

  7. Static Analyses of Interlanguage Interoperations

    … at the same time, it becomes difficult to statically analyze these applications. The amalgamation of two languages in a single application may introduce bugs ranging from type-mismatch to security vulnerabilities. Therefore, it is necessary to develop static analysis techniques to aid developers …

    passau-thes Repository record for Static Analyses of Interlanguage Interoperations (opens in a new tab)

  8. HyperSketch : Language for Implementing Generic Neuro-Symbolic Program Synthesizers

    … that can perform the following tasks: (1) call Sketch’s solver on a particular sketch, (2) concretize a sketch function, (3) clone a sketch function, (4) rewire the call-graph of the sketch, (5) manipulate input files, and (6) evaluate sketches. We expose these primitives as part of an …

    mit Repository record for HyperSketch : Language for Implementing Generic Neuro-Symbolic Program Synthesizers (opens in a new tab)

  9. Advanced Memory Data Structures for Scalable Event Trace Analysis

    … technique is based on the novel Complete Call Graph (CCG) data structure which allows domain specific data compression for event traces in a combination of lossless and lossy methods. All deviations due to lossy data compression can be controlled by constant bounds. The compression of the …

    qucosa-diss

  10. Automated End-to-End Management of the Deep Learning Lifecycle

    … named ModelKB. ModelKB can \textit{automatically} manage the modeling lifecycle end-to-end, including (1) monitoring and tracking experiments; (2) visualizing, searching for, and comparing models and experiments; (3) deploying models locally and on the cloud; and (4) sharing and publishing …

    umkc Repository record for Automated End-to-End Management of the Deep Learning Lifecycle (opens in a new tab)