On the public citation graph

Pair-Sharing Analysis of Object-Oriented Programs

0 signed · 68 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
inferredcites →https://doi.org/10.1007/3-540-45337-7openalex-snapshot
ECOOP 2001 — Object-Oriented Programming
inferredcites →https://doi.org/10.1007/3-540-45337-7_5openalex-snapshot
Distinctness and Sharing Domains for Static Analysis of Java Programs
inferredcites →https://doi.org/10.1007/3-540-49538-x_5openalex-snapshot
Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis
inferredcites →https://doi.org/10.1007/978-3-540-24754-8_10openalex-snapshot
Set-Sharing Is Not Always Redundant for Pair-Sharing
inferredcites →https://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferredcites →https://doi.org/10.1016/0743-1066(92)90034-zopenalex-snapshot
Static analysis of logic programs for independent and parallelism
inferredcites →https://doi.org/10.1016/0743-1066(94)90026-4openalex-snapshot
The s-semantics approach: Theory and applications
inferredcites →https://doi.org/10.1016/s0304-3975(00)00312-1openalex-snapshot
Set-sharing is redundant for pair-sharing
inferredcites →https://doi.org/10.1016/s0743-1066(00)00009-1openalex-snapshot
Pair-sharing over rational trees
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/115865.115872openalex-snapshot
Abstract interpretation of logic programs
inferredcites →https://doi.org/10.1145/158511.158639openalex-snapshot
Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects
inferredcites →https://doi.org/10.1145/237721.237727openalex-snapshot
Points-to analysis in almost linear time
inferredcites →https://doi.org/10.1145/353171.353190openalex-snapshot
Scalable propagation-based call graph construction algorithms
inferredcites →https://doi.org/10.1145/354222.353190openalex-snapshot
Scalable propagation-based call graph construction algorithms
inferredcites →https://doi.org/10.1145/512950.512973openalex-snapshot
Abstract interpretation
inferredcites →https://doi.org/10.1145/571157.571168openalex-snapshot
Precise pair-sharing analysis of logic programs
inferredcites →https://doi.org/10.5860/choice.30-6217openalex-snapshot
The formal semantics of programming languages: an introduction
inferredcites →https://doi.org/10.7551/mitpress/3054.001.0001openalex-snapshot
The Formal Semantics of Programming Languages

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11609773_7openalex-snapshot
Detecting Non-cyclicity by Abstract Compilation into Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-39322-9_2openalex-snapshot
$$\mathsf {BackFlow}$$: Backward Context-Sensitive Flow Reconstruction of Taint Analysis Results
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_46openalex-snapshot
Checking Array Bounds by Abstract Interpretation and Symbolic Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-30554-5_8openalex-snapshot
Formal Techniques for Java-Like Programs (FTfJP)
inferred← citeshttps://doi.org/10.1007/978-3-540-68863-1_2openalex-snapshot
Termination Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_28openalex-snapshot
Magic-Sets Transformation for the Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_17openalex-snapshot
Precise Set Sharing Analysis for Java-Style Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_11openalex-snapshot
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89740-8_4openalex-snapshot
Efficient Set Sharing Using ZBDDs
inferred← citeshttps://doi.org/10.1007/978-3-642-03829-7_9openalex-snapshot
Resource Usage Analysis and Its Application to Resource Certification
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_23openalex-snapshot
The Nullness Analyser of julia
inferred← citeshttps://doi.org/10.1007/978-3-642-28872-2_10openalex-snapshot
Verified Resource Guarantees for Heap Manipulating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_33openalex-snapshot
Reachability Analysis of Program Variables
inferred← citeshttps://doi.org/10.1007/978-3-662-48899-7_10openalex-snapshot
Boolean Formulas for the Static Identification of Injection Attacks in Java
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_3openalex-snapshot
The Julia Static Analyzer for Java
inferred← citeshttps://doi.org/10.1007/s00354-012-0207-7openalex-snapshot
Class-level Non-Interference
inferred← citeshttps://doi.org/10.1007/s10270-009-0132-5openalex-snapshot
Precise null-pointer analysis
inferred← citeshttps://doi.org/10.1007/s10270-015-0476-yopenalex-snapshot
A formal verification framework for static analysis
inferred← citeshttps://doi.org/10.1007/s10990-010-9063-7openalex-snapshot
Magic-sets for localised analysis of Java bytecode
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.060openalex-snapshot
An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.11.016openalex-snapshot
Experiments with Non-Termination Analysis for Java Bytecode
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.002openalex-snapshot
Exploiting Linearity in Sharing Analysis of Object-oriented Programs
inferred← citeshttps://doi.org/10.1016/j.ic.2018.05.007openalex-snapshot
From Jinja bytecode to term rewriting: A complexity reflecting transformation
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.10.005openalex-snapshot
Field-sensitive sharing
inferred← citeshttps://doi.org/10.1016/j.scico.2014.03.012openalex-snapshot
Field-sensitive unreachability and non-cyclicity analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2017.12.006openalex-snapshot
Some trade-offs in reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.009openalex-snapshot
Cost analysis of object-oriented bytecode programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.018openalex-snapshot
Reachability-based acyclicity analysis by Abstract Interpretation
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.007openalex-snapshot
Inferring complete initialization of arrays
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.002openalex-snapshot
A multi-domain incremental analysis engine and its application to incremental resource analysis
inferred← citeshttps://doi.org/10.1017/s0960129522000160openalex-snapshot
The role of linearity in sharing analysis
inferred← citeshttps://doi.org/10.1017/s1471068410000487openalex-snapshot
Certificate size reduction in abstraction-carrying code
inferred← citeshttps://doi.org/10.1017/s1471068422000059openalex-snapshot
Parallel Logic Programming: A Sequel
inferred← citeshttps://doi.org/10.1109/scam.2008.19openalex-snapshot
The Semantics of Abstract Program Slicing
inferred← citeshttps://doi.org/10.1142/s0218194021500303openalex-snapshot
Static Privacy Analysis by Flow Reconstruction of Tainted Data
inferred← citeshttps://doi.org/10.1145/1363686.1363779openalex-snapshot
Removing useless variables in cost analysis of Java bytecode
inferred← citeshttps://doi.org/10.1145/1709093.1709095openalex-snapshot
A termination analyzer for Java bytecode based on path-length
inferred← citeshttps://doi.org/10.1145/2103746.2103754openalex-snapshot
Incremental resource usage analysis
inferred← citeshttps://doi.org/10.1145/2529990openalex-snapshot
Reachability analysis of program variables
inferred← citeshttps://doi.org/10.1145/2629478openalex-snapshot
Inference of Field-Sensitive Reachability and Cyclicity
inferred← citeshttps://doi.org/10.1145/2967973.2968597openalex-snapshot
Reducing the overhead of assertion run-time checks via static analysis
inferred← citeshttps://doi.org/10.1145/3029052openalex-snapshot
Abstract Program Slicing
inferred← citeshttps://doi.org/10.1145/3332371openalex-snapshot
Static Identification of Injection Attacks in Java
inferred← citeshttps://doi.org/10.20868/upm.thesis.14750openalex-snapshot
Advanced Topics in Resource Analysis: Certification, Incrementality, Concurrency and Array-Sensitivity
inferred← citeshttps://doi.org/10.20868/upm.thesis.52401openalex-snapshot
Improving Run-time Checking in Dynamic Programming Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1568openalex-snapshot
A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1306.6526openalex-snapshot
Inference of Field-Sensitive Reachability and Cyclicity
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05104openalex-snapshot
Abstract Program Slicing: an Abstract Interpretation-based approach to Program Slicing
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.