An efficient method of computing static single assignment form

Cytron, Ron K.; Ferrante, Jeanne; Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth

doi:10.1145/75277.75280

Cited by 359 publications

(192 citation statements)

References 20 publications

Supporting

Mentioning

185

Contrasting

Unclassified

Order By: Relevance

“…a[i+2] = avg * 3; avg += *p++ << 2; (5) } *p--= avg * 3; (6) if (avg < error) } (7) avg -= a[i+1] -error/2; if (avg < error) (8) else avg -= *p++ -error/2; (9) avg -= a[i+2] -error; else { (10) } p += 1; (11) avg -= *p -error; (12) } (13) } (a) (b) First of all assume, for the rest of this paper, that the array data type is a memory word (a typical characteristic of embedded programs). Moreover, assume that each array reference is atomic (i.e.…”

Section: Basic Conceptsmentioning

confidence: 99%

“…As a consequence, the compiler can decide, at compile time, between using auto-increment (decrement) mode for a, or inserting an update instruction on the path from a to b. This requirement can be satisfied if the references in the CFG are in Single Reference Form (SRF) [7], a variation of Static Single Assignment (SSA) Form [8].…”

Section: The Merge Operator (R 1 S)mentioning

confidence: 99%

“…We call this algorithm the LRO Algorithm, and show its pseudo-code in Alg. (4) for all but the last vertex vp ∈ DG φ , according to LRO, do (5) let (v p,v q ) be the last edge incident to v p (6) for j ← 1 to m do (7) min ← +∞ (8) for i ← 1 to m do (9) if…”

Section: The Case When Dg φ Is a Treementioning

confidence: 99%

See 2 more Smart Citations

Optimal Live Range Merge for Address Register Allocation in Embedded Programs

Ottoni

Rigo

Araújo

et al. 2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The increasing demand for wireless devices running mobile applications has renewed the interest on the research of high performance low power processors that can be programmed using very compact code. One way to achieve this goal is to design specialized processors with short instruction formats and shallow pipelines. Given that it enables such architectural features, indirect addressing is the most used addressing mode in embedded programs. This paper analyzes the problem of allocating address registers to array references in loops using auto-increment addressing mode. It leverages on previous work, which is based on a heuristic that merges address register live ranges. We prove, for the first time, that the merge operation is NP-hard in general, and show the existence of an optimal linear-time algorithm, based on dynamic programming, for a special case of the problem.

show abstract

Section: Basic Conceptsmentioning

confidence: 99%

Section: The Merge Operator (R 1 S)mentioning

confidence: 99%

See 1 more Smart Citation

Optimal Live Range Merge for Address Register Allocation in Embedded Programs

Ottoni

Rigo

Araújo

et al. 2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…First, in SSA, each programmer-specified use of a variable is reached by exactly one assignment of that variable, and the program contains φ functions that distinguish values of variables transmitted on distinct incoming control flow edges [20]. In SSA-based pointer analysis, the program is first translated to SSA form and the points-to graphs contain only the information about the SSA program.…”

Section: B Basic Ideamentioning

confidence: 99%

Safe Memory-Leak Fixing for C Programs

Gao

Xiong

et al. 2015

2015 IEEE/ACM 37th IEEE International Conference on Software Engineering

View full text Add to dashboard Cite

Abstract-Automatic bug fixing has become a promising direction for reducing manual effort in debugging. However, general approaches to automatic bug fixing may face some fundamental difficulties. In this paper, we argue that automatic fixing of specific types of bugs can be a useful complement.This paper reports our first attempt towards automatically fixing memory leaks in C programs. Our approach generates only safe fixes, which are guaranteed not to interrupt normal execution of the program. To design such an approach, we have to deal with several challenging problems such as inter-procedural leaks, global variables, loops, and leaks from multiple allocations. We propose solutions to all the problems and integrate the solutions into a coherent approach.We implemented our inter-procedural memory leak fixing into a tool named LeakF ix and evaluated LeakF ix on 15 programs with 522k lines of code. Our evaluation shows that LeakF ix is able to successfully fix a substantial number of memory leaks, and LeakF ix is scalable for large applications.

show abstract

“…Instead we produce a smaller program representation by not explicitly enumerating all paths but following the concept of Φ-nodes (known from static single assignment [10]) to merge the effects of the branches of an if-statement. This approach is also similar to the weakest-precondition-calculus optimization presented in [12].…”

Section: From Plc Code To Model Checker Inputmentioning

confidence: 99%

Regression Verification for Programmable Logic Controller Software

Beckert

Ulbrich

Vogel‐Heuser

et al. 2015

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Automated production systems are usually driven by Programmable Logic Controllers (PLCs). These systems are long-living -yet have to adapt to changing requirements over time. This paper presents a novel method for regression verification of PLC code, which allows one to prove that a new revision of the plant's software does not break existing intended behavior. Our main contribution is the design, implementation, and evaluation of a regression verification method for PLC code. We also clarify and define the notion of program equivalence for reactive PLC code. Core elements of our method are a translation of PLC code into the SMV input language for model checkers, the adaptation of the coupling invariants concept to reactive systems, and the implementation of a toolchain using a model checker supporting invariant generation. We have successfully evaluated our approach using the Pick-and-Place Unit benchmark case study.

show abstract

An efficient method of computing static single assignment form

Cited by 359 publications

References 20 publications

Optimal Live Range Merge for Address Register Allocation in Embedded Programs

Optimal Live Range Merge for Address Register Allocation in Embedded Programs

Safe Memory-Leak Fixing for C Programs

Regression Verification for Programmable Logic Controller Software

Contact Info

Product

Resources

About