scholarly journals CFGExplorer: Designing a Visual Control Flow Analytics System around Basic Program Analysis Operations

2018 ◽  
Vol 37 (3) ◽  
pp. 453-464 ◽  
Author(s):  
Sabin Devkota ◽  
Katherine E. Isaacs
Keyword(s):  
Program Analysis ◽  
Basic Program ◽  
Visual Control ◽  
Control Flow

scholarly journals Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation

2001 ◽  
Vol 8 (54) ◽  
Author(s):  
Daniel Damian ◽  
Olivier Danvy
Keyword(s):  
Program Analysis ◽  
Partial Evaluation ◽  
Flow Analysis ◽  
Control Flow ◽  
Time Analysis ◽  
Binding Time ◽  
The Impact ◽  
Positive Effect ◽  
Binding Time Analysis ◽  
Control Flow Analysis

We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on control-flow analysis, a positive effect on binding-time analysis for traditional partial evaluation, and no effect on binding-time analysis for continuation-based partial evaluation: a monovariant control-flow analysis yields equivalent results on a direct-style program and on its CPS counterpart, a monovariant binding-time analysis yields less precise results on a direct-style program than on its CPS counterpart, and an enhanced monovariant binding-time analysis yields equivalent results on a direct-style program and on its CPS counterpart. Our proof technique amounts to constructing the CPS counterpart of flow information and of binding times.<br /> <br />Our results formalize and confirm a folklore theorem about traditional binding-time analysis, namely that CPS has a positive effect on binding times. What may be more surprising is that the benefit does not arise from a standard refinement of program analysis, as, for instance, duplicating continuations.<br /> <br />The present study is symptomatic of an unsettling property of program analyses: their quality is unpredictably vulnerable to syntactic accidents in source programs, i.e., to the way these programs are written. More reliable program analyses require a better understanding of the effect of syntactic change.

Layered Region Based Flow-Sensitive Demand-Driven Alias Analysis

2014 ◽  
Vol 577 ◽  
pp. 917-920
Author(s):  
Long Pang ◽  
Xiao Hong Su ◽  
Pei Jun Ma ◽  
Ling Ling Zhao
Keyword(s):  
Program Analysis ◽  
Control Flow ◽  
Alias Analysis ◽  
Reachability Problem ◽  
Analysis Algorithm ◽  
Context Free Language ◽  
Context Free ◽  
Free Language ◽  
Demand Driven Analysis

The pointer alias is indispensable for program analysis. Comparing to point-to set, it’s more efficient to formulate the alias as the context free language (CFL) reachability problem. However, the precision is limited to flow-insensitivity. To solve this problem, we propose a flow sensitive, demand-driven analysis algorithm for answering may-alias queries. First the partial single static assignment is used to discriminate the address-taken pointers. Then the order of control flow is encoded in the level linearization code to ease comparison. Finally, the query of alias in demand driven is converted into the search of CFL reachability with feasible flows. The experiments demonstrate the effectiveness of the proposed approach.

scholarly journals Scenario-Aware Program Specialization for Timing Predictability

2021 ◽  
Vol 18 (4) ◽  
pp. 1-26
Author(s):  
Joscha Benz ◽  
Oliver Bringmann
Keyword(s):  
Program Analysis ◽  
Control Flow ◽  
Wcet Analysis ◽  
Specific System ◽  
Worst Case ◽  
Program Specialization ◽  
Operating Modes ◽  
Source Level ◽  
Dependent Flow ◽  
Timing Simulation

The successful application of static program analysis strongly depends on flow facts of a program such as loop bounds, control-flow constraints, and operating modes. This problem heavily affects the design of real-time systems, since static program analyses are a prerequisite to determine the timing behavior of a program. For example, this becomes obvious in worst-case execution time (WCET) analysis, which is often infeasible without user-annotated flow facts. Moreover, many timing simulation approaches use statically derived timings of partial program paths to reduce simulation overhead. Annotating flow facts on binary or source level is either error-prone and tedious, or requires specialized compilers that can transform source-level annotations along with the program during optimization. To overcome these obstacles, so-called scenarios can be used. Scenarios are a design-time methodology that describe a set of possible system parameters, such as image resolutions, operating modes, or application-dependent flow facts. The information described by a scenario is unknown in general but known and constant for a specific system. In this article, 1 we present a methodology for scenario-aware program specialization to improve timing predictability. Moreover, we provide an implementation of this methodology for embedded software written in C/C++. We show the effectiveness of our approach by evaluating its impact on WCET analysis using almost all of TACLeBench–achieving an average reduction of WCET of 31%. In addition, we provide a thorough qualitative and evaluation-based comparison to closely related work, as well as two case studies.

scholarly journals Static Analysis for Java Servlets and JSP

2006 ◽  
Vol 13 (10) ◽  
Author(s):  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Program Analysis ◽  
Web Applications ◽  
Control Flow ◽  
Analysis Techniques ◽  
Session State ◽  
Context Free ◽  
Context Free Grammars

We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is well-formed and valid XML and ensuring consistency of XHTML form fields and session state. Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars. Together, this provides the necessary foundation concerning reasoning about output streams and application control flow.

scholarly journals Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis

2019 ◽  
Vol 19 (5-6) ◽  
pp. 990-1005
Author(s):  
JESÚS J. DOMÉNECH ◽  
JOHN P. GALLAGHER ◽  
SAMIR GENAIM
Keyword(s):  
Program Analysis ◽  
State Of The Art ◽  
Partial Evaluation ◽  
Linear Constraints ◽  
General Purpose ◽  
Control Flow ◽  
Program Transformations ◽  
Evaluation Algorithm ◽  
The Right ◽  
Flow Graphs

AbstractControl-flow refinement refers to program transformations whose purpose is to make implicit control-flow explicit, and is used in the context of program analysis to increase precision. Several techniques have been suggested for different programming models, typically tailored to improving precision for a particular analysis. In this paper we explore the use of partial evaluation of Horn clauses as a general-purpose technique for control-flow refinement for integer transitions systems. These are control-flow graphs where edges are annotated with linear constraints describing transitions between corresponding nodes, and they are used in many program analysis tools. Using partial evaluation for control-flow refinement has the clear advantage over other approaches in that soundness follows from the general properties of partial evaluation; in particular, properties such as termination and complexity are preserved. We use a partial evaluation algorithm incorporating property-based abstraction, and show how the right choice of properties allows us to prove termination and to infer complexity of challenging programs that cannot be handled by state-of-the-art tools. We report on the integration of the technique in a termination analyzer, and its use as a preprocessing step for several cost analyzers.

scholarly journals Static Analysis for Java Servlets and JSP

2006 ◽  
Vol 13 (8) ◽  
Author(s):  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Program Analysis ◽  
Web Applications ◽  
Control Flow ◽  
Analysis Techniques ◽  
Session State ◽  
Context Free ◽  
Context Free Grammars

We present an approach for statically reasoning about the behavior of Web applications that are developed using Java Servlets and JSP. Specifically, we attack the problems of guaranteeing that all output is well-formed and valid XML and ensuring consistency of XHTML form fields and session state. Our approach builds on a collection of program analysis techniques developed earlier in the JWIG and X<small>ACT</small> projects, combined with work on balanced context-free grammars. Together, this provides the necessary foundation concerning reasoning about output streams and application control flow.

scholarly journals Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation

2000 ◽  
Vol 7 (15) ◽  
Author(s):  
Daniel Damian ◽  
Olivier Danvy
Keyword(s):  
Program Analysis ◽  
Flow Analysis ◽  
Control Flow ◽  
Time Analysis ◽  
Flow Information ◽  
Binding Time ◽  
The Impact ◽  
Positive Effect ◽  
Binding Time Analysis ◽  
Control Flow Analysis

We show that a non-duplicating CPS transformation has no effect on control-flow analysis and that it has a positive effect on binding-time analysis: a monovariant control-flow analysis yields equivalent results on a direct-style program<br />and on its CPS counterpart, and a monovariant binding-time analysis yields more precise results on a CPS program than on its direct-style counterpart. Our proof technique amounts to constructing the continuation-passing style (CPS) counterpart of flow information and of binding times.<br />Our results confirm a folklore theorem about binding-time analysis, namely<br />that CPS has a positive effect on binding times. What may be more surprising is that this benefit holds even if contexts or continuations are not duplicated. The present study is symptomatic of an unsettling property of program analyses: their quality is unpredictably vulnerable to syntactic accidents in source programs, i.e., to the way these programs are written. More reliable program analyses require a better understanding of the effect of syntactic change.

scholarly journals An Approach to Convert XMI Representation of UML 2.x Interaction Diagram into Control Flow Graph

2012 ◽  
Vol 2012 ◽  
pp. 1-22 ◽  
Author(s):  
Debasish Kundu ◽  
Debasis Samanta ◽  
Rajib Mall
Keyword(s):  
Software Engineering ◽  
Program Analysis ◽  
Control Flow ◽  
Control Flow Graph ◽  
Modeling Tools ◽  
Flow Graph ◽  
Interaction Diagram ◽  
Coverage Analysis ◽  
Flow Information ◽  
Software Practitioners

For automation of many software engineering tasks such as program analysis, testing, and coverage analysis, it is necessary to construct a control flow graph. With the advancement of UML, software practitioners advocate to construct control flow graph from some of the UML design artifacts. UML 2.x supports the modeling of control flow information in interaction diagram by means of message sequences and different types of fragments like alt, opt, break, loop, and so forth. Leading UML modeling tools, namely MagicDraw, IBM's Rational, and so forth export models in XMI format. Construction of control flow graph from the XMI representation of an interaction diagram is not straightforward as model elements of interaction diagram are captured in XMI by means of values of attributes of multiple tagged elements and correlations among these tagged elements is not explicitly specified. This paper proposes an approach for construction of control flow graph from XMI representation of UML 2.x interaction diagram. A prototype tool based on our approach has been developed which can be plugged in any computer-aided software engineering tool.

scholarly journals PERANCANGAN PROGRAM APLIKASI HIDROGRAF SATUAN SINTESIS (HSS) DENGAN METODE GAMA 1, NAKAYASU, DAN HSS ITB 1

2016 ◽  
Vol 18 (1) ◽  
Author(s):  
Enung Enung
Keyword(s):  
Programming Language ◽  
Program Analysis ◽  
Secondary Data ◽  
Visual Basic ◽  
Basic Program ◽  
Computer Application ◽  
Unit Hydrograph ◽  
Application Program ◽  
Synthetic Unit Hydrograph ◽  
Unit Hydrographs

This paper present about design of  Unit hydrographs (UH) application program using three methods of Synthetic Unit Hydrograph namely Gama 1, ITB 1, and Nakayasu. Unit hydrographs are either determined from gauged data or derived using empirically-based synthetic unit hydrograph procedures. In Indonesia, the discharge records may not be available either for several locations or for long time scales, and therefore synthetic unit hydrographs are crucial in flood and water re-sources management. Computer programs were developed to provide a means for rapid analysis. of rainfall and run off data. The purpose of this research is to design computer application program analysis based on three methods of Synthetic Unit Hydrograph namely Gama 1, ITB 1, and Nakayasu. This computer application program use Visual Basic 6.0 as the programming language. This research began from literature studies, lay out design of the display program, the developed of the algorithm, and then carried out using the programming language Visual Basic program, then perform verification and validation program using secondary data. The accomplished results show that computer application program namely Synthetic Unit Hydrograph Program can be used to analyze unit hydrograph which show in table and graph.

Sign in / Sign up

Export Citation Format

Share Document