interprocedural

---

interprocedural

Tag #interprocedural

144 papers:

CC-2019-LavaeeCD #layout #named #optimisation

Codestitcher: inter-procedural basic block layout optimization (RL, JC, CD), pp. 65–75.

VMCAI-2019-BoutonnetH #abstract interpretation #program analysis #relational

Disjunctive Relational Abstract Interpretation for Interprocedural Program Analysis (RB, NH), pp. 136–159.

PLDI-2018-LiuW #analysis #bound #concurrent #named #source code

CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.

ECOOP-2017-SaleilF #higher-order #static analysis

Interprocedural Specialization of Higher-Order Dynamic Languages Without Static Analysis (BS, MF), p. 23.

ASPLOS-2017-WangHZXS #analysis #graph #named #scalability

Graspan: A Single-machine Disk-based Graph System for Interprocedural Static Analyses of Large-scale Systems Code (KW0, AH0, ZZ0, G(X, AAS), pp. 389–404.

ECOOP-2016-Chevalier-Boisvert #analysis #javascript #source code

Interprocedural Type Specialization of JavaScript Programs Without Type Analysis (MCB, MF), p. 24.

SAS-2016-FrielinghausSV #analysis #termination

Enforcing Termination of Interprocedural Analysis (SSF, HS, RV), pp. 447–468.

CC-2016-SuiX #analysis #named

SVF: interprocedural static value-flow analysis in LLVM (YS, JX), pp. 265–266.

OOPSLA-2015-FengWDL #control flow

EXPLORER : query- and demand-driven exploration of interprocedural control flow properties (YF, XW, ID, CL), pp. 520–534.

POPL-2015-ChatterjeePV #analysis

Quantitative Interprocedural Analysis (KC, AP, YV), pp. 539–551.

SAS-2015-AlbertGG #analysis #source code

May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization (EA, SG, PG), pp. 72–89.

ASE-2015-ChenDKSW #proving #termination

Synthesising Interprocedural Bit-Precise Termination Proofs (T) (HYC, CD, DK, PS, BW), pp. 53–64.

ESOP-2015-FrielinghausPS

Inter-procedural Two-Variable Herbrand Equalities (SSF, MP, HS), pp. 457–482.

SCAM-2014-AbadiF #algorithm #on-demand #parallel

A Parallel On-Demand Algorithm for Computing Interprocedural Dominators (AA, YAF), pp. 235–244.

LATA-2014-SeidlK #analysis #data flow #xml

Interprocedural Information Flow Analysis of XML Processors (HS, MK), pp. 34–61.

IFM-2014-AsavoaeAR #semantics #slicing #towards

Towards a Formal Semantics-Based Technique for Interprocedural Slicing (IMA, MA, AR), pp. 291–306.

PLDI-2014-ZhangMNY #analysis #bottom-up #hybrid #top-down

Hybrid top-down and bottom-up interprocedural analysis (XZ, RM, MN, HY), p. 28.

ICSE-2014-LeP #control flow #graph #multi #verification

Patch verification via multiversion interprocedural control flow graphs (WL, SDP), pp. 1047–1058.

ICSE-2014-NguyenNNN #javascript #mining #web

Mining interprocedural, data-oriented usage patterns in JavaScript web applications (HVN, HAN, ATN, TNN), pp. 791–802.

ESOP-2014-MangalNY #analysis

A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join (RM, MN, HY), pp. 513–533.

ICPC-2012-IshioEI #data flow #lightweight #source code #visualisation

A lightweight visualization of interprocedural data-flow paths for source code reading (TI, SE, KI), pp. 37–46.

SEKE-2012-QiXW #concurrent #graph #reachability #slicing #source code

Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.

PLDI-2012-AlbarghouthiKNR #analysis #top-down

Parallelizing top-down interprocedural analyses (AA, RK, AVN, SKR), pp. 217–228.

CC-2012-PetersenG #garbage collection

GC-Safe Interprocedural Unboxing (LP, NG), pp. 165–184.

VMCAI-2012-AlbarghouthiGC #algorithm #named #verification

Whale: An Interpolation-Based Algorithm for Inter-procedural Verification (AA, AG, MC), pp. 39–55.

SEKE-2011-WangL #profiling

A Technology of Profiling Inter-procedural Paths (LW, BL), pp. 31–36.

ECOOP-2011-PrabhuMBIG #analysis #c++ #exception

Interprocedural Exception Analysis for C++ (PP, NM, GB, FI, AG), pp. 583–608.

PLDI-2011-BouajjaniDES #analysis #on the #source code

On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.

ESOP-2011-SotinJ #analysis #pointer #precise #stack

Precise Interprocedural Analysis in the Presence of Pointers to the Stack (PS, BJ), pp. 459–479.

ICSM-2010-Letarte #model checking #performance #static analysis

Conversion of fast inter-procedural static analysis to model checking (DL), pp. 1–2.

PASTE-2010-CalmanZ #analysis #induction #information retrieval

Interprocedural induction variable analysis based on interprocedural SSA form IR (SC, JZ), pp. 37–44.

SAS-2010-JensenMT #analysis #lazy evaluation

Interprocedural Analysis with Lazy Propagation (SHJ, AM, PT), pp. 320–339.

ASE-2010-Letarte #analysis #graph #model checking #precise #representation

Model checking graph representation of precise boolean inter-procedural flow analysis (DL), pp. 511–516.

ICSE-2010-TorlakC #detection #effectiveness

Effective interprocedural resource leak detection (ET, SC), pp. 535–544.

WCRE-1999-LetarteM99a #modelling #php

Extraction of Inter-procedural Simple Role Privilege Models from PHP Code (DL, EM), pp. 187–191.

SEFM-2009-Jeannet #concurrent #relational #source code #verification

Relational Interprocedural Verification of Concurrent Programs (BJ), pp. 83–92.

SAS-2009-CalmanZ

Increasing the Scope and Resolution of Interprocedural Static Single Assignment (SC, JZ), pp. 154–170.

ICSE-2009-NandaS #analysis #java

Accurate Interprocedural Null-Dereference Analysis for Java (MGN, SS), pp. 133–143.

FoSSaCS-2009-KuhnrichSSK #analysis #data flow #infinity

Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (MK, SS, JS, SK), pp. 440–455.

OOPSLA-2008-WiedermannIC #persistent #query

Interprocedural query extraction for transparent persistence (BW, AI, WRC), pp. 19–36.

CC-2008-KhedkerK #analysis #data flow #performance #precise #string

Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method (UPK, BK), pp. 213–228.

ESOP-2008-Muller-OlmS #performance

Upper Adjoints for Fast Inter-procedural Variable Equalities (MMO, HS), pp. 178–192.

TACAS-2008-LalTKR #analysis #bound #concurrent #source code

Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.

ICSM-2007-BernardiL #aspect-oriented #control flow #graph #maintenance

An Interprocedural Aspect Control Flow Graph to Support the Maintenance of Aspect Oriented Systems (MLB, GADL), pp. 435–444.

WCRE-2007-StaigerVKW

Interprocedural Static Single Assignment Form (SS, GV, SK, EW), pp. 1–10.

POPL-2007-JhalaM #analysis #source code

Interprocedural analysis of asynchronous programs (RJ, RM), pp. 339–350.

ESOP-2007-GulwaniT #analysis #summary

Computing Procedure Summaries for Interprocedural Analysis (SG, AT), pp. 253–267.

ISSTA-2007-TombBV #detection #fault #program analysis #runtime

Variably interprocedural program analysis for runtime error detection (AT, GPB, WV), pp. 97–107.

TestCom-FATES-2007-ConstantJJ #automation #generative #specification #testing

Automatic Test Generation from Interprocedural Specifications (CC, BJ, TJ), pp. 41–57.

SAS-2006-GotsmanBC #abstraction #analysis

Interprocedural Shape Analysis with Separated Heap Abstractions (AG, JB, BC), pp. 240–260.

CC-2006-RountevKM #analysis #data flow #library #scalability

Interprocedural Dataflow Analysis in the Presence of Large Libraries (AR, SK, TJM), pp. 2–16.

CC-2006-TokGL #analysis #data flow #performance #pointer

Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers (TBT, SZG, CL), pp. 17–31.

DATE-2006-ScharwachterHLAM #hardware #multi #network #optimisation #thread #using

An interprocedural code optimization technique for network processors using hardware multi-threading support (HS, MH, RL, GA, HM), pp. 919–924.

ECOOP-2005-PistoiaFKS #analysis #detection

Interprocedural Analysis for Privileged Code Placement and Tainted Variable Detection (MP, RJF, LK, VCS), pp. 362–386.

POPL-2005-GulwaniN #analysis #precise #random #using

Precise interprocedural analysis using random interpretation (SG, GCN), pp. 324–337.

SAS-2005-Muller-OlmS #analysis #framework

A Generic Framework for Interprocedural Analysis of Numerical Properties (MMO, HS), pp. 235–250.

SAS-2005-RinetzkySY #analysis #source code

Interprocedural Shape Analysis for Cutpoint-Free Programs (NR, MS, EY), pp. 284–302.

CC-2005-LeLH #jit #optimisation #using

Using Inter-Procedural Side-Effect Information in JIT Optimizations (AL, OL, LJH), pp. 287–304.

ESOP-2005-Muller-OlmSS

Interprocedural Herbrand Equalities (MMO, HS, BS), pp. 31–45.

CAV-2005-ConwayNDE #algorithm #analysis #incremental #safety

Incremental Algorithms for Inter-procedural Analysis of Safety Properties (CLC, KSN, DD, SAE), pp. 449–461.

SCAM-2004-Gallagher #slicing

Some Notes on Interprocedural Program Slicing (KBG), pp. 36–42.

POPL-2004-Muller-OlmS #algebra #analysis #linear #precise

Precise interprocedural analysis through linear algebra (MMO, HS), pp. 330–341.

SAS-2004-JeannetLRS #analysis #approach #relational

A Relational Approach to Interprocedural Shape Analysis (BJ, AL, TWR, SS), pp. 246–264.

SCAM-2003-KissJLG #bytecode #slicing

Interprocedural Static Slicing of Binary Executables (ÁK, JJ, GL, TG), p. 118–?.

POPL-2003-GheorghioiuSR #analysis

Interprocedural compatibility analysis for static object preallocation (OG, AS, MCR), pp. 273–284.

SAS-2003-RepsSJ #analysis #automaton #data flow

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis (TWR, SS, SJ), pp. 189–213.

ESEC-FSE-2003-SyD #consistency #generative #testing

Consistency techniques for interprocedural test data generation (NTS, YD), pp. 108–117.

CC-2003-MelskiR

The Interprocedural Express-Lane Transformation (DM, TWR), pp. 200–216.

DAC-2003-ZhangCKK #embedded #optimisation #performance

Interprocedural optimizations for improving data cache performance of array-intensive embedded applications (WZ, GC, MTK, MK), pp. 887–892.

SCAM-2002-HarmanHMZDDO #slicing

An Interprocedural Amorphous Slicer for WSL (MH, LH, MM, XZ, SD, MD, LO), pp. 105–114.

WCRE-2002-OuarbyaDDHF #slicing

A Denotational Interprocedural Program Slicer (LO, SD, MD, MH, CF), p. 181–?.

ASE-2002-Griche #automation #generative #testing

Automatic Inter-Procedural Test Case Generation (KCG), p. 316.

PASTE-2001-BallR #data flow #named

Bebop: a path-sensitive interprocedural dataflow engine (TB, SKR), pp. 97–103.

OOPSLA-2001-PechtchanskiS #analysis #framework

Dynamic Optimistic Interprocedural Analysis: A Framework and an Application (IP, VS), pp. 195–210.

SAS-2001-LiangH #analysis #performance #pointer

Efficient Computation of Parameterized Pointer Information for Interprocedural Analyses (DL, MJH), pp. 279–298.

SAC-2001-ChangJYC #analysis #exception #java

Interprocedural exception analysis for Java (BMC, JWJ, KY, KMC), pp. 620–625.

CC-2001-RinetzkyS #analysis #recursion #source code

Interprocedural Shape Analysis for Recursive Programs (NR, SS), pp. 133–149.

PLDI-2000-ChengH #analysis #composition #design #evaluation #implementation #pointer #using

Modular interprocedural pointer analysis using access paths: design, implementation, and evaluation (BCC, WmWH), pp. 57–69.

PLDI-2000-GhemawatRS #analysis #low cost

Field analysis: getting useful and low-cost interprocedural information (SG, KHR, DJS), pp. 334–344.

PLDI-2000-SreedharBC #framework #optimisation

A framework for interprocedural optimization in the presence of dynamic class loading (VCS, MGB, JDC), pp. 196–207.

POPL-2000-EsparzaP #algorithm #graph #parallel #performance

Efficient Algorithms for pre^* and post^* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.

ESOP-2000-SeidlS #analysis #constraints #parallel #source code

Constraint-Based Inter-Procedural Analysis of Parallel Programs (HS, BS), pp. 351–365.

ICSM-1999-LiangH #pointer #recursion #slicing

Reuse-Driven Interprocedural Slicing in the Presence of Pointers and Recursion (DL, MJH), p. 421–?.

AdaEurope-1999-BliebergerBS #ada #alias #evaluation #source code #symbolic computation

Interprocedural Symbolic Evaluation of Ada Programs with Aliases (JB, BB, BS), pp. 136–145.

ICSE-1999-SinhaHR #control flow #slicing #source code

System-Dependence-Graph-Based Slicing of Programs with Arbitrary Interprocedural Control Flow (SS, MJH, GR), pp. 432–441.

CC-1999-Martin #analysis #comparison #functional #string

Experimental Comparison of call string and functional Approaches to Interprocedural Analysis (FM), pp. 63–75.

CC-1999-MelskiR #profiling

Interprocedural Path Profiling (DM, TWR), pp. 47–62.

PPoPP-1999-LiaoDBGL #interactive

SUIF Explorer: An Interactive and Interprocedural Parallelizer (SWL, AD, RPBJ, AMG, MSL), pp. 37–48.

ESOP-1999-NielsonN #analysis #control flow

Interprocedural Control Flow Analysis (FN, HRN), pp. 20–39.

FoSSaCS-1999-EsparzaK #analysis #approach #data flow

An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis (JE, JK), pp. 14–30.

POPL-1998-DeFouwGC #analysis #performance

Fast Interprocedural Class Analysis (GD, DG, CC), pp. 222–236.

ICSE-1998-HarroldC #slicing

Reuse-Driven Interprocedural Slicing (MJH, NC), pp. 74–83.

ISSTA-1998-HarroldRS #dependence

Computation of Interprocedural Control Dependence (MJH, GR, SS), pp. 11–20.

PLDI-1997-BodikGS #branch

Interprocedural Conditional Branch Elimination (RB, RG, MLS), pp. 146–158.

PLDI-1997-Goodwin #analysis #data flow #execution

Interprocedural Dataflow Analysis in an Executable Optimizer (DWG), pp. 122–133.

WPC-1996-BlazyF #analysis #comprehension

Interprocedural analysis for program comprehension by specialization (SB, PF), p. 133–?.

AdaEurope-1996-BirusCS #optimisation

Interprocedural Call Optimization (TB, CC, DS), pp. 319–329.

POPL-1996-KurlanderF

Minimum Cost Interprocedural Register Allocation (SMK, CNF), pp. 230–241.

TAPSOFT-J-1995-SagivRH96 #analysis #constant #data flow #precise

Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation (SS, TWR, SH), pp. 131–170.

JICSLP-1996-Neumerkel #text-to-text

Interprocedural Register Allocation for the WAM based on Source to Source Transformations (UN), pp. 127–141.

FPCA-1995-Boquist #functional #lazy evaluation

Interprocedural Register Allocation for Lazy Functional Languages (UB), pp. 270–281.

PLDI-1995-AgrawalSD #compilation #distributed #memory management

Interprocedural Partial Redundancy Elimination and its Application to Distributed Memory Compilation (GA, JHS, RD), pp. 258–269.

PLDI-1995-CariniH #constant

Flow-Sensitive Interprocedural Constant Propagation (PRC, MH), pp. 23–31.

POPL-1995-DuesterwaldGS #data flow

Demand-driven Computation of Interprocedural Data Flow (ED, RG, MLS), pp. 37–48.

POPL-1995-RepsHS #analysis #data flow #graph #precise #reachability

Precise Interprocedural Dataflow Analysis via Graph Reachability (TWR, SH, SS), pp. 49–61.

SAS-1995-AltM #generative #performance

Generation of Efficient Interprocedural Analyzers with PAG (MA, FM), pp. 33–50.

FSE-1995-HorwitzRS #analysis #data flow

Demand Interprocedural Dataflow Analysis (SH, TWR, SS), pp. 104–115.

FSE-1995-RepsR #precise

Precise Interprocedural Chopping (TWR, GR), pp. 41–52.

TAPSOFT-1995-SagivRH #analysis #constant #data flow #precise

Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation (SS, TWR, SH), pp. 651–665.

PLDI-1994-Deutsch #alias #analysis #pointer

Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting (AD), pp. 230–241.

PLDI-1994-EmamiGH #analysis #pointer #points-to

Context-Sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers (ME, RG, LJH), pp. 242–256.

POPL-1994-BosschereDGK #optimisation

Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages (KDB, SKD, DG, SK), pp. 409–420.

CC-1994-Binkley #constant #data flow #dependence #graph #using

Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model (DB), pp. 374–388.

CC-1994-Reps #analysis #problem

Solving Demand Versions of Interprocedural Analysis Problems (TWR), pp. 389–403.

ESOP-J-1992-Larcheveque94 #object-oriented

Interprocedural Type Propagation for Object-Oriented Languages (JML), pp. 257–282.

CSM-1993-KamkarFS #how #slicing #testing

Interprocedural Dynamic Slicing Applied to Interprocedural Data How Testing (MK, PF, NS), pp. 386–395.

PLDI-1993-GroveT #case study #constant #implementation

Interprocedural Constant Propagation: A Study of Jump Function Implementations (DG, LT), pp. 90–99.

PLDI-1993-LandiRZ #alias #analysis #pointer

Interprocedural Side Effect Analysis With Pointer Aliasing (WL, BGR, SZ), pp. 56–67.

POPL-1993-ChoiBC #alias #performance #pointer

Efficient Flow-Sensitive Interprocedural Computation of Pointer-Induced Aliases and Side Effects (JDC, MGB, PRC), pp. 232–245.

POPL-1993-YiH #analysis #automation #generative

Automatic Generation and Management of Interprocedural Program Analyses (KY, WLHI), pp. 246–259.

PEPM-1992-DehboneiJ #analysis #evaluation #semantics #symbolic computation

Semantical Interprocedural Analysis by Partial Symbolic Evaluation (BD, PJ), pp. 14–20.

PLDI-1992-LandiR #algorithm #alias #approximate #pointer

A Safe Approximate Algorithm for Interprocedural Pointer Aliasing (WL, BGR), pp. 235–248.

PLILP-1992-KamkarSF #slicing

Interprocedural Dynamic Slicing (MK, NS, PF), pp. 370–384.

Best-of-PLDI-1992-LandiR92a #algorithm #alias #approximate #pointer

A safe approximate algorithm for interprocedural pointer aliasing (with retrospective) (WL, BGR), pp. 473–489.

CC-1992-KnoopS #theorem

The Interprocedural Coincidence Theorem (JK, BS), pp. 125–140.

CC-1992-SudholtS #analysis #data flow #object-oriented #on the

On Interprocedural Data Flow Analysis for Object Oriented Languages (MS, CS), pp. 156–162.

ESOP-1992-Larcheveque #object-oriented

Interprocedural Type Propagation for Object-Oriented Languages (JML), pp. 321–340.

TAV-1991-PandeL #c #source code

Interprocedural Def-Use Associations in C Programs (HDP, WL), pp. 139–153.

PLILP-1990-Bourdoncle #abstract interpretation #alias

Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity (FB), pp. 307–323.

POPL-1989-CooperK #alias #analysis #performance

Fast Interprocedural Alias Analysis (KDC, KK), pp. 49–59.

PLDI-1988-Callahan #analysis #data flow #graph #summary

The Program Summary Graph and Flow-Sensitive Interprocedural Data Flow Analysis (DC), pp. 47–56.

PLDI-1988-CooperK #analysis #linear

Interprocedural Side-Effect Analysis in Linear Time (KDC, KK), pp. 57–66.

PLDI-1988-HorwitzRB #dependence #graph #slicing #using

Interprocedural Slicing Using Dependence Graphs (SH, TWR, DB), pp. 35–46.

Best-of-PLDI-1988-CooperK88a #analysis #linear

Interprocedural side-effect analysis in linear time (with retrospective) (KDC, KK), pp. 217–228.

Best-of-PLDI-1988-HorwitzRB88a #dependence #graph #slicing #using

Interprocedural slicing using dependence graphs (with retrospective) (SH, TWR, DB), pp. 229–243.

PPEALS-1988-LiY #analysis #parallel #performance

Efficient Interprocedural Analysis for Program Parallelization and Restructuring (ZL, PCY), pp. 85–99.

Best-of-PLDI-1986-BurkeC #analysis #dependence #parallel

Interprocedural dependence analysis and parallelization (with retrospective) (MGB, RC), pp. 139–154.

Best-of-PLDI-1986-CallahanCKT #constant

Interprocedural constant propagation (with retrospective) (DC, KDC, KK, LT), pp. 155–166.

SCC-1984-CooperK #performance #summary

Efficient computation of flow insensitive interprocedural summary information (KDC, KK), pp. 247–258.

POPL-1982-JonesM #analysis #approach #data flow #data type #flexibility #recursion #source code

A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.

POPL-1981-Myers #algorithm #data flow #precise

A Precise Interprocedural Data Flow Algorithm (EWM), pp. 219–230.

POPL-1980-Weihl #analysis #data flow #pointer

Interprocedural Data Flow Analysis in the Presence of Pointers, Procedure Variables and Label Variables (WEW), pp. 83–94.

POPL-1977-Barth #algorithm #analysis #data flow

An Interprocedural Data Flow Analysis Algorithm (JMB), pp. 119–131.

ICSE-1976-FosdickO #data flow #detection

The Detection of Anomalous Interprocedural Data Flow (LDF, LJO), pp. 624–628.