On the public citation graph
Properties of data flow frameworks
0 signed · 242 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380010203openalex-snapshot
An empirical study of FORTRAN programs
inferredcites →https://doi.org/10.1007/3-540-12896-4_351openalex-snapshot
A static analysis of CSP programs
inferredcites →https://doi.org/10.1007/bf00268074openalex-snapshot
A simple fixpoint argument without the restriction to continuity
inferredcites →https://doi.org/10.1007/bf00282621openalex-snapshot
An efficient general iterative algorithm for dataflow analysis
inferredcites →https://doi.org/10.1007/bf00290339openalex-snapshot
Monotone data flow analysis frameworks
inferredcites →https://doi.org/10.1016/0022-0000(86)90031-0openalex-snapshot
Efficient symbolic analysis of programs
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0167-6423(88)90033-0openalex-snapshot
Program derivation by fixed point computation
inferredcites →https://doi.org/10.1016/0167-6423(88)90061-5openalex-snapshot
Conditions for incremental iteration: Examples and counterexamples
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0743-7315(89)90004-xopenalex-snapshot
A practical algorithm for static analysis of parallel programs
inferredcites →https://doi.org/10.1016/0950-5849(88)90032-8openalex-snapshot
Abstract interpretation of declarative languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80049-8openalex-snapshot
Testing flow graph reducibility
inferredcites →https://doi.org/10.1109/32.56098openalex-snapshot
A critical analysis of incremental iterative data flow analysis algorithms
inferredcites →https://doi.org/10.1109/iccl.1990.63786openalex-snapshot
Computation of interprocedural definition and use dependencies
inferredcites →https://doi.org/10.1109/tse.1985.232226openalex-snapshot
Selecting Software Test Data Using Data Flow Information
inferredcites →https://doi.org/10.1137/0205033openalex-snapshot
The Theoretical Aspects of the Optimal Fixedpoint
inferredcites →https://doi.org/10.1137/0211007openalex-snapshot
Symbolic Program Analysis in Almost-Linear Time
inferredcites →https://doi.org/10.1145/103135.103136openalex-snapshot
Constant propagation with conditional branches
inferredcites →https://doi.org/10.1145/12276.13327openalex-snapshot
Interprocedural constant propagation
inferredcites →https://doi.org/10.1145/12276.13331openalex-snapshot
Static evaluation of functional programs
inferredcites →https://doi.org/10.1145/13310.13328openalex-snapshot
Interprocedural dependence analysis and parallelization
inferredcites →https://doi.org/10.1145/13310.13331openalex-snapshot
Static evaluation of functional programs
inferredcites →https://doi.org/10.1145/2166.357218openalex-snapshot
Incremental Context-Dependent Analysis for Language-Based Editors
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization
inferredcites →https://doi.org/10.1145/27632.27649openalex-snapshot
Elimination algorithms for data flow analysis
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/318593.318658openalex-snapshot
Analyzing aliases of reference formal parameters
inferredcites →https://doi.org/10.1145/318593.318659openalex-snapshot
Constant propagation with conditional branches
inferredcites →https://doi.org/10.1145/321921.321938openalex-snapshot
Global Data Flow Analysis and Iterative Algorithms
inferredcites →https://doi.org/10.1145/321921.321939openalex-snapshot
A Fast and Usually Linear Algorithm for Global Flow Analysis
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferredcites →https://doi.org/10.1145/359060.359069openalex-snapshot
Global optimization by suppression of partial redundancies
inferredcites →https://doi.org/10.1145/359588.359596openalex-snapshot
A practical interprocedural data flow analysis algorithm
inferredcites →https://doi.org/10.1145/359863.359885openalex-snapshot
The optimal approach to recursive programs
inferredcites →https://doi.org/10.1145/360018.360025openalex-snapshot
A program data flow analysis procedure
inferredcites →https://doi.org/10.1145/390011.808263openalex-snapshot
The program dependence graph in a software development environment
inferredcites →https://doi.org/10.1145/41625.41650openalex-snapshot
Computation of aliases and support sets
inferredcites →https://doi.org/10.1145/42190.42277openalex-snapshot
Efficient and correct execution of parallel programs that share memory
inferredcites →https://doi.org/10.1145/502874.502888openalex-snapshot
Incremental data flow analysis in a structured program editor
inferredcites →https://doi.org/10.1145/502874.502898openalex-snapshot
Efficient computation of flow insensitive interprocedural summary information
inferredcites →https://doi.org/10.1145/502949.502888openalex-snapshot
Incremental data flow analysis in a structured program editor
inferredcites →https://doi.org/10.1145/502949.502898openalex-snapshot
Efficient computation of flow insensitive interprocedural summary information
inferredcites →https://doi.org/10.1145/512644.512651openalex-snapshot
Code motion of control structures in high-level languages
inferredcites →https://doi.org/10.1145/512644.512654openalex-snapshot
Retargetable high-level alias analysis
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
inferredcites →https://doi.org/10.1145/512927.512946openalex-snapshot
Analysis of a simple algorithm global data flow problems
inferredcites →https://doi.org/10.1145/512950.512956openalex-snapshot
Generalized common subexpressions in very high level languages
inferredcites →https://doi.org/10.1145/53990.53994openalex-snapshot
Interprocedural slicing using dependence graphs
inferredcites →https://doi.org/10.1145/53990.53996openalex-snapshot
Interprocedural side-effect analysis in linear time
inferredcites →https://doi.org/10.1145/567446.567455openalex-snapshot
Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables
inferredcites →https://doi.org/10.1145/567532.567556openalex-snapshot
A precise inter-procedural data flow algorithm
inferredcites →https://doi.org/10.1145/567752.567756openalex-snapshot
An efficient way to find the side effects of procedure calls and the aliases of variables
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/65979.65980openalex-snapshot
Integrating noninterfering versions of programs
inferredcites →https://doi.org/10.1145/68210.69224openalex-snapshot
Automatic detection of nondeterminacy in parallel programs
inferredcites →https://doi.org/10.1145/68210.69225openalex-snapshot
Static analysis of low-level synchronization
inferredcites →https://doi.org/10.1145/73141.74821openalex-snapshot
Dependence analysis for pointer variables
inferredcites →https://doi.org/10.1145/73141.74844openalex-snapshot
On-the-fly detection of access anomalies
inferredcites →https://doi.org/10.1145/73560.73561openalex-snapshot
Detecting equality of variables in programs
inferredcites →https://doi.org/10.1145/73560.73562openalex-snapshot
Global value numbers and redundant computations
inferredcites →https://doi.org/10.1145/73560.73572openalex-snapshot
Integrating non-intering versions of programs
inferredcites →https://doi.org/10.1145/73560.73573openalex-snapshot
On the adequacy of program dependence graphs for representing programs
inferredcites →https://doi.org/10.1145/73560.73584openalex-snapshot
Incremental data flow analysis via dominator and attribute update
inferredcites →https://doi.org/10.1145/73560.73585openalex-snapshot
Lifetime analysis of dynamically allocated objects
inferredcites →https://doi.org/10.1145/75277.75280openalex-snapshot
An efficient method of computing static single assignment form
inferredcites →https://doi.org/10.1145/75277.75281openalex-snapshot
Resolving circularity in attribute grammars with applications to data flow analysis (preliminary version)
inferredcites →https://doi.org/10.1145/75277.75282openalex-snapshot
Fast interprocedual alias analysis
inferredcites →https://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
inferredcites →https://doi.org/10.1145/800020.808263openalex-snapshot
The program dependence graph in a software development environment
inferredcites →https://doi.org/10.1145/800182.810386openalex-snapshot
Compile time type determination in SETL
inferredcites →https://doi.org/10.1145/800228.806926openalex-snapshot
Automatic synthesis of optimal invariant assertions
inferredcites →https://doi.org/10.1145/800230.806985openalex-snapshot
The design of a data flow analyzer
inferredcites →https://doi.org/10.1145/872734.806926openalex-snapshot
Automatic synthesis of optimal invariant assertions
inferredcites →https://doi.org/10.1145/960116.53993openalex-snapshot
Detecting conflicts between structure accesses
inferredcites →https://doi.org/10.1145/960116.53995openalex-snapshot
The program summary graph and flow-sensitive interprocedual data flow analysis
inferredcites →https://doi.org/10.1145/960116.54011openalex-snapshot
Incremental evaluation for a general class of circular attribute grammars
inferredcites →https://doi.org/10.1145/96709.96728openalex-snapshot
An efficient hybrid algorithm for incremental data flow analysis
inferredcites →https://doi.org/10.1145/989393.989411openalex-snapshot
Interprocedural dependence analysis and parallelization
inferredcites →https://doi.org/10.1145/989393.989412openalex-snapshot
Interprocedural constant propagation
inferredcites →https://doi.org/10.1145/989393.989418openalex-snapshot
Interprocedural side-effect analysis in linear time
inferredcites →https://doi.org/10.1145/989393.989419openalex-snapshot
Interprocedural slicing using dependence graphs
inferredcites →https://doi.org/10.1147/rd.181.0020openalex-snapshot
Register Assignment Algorithm for Generation of Highly Optimized Object Code
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(19990410)29:4<359::aid-spe232>3.0.co;2-hopenalex-snapshot
An application of compiler technology to the year 2000 problem
inferred← citeshttps://doi.org/10.1002/spe.1133openalex-snapshot
Language design and analyzability: a retrospective
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_10openalex-snapshot
Dimensions of Precision in Reference Analysis of Object-Oriented Programming Languages
inferred← citeshttps://doi.org/10.1007/3-540-48166-4_15openalex-snapshot
Data-Flow Analysis of Program Fragments
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_40openalex-snapshot
Object Oriented application flow graphs and their semantics
inferred← citeshttps://doi.org/10.1007/3-540-57264-3_41openalex-snapshot
Finiteness conditions for strictness analysis
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_54openalex-snapshot
Parallel hybrid data flow algorithms: A case study
inferred← citeshttps://doi.org/10.1007/3-540-57877-3_14openalex-snapshot
Flow grammars — a flow analysis methodology
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_85openalex-snapshot
Least solutions of equations over N
inferred← citeshttps://doi.org/10.1007/3-540-58485-4_50openalex-snapshot
Finding fixpoints in finite function spaces using neededness analysis and chaotic iteration
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_96openalex-snapshot
On edge addition rewrite systems and their relevance to program analysis
inferred← citeshttps://doi.org/10.1007/978-1-4471-2350-7_7openalex-snapshot
SSA-Based Simulated Execution
inferred← citeshttps://doi.org/10.1007/978-3-319-12736-1_21openalex-snapshot
Syntax-Directed Divide-and-Conquer Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-63564-4_14openalex-snapshot
Reordering Transaction Execution to Boost High Frequency Trading Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_19openalex-snapshot
Small Witnesses for Abstract Interpretation-Based Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_7openalex-snapshot
Control Flow Emulation on Tiled SIMD Architectures
inferred← citeshttps://doi.org/10.1007/978-3-642-88049-0_11openalex-snapshot
Predictability and Techniques for Schedulability Analysis
inferred← citeshttps://doi.org/10.1007/bf00127842openalex-snapshot
Experiences with a parallel algorithm for data flow analysis
inferred← citeshttps://doi.org/10.1007/bf01204730openalex-snapshot
Effectively exploiting parallelism in data flow analysis
inferred← citeshttps://doi.org/10.1007/bfb0026423openalex-snapshot
Basic-block graphs: Living dinosaurs?
inferred← citeshttps://doi.org/10.1007/bfb0032749openalex-snapshot
Effective specialization of realistic programs via use sensitivity
inferred← citeshttps://doi.org/10.1007/bfb0055009openalex-snapshot
Symbolic reaching definitions analysis of Ada programs
inferred← citeshttps://doi.org/10.1007/bfb0055617openalex-snapshot
Control flow analysis for the π-calculus
inferred← citeshttps://doi.org/10.1007/s00224-022-10093-wopenalex-snapshot
A Framework for Memory Efficient Context-Sensitive Program Analysis
inferred← citeshttps://doi.org/10.1007/s002360050101openalex-snapshot
A fine-grained data-flow analysis framework
inferred← citeshttps://doi.org/10.1007/s11334-012-0189-0openalex-snapshot
Invariant relations, invariant functions, and loop functions
inferred← citeshttps://doi.org/10.1007/s41019-017-0054-0openalex-snapshot
Reordering Transaction Execution to Boost High-Frequency Trading Applications
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90072-sopenalex-snapshot
Parallel asynchronous iterations of least fixed points
inferred← citeshttps://doi.org/10.1016/0967-0661(93)92107-fopenalex-snapshot
Enabling efficient schedulability analysis through conditional linking and program transformations
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.07.010openalex-snapshot
Harnessing a Refinement Theory to Compute Loop Functions
inferred← citeshttps://doi.org/10.1016/j.infsof.2009.04.012openalex-snapshot
Fast and precise points-to analysis
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.007openalex-snapshot
Reflexive transitive invariant relations: A basis for computing loop functions
inferred← citeshttps://doi.org/10.1016/j.jss.2015.01.037openalex-snapshot
On applying machine learning techniques for design pattern detection
inferred← citeshttps://doi.org/10.1016/j.jss.2021.110952openalex-snapshot
Memory efficient context-sensitive program analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2009.09.009openalex-snapshot
Mathematics for reasoning about loop functions
inferred← citeshttps://doi.org/10.1016/j.scico.2010.03.006openalex-snapshot
Application of static analyses for state-space reduction to the microcontroller binary code
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.06.019openalex-snapshot
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00048-7openalex-snapshot
Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity
inferred← citeshttps://doi.org/10.1016/s1477-8424(03)00012-5openalex-snapshot
Bidirectional data flow analysis for type inferencing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80736-9openalex-snapshot
A Low-Level Analysis Library for Architecture Recovery
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80875-2openalex-snapshot
Meta-Modelling for Formal Software Development
inferred← citeshttps://doi.org/10.1023/a:1011151522310openalex-snapshot
Towards a Mobile Code Management Environment for Complex, Real-Time, Distributed Systems
inferred← citeshttps://doi.org/10.1023/a:1014535317056openalex-snapshot
Data-Flow Frameworks for Worst-Case Execution Time Analysis
inferred← citeshttps://doi.org/10.1023/a:1023896821228openalex-snapshot
Decidability of the Analysis Problem for Dataflow Models of Programs
inferred← citeshttps://doi.org/10.1109/32.232013openalex-snapshot
Extending typestate checking using conditional liveness analysis
inferred← citeshttps://doi.org/10.1109/32.286418openalex-snapshot
Interprocedural def-use associations for C systems with single level pointers
inferred← citeshttps://doi.org/10.1109/71.762818openalex-snapshot
A general interprocedural framework for placement of split-phase large latency operations
inferred← citeshttps://doi.org/10.1109/ase.1997.632847openalex-snapshot
Modular flow analysis for concurrent software
inferred← citeshttps://doi.org/10.1109/bec.2010.5630890openalex-snapshot
Medical and context data acquisition system for patient home monitoring
inferred← citeshttps://doi.org/10.1109/csmr.2003.1192431openalex-snapshot
JSPick-a server pages design recovery tool
inferred← citeshttps://doi.org/10.1109/depcos-relcomex.2007.14openalex-snapshot
Dataflow Analysis of Distributed Programs Using Generalized Marked Nets
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750598openalex-snapshot
Interprocedural communication optimizations for message passing architectures
inferred← citeshttps://doi.org/10.1109/hicss.1991.184005openalex-snapshot
Hybrid incremental alias algorithms
inferred← citeshttps://doi.org/10.1109/icse.1996.493449openalex-snapshot
A flexible architecture for building data flow analyzers
inferred← citeshttps://doi.org/10.1109/icse.2001.919079openalex-snapshot
The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification
inferred← citeshttps://doi.org/10.1109/icse.2004.1317485openalex-snapshot
Heuristic-based model refinement for FLAVERS
inferred← citeshttps://doi.org/10.1109/icse.2007.35openalex-snapshot
Exception-Chain Analysis: Revealing Exception Handling Architecture in Java Server Applications
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470818openalex-snapshot
A multi-threaded approach for data-flow analysis
inferred← citeshttps://doi.org/10.1109/isorc.1999.776402openalex-snapshot
The use of task graphs for modeling complex system behavior
inferred← citeshttps://doi.org/10.1109/issrew.2014.75openalex-snapshot
A Memory Model Based on Three-Valued Matrix for Static Defect Detection
inferred← citeshttps://doi.org/10.1109/scam.2002.1134115openalex-snapshot
Precise call graph construction in the presence of function pointers
inferred← citeshttps://doi.org/10.1109/scam.2007.26openalex-snapshot
Towards Path-Sensitive Points-to Analysis
inferred← citeshttps://doi.org/10.1109/scam.2008.26openalex-snapshot
Fast and Precise Points-to Analysis
inferred← citeshttps://doi.org/10.1109/scam.2010.10openalex-snapshot
Parallel Reachability and Escape Analyses
inferred← citeshttps://doi.org/10.1109/superc.1990.130122openalex-snapshot
Performing data flow analysis in parallel
inferred← citeshttps://doi.org/10.1109/tse.2003.1237170openalex-snapshot
Searching for points-to analysis
inferred← citeshttps://doi.org/10.1109/tse.2005.51openalex-snapshot
Robustness testing of Java server applications
inferred← citeshttps://doi.org/10.1109/words.1999.806595openalex-snapshot
Task graphs for mobile code-an introduction to ITGS
inferred← citeshttps://doi.org/10.1145/1007512.1007516openalex-snapshot
Testing of java web services for robustness
inferred← citeshttps://doi.org/10.1145/1040291.1040292openalex-snapshot
Flow analysis for verifying properties of concurrent software systems
inferred← citeshttps://doi.org/10.1145/1075382.1075385openalex-snapshot
Interprocedural parallelization analysis in SUIF
inferred← citeshttps://doi.org/10.1145/122759.122768openalex-snapshot
A model of Ada programs for static deadlock detection in polynomial times
inferred← citeshttps://doi.org/10.1145/127695.122768openalex-snapshot
A model of Ada programs for static deadlock detection in polynomial times
inferred← citeshttps://doi.org/10.1145/141471.141514openalex-snapshot
Finiteness conditions for fixed point iteration
inferred← citeshttps://doi.org/10.1145/141478.141514openalex-snapshot
Finiteness conditions for fixed point iteration
inferred← citeshttps://doi.org/10.1145/143369.143415openalex-snapshot
A comprehensive approach to parallel data flow analysis
inferred← citeshttps://doi.org/10.1145/1453101.1453111openalex-snapshot
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
inferred← citeshttps://doi.org/10.1145/155090.155097openalex-snapshot
A practical data flow framework for array reference analysis and its use in optimizations
inferred← citeshttps://doi.org/10.1145/158511.158696openalex-snapshot
Complexity of bi-directional data flow analysis
inferred← citeshttps://doi.org/10.1145/173262.155097openalex-snapshot
A practical data flow framework for array reference analysis and its use in optimizations
inferred← citeshttps://doi.org/10.1145/178243.178244openalex-snapshot
Is continuation-passing useful for data flow analysis?
inferred← citeshttps://doi.org/10.1145/178243.178253openalex-snapshot
GIVE-N-TAKE—a balanced code placement framework
inferred← citeshttps://doi.org/10.1145/1787275.1787345openalex-snapshot
Scalable simulation of complex network routing policies
inferred← citeshttps://doi.org/10.1145/186025.186043openalex-snapshot
A generalized theory of bit vector data flow analysis
inferred← citeshttps://doi.org/10.1145/193173.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/1944862.1944872openalex-snapshot
Parallel points-to analysis for multi-core machines
inferred← citeshttps://doi.org/10.1145/195274.195295openalex-snapshot
Data flow analysis for verifying properties of concurrent programs
inferred← citeshttps://doi.org/10.1145/213978.213989openalex-snapshot
Lattice frameworks for multisource and bidirectional data flow problems
inferred← citeshttps://doi.org/10.1145/231379.231434openalex-snapshot
A new framework for exhaustive and incremental data flow analysis using DJ graphs
inferred← citeshttps://doi.org/10.1145/239098.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/2483760.2483788openalex-snapshot
Practical blended taint analysis for JavaScript
inferred← citeshttps://doi.org/10.1145/249069.231434openalex-snapshot
A new framework for exhaustive and incremental data flow analysis using DJ graphs
inferred← citeshttps://doi.org/10.1145/250707.239114openalex-snapshot
Verification of communication protocols using data flow analysis
inferred← citeshttps://doi.org/10.1145/251759.251849openalex-snapshot
Reverse engineering and system renovation—an annotated bibliography
inferred← citeshttps://doi.org/10.1145/258993.259005openalex-snapshot
Accurate binding-time analysis for imperative languages
inferred← citeshttps://doi.org/10.1145/267959.269970openalex-snapshot
A practical framework for demand-driven interprocedural data flow analysis
inferred← citeshttps://doi.org/10.1145/271771.271782openalex-snapshot
Comparing flow and context sensitivity on the modification-side-effects problem
inferred← citeshttps://doi.org/10.1145/271775.271782openalex-snapshot
Comparing flow and context sensitivity on the modification-side-effects problem
inferred← citeshttps://doi.org/10.1145/276393.278523openalex-snapshot
A new framework for elimination-based data flow analysis using DJ graphs
inferred← citeshttps://doi.org/10.1145/277631.277642openalex-snapshot
Efficient composite data flow analysis applied to concurrent programs
inferred← citeshttps://doi.org/10.1145/277633.277642openalex-snapshot
Efficient composite data flow analysis applied to concurrent programs
inferred← citeshttps://doi.org/10.1145/277650.277754openalex-snapshot
Automatically closing open reactive programs
inferred← citeshttps://doi.org/10.1145/277652.277754openalex-snapshot
Automatically closing open reactive programs
inferred← citeshttps://doi.org/10.1145/288195.288213openalex-snapshot
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
inferred← citeshttps://doi.org/10.1145/291252.288213openalex-snapshot
A conservative data flow algorithm for detecting all pairs of statements that may happen in parallel
inferred← citeshttps://doi.org/10.1145/302405.302663openalex-snapshot
Data flow analysis for checking properties of concurrent Java programs
inferred← citeshttps://doi.org/10.1145/312009.312085openalex-snapshot
A novel program representation for interprocedural analysis
inferred← citeshttps://doi.org/10.1145/318774.318945openalex-snapshot
Data-flow analysis of program fragments
inferred← citeshttps://doi.org/10.1145/328690.328703openalex-snapshot
Program analysis with partial transfer functions
inferred← citeshttps://doi.org/10.1145/328691.328703openalex-snapshot
Program analysis with partial transfer functions
inferred← citeshttps://doi.org/10.1145/363911.363914openalex-snapshot
Graph rewrite systems for program optimization
inferred← citeshttps://doi.org/10.1145/365151.365161openalex-snapshot
A balanced code placement framework
inferred← citeshttps://doi.org/10.1145/383043.381532openalex-snapshot
A schema for interprocedural modification side-effect analysis with pointer aliasing
inferred← citeshttps://doi.org/10.1145/566171.566178openalex-snapshot
A conservative algorithm for computing the flow of permissions in Java programs
inferred← citeshttps://doi.org/10.1145/586094.586107openalex-snapshot
Using the observer design pattern for implementation of data flow analyses
inferred← citeshttps://doi.org/10.1145/587051.587061openalex-snapshot
Searching for points-to analysis
inferred← citeshttps://doi.org/10.1145/606666.606676openalex-snapshot
Bidirectional data flow analysis
inferred← citeshttps://doi.org/10.1145/634636.586107openalex-snapshot
Using the observer design pattern for implementation of data flow analyses
inferred← citeshttps://doi.org/10.1145/773473.178244openalex-snapshot
Is continuation-passing useful for data flow analysis?
inferred← citeshttps://doi.org/10.1145/773473.178253openalex-snapshot
GIVE-N-TAKE—a balanced code placement framework
inferred← citeshttps://doi.org/10.1145/96709.96728openalex-snapshot
An efficient hybrid algorithm for incremental data flow analysis
inferred← citeshttps://doi.org/10.1147/sj.411.0140openalex-snapshot
FLAVERS: A finite state verification technique for software systems
inferred← citeshttps://doi.org/10.1177/10920617251405471openalex-snapshot
A Systemic View of a Software Engineering Education Curriculum: Requirements and Guidelines in the Era of Generative AI
inferred← citeshttps://doi.org/10.14778/2876473.2876479openalex-snapshot
Leveraging lock contention to improve OLTP application performance
inferred← citeshttps://doi.org/10.2197/ipsjdc.1.349openalex-snapshot
Java Obfuscation Approaches to Construct Tamper-Resistant Object-Oriented Programs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.05962openalex-snapshot
A Data Flow Analysis Framework for Data Flow Subsumption
inferred← citeshttps://doi.org/10.5555/227726.227843openalex-snapshot
A flexible architecture for building data flow analyzers
inferred← citeshttps://doi.org/10.5555/381473.381477openalex-snapshot
The right algorithm at the right time: comparing data flow analysis algorithms for finite state verification
inferred← citeshttps://doi.org/10.5555/998675.999467openalex-snapshot
Heuristic-based model refinement for FLAVERS
inferred← citeshttps://doi.org/10.7282/t3-4ah3-6p23openalex-snapshot
Dataflow analysis of software fragments
inferred← citeshttps://doi.org/10.7282/t35142w0openalex-snapshot
Modular Data-flow Analysis of Statically Typed Object-oriented Programming Languages
inferred← citeshttps://doi.org/10.7282/t3cv4hwhopenalex-snapshot
Practical analysis of framework-intensive applications
inferred← citeshttps://doi.org/10.7282/t3m9091zopenalex-snapshot
Improving software reliability using exception analysis of object oriented programs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.