Overlapping Flows
| العنوان: | Overlapping Flows |
|---|---|
| المؤلفون: | Khanfar, Husni |
| مصطلحات موضوعية: | Static Program Analysis, Control Dependence, Demand-Driven, Predicated Code Block (PCB) graph, Set of Overlapping Flows (SOF), Software Maintenance, Control Flow Graph. |
| الوصف: | The Set of Overlapping Flows (SOF) is a data structure that consists of program flows wherein each flow overlaps or is overlapped with at least one other flow inthe set. This data structure enables us to build approaches to computing the control dependencies in unstructured programs on demand. Forming this data structure on demandis challenging because it requires checking the overlap between each flow in this set andeach flow in the program under analysis. As a result, any static program analysis approachbuilt on this data-structured foundation is expensive in terms of time. It needs better timecomplexity.Our previous works presented an invented program representation for on-demand computations: the Predicted Code Block graph (PCB graph). This graph considers conditionalstatements as its main blocks. This work enhances the PCB graph to obtain any demandedSOF from it. The experimental evaluations show that computing the SOFs from the PCBgraph is fast and scalable. |
| وصف الملف: | electronic |
| الوصول الحر: | https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-66333Test https://mdh.diva-portal.org/smash/get/diva2:1848158/FULLTEXT01.pdfTest |
| قاعدة البيانات: | SwePub |
| الوصف غير متاح. |