Global value numbers and redundant computations

Rosen, Barry K.; Wegman, Mark N.; Zadeck, F. Kenneth

doi:10.1145/73560.73562

Cited by 345 publications

(154 citation statements)

References 18 publications

Supporting

Mentioning

149

Contrasting

Unclassified

Order By: Relevance

“…The Static Single Assignment (SSA) form is an intermediate representation that is used to facilitate program analysis and optimization [12], [13]. The SSA form has the property that each variable is defined exactly once.…”

Section: Concurrent Static Single Assignment (Cssa)mentioning

confidence: 99%

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Wang

Xing

Li³

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYWeb Service Business Process Execution Language (BPEL) has become the de facto standard for developing instant serviceoriented workflow applications in open environment. The correctness and reliability of BPEL processes have gained increasing concerns. However, the unique features (e.g., dead path elimination (DPE) semantics, parallelism, etc.) of BPEL language have raised enormous problems to it, especially in path feasibility analysis of BPEL processes. Path feasibility analysis of BPEL processes is the basis of BPEL testing, for it relates to the test case generation. Since BPEL processes support both parallelism and DPE semantics, existing techniques can't be directly applied to its path feasibility analysis. To address this problem, we present a novel technique to analyze the path feasibility for BPEL processes. First, to tackle unique features mentioned above, we transform a BPEL process into an intermediary model -BPEL control flow graph, which is proposed to abstract the execution flow of BPEL processes. Second, based on this abstraction, we symbolically encode every path of BPEL processes as some Satisfiability formulas. Finally, we solve these formulas with the help of Satisfiability Modulo Theory (SMT) solvers and the feasible paths of BPEL processes are obtained. We illustrate the applicability and feasibility of our technique through a case study.

show abstract

Section: Concurrent Static Single Assignment (Cssa)mentioning

confidence: 99%

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Wang

Xing

Li³

et al. 2016

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…We use a BMC approach to formalize LLVM-IR into logic: given an imperative, non-concurrent program P and an unrolling bound k, we unroll loops and recursive functions in the program with respect to k and transform the unrolled program into Static Single Assignment (SSA) [21] form. The transformations for loop unrolling and to establish SSA form are provided by the LLVM compiler infrastructure.…”

Section: Formalizing Llvm-ir Into Logic Using Bmcmentioning

confidence: 99%

FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation

Riener¹,

Fey

2012

Model Checking Software

View full text Add to dashboard Cite

Abstract. We present FAuST, an extensible framework for Formal verification, AUtomated debugging, and Software Test generation. Our framework uses a highly customizeable Bounded Model Checking (BMC) algorithm for formal reasoning about software programs and provides different applications, e.g., property checking, functional equivalence checking, test case generation, and fault localization. FAuST supports dynamic execution and multi-threaded symbolic reasoning using the LLVM compiler infrastructure and an abstraction layer for decision procedures.

show abstract

“…Figure 5 (b) shows W ∈ W as an example of SSA-circular graph. W l = {(18, 1), (21,5), (22, 7)}, W i = {(6, 9), (8,11), (10, 13)} ∪ W z , and W z = { (15,18), (12,21), (14,22)}. Notice that for every interval (y, u) ∈ W l , there is an interval (d, y) ∈ W z .…”

Section: From Circular Graphs To Ssa-circular Graphsmentioning

confidence: 99%

“…Static single assignment (SSA) form [21] is an intermediate representation used in many compilers, including gcc version 4. If a program is in SSA form, then every variable is assigned exactly once, and each use refers to exactly one definition.…”

Section: Introductionmentioning

confidence: 99%

Register Allocation After Classical SSA Elimination is NP-Complete

Pereira

Palsberg

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference graph of a program in static single assignment (SSA) form is chordal and therefore colorable in linear time. Can we use the result of Bouchez et al. to do register allocation in polynomial time by first transforming the program to SSA form, then performing register allocation, and finally doing the classical SSA elimination that replaces φ-functions with copy instructions? In this paper we show that the answer is no, unless P = NP: register allocation after classical SSA elimination is NP-complete. Chaitin's proof technique does not work for programs after classical SSA elimination; instead we use a reduction from the graph coloring problem for circular arc graphs.

show abstract

Global value numbers and redundant computations

Cited by 345 publications

References 18 publications

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

Path Feasibility Analysis of BPEL Processes under Dead Path Elimination Semantics

FAuST: A Framework for Formal Verification, Automated Debugging, and Software Test Generation

Register Allocation After Classical SSA Elimination is NP-Complete

Contact Info

Product

Resources

About