On the public citation graph
Static Program Analysis for String Manipulation Languages
0 signed · 52 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.2218openalex-snapshot
A suite of abstract domains for static analysis of string values
inferredcites →https://doi.org/10.1007/11823230_15openalex-snapshot
Recency-Abstraction for Heap-Allocated Storage
inferredcites →https://doi.org/10.1007/11924661_23openalex-snapshot
A Practical String Analyzer by the Widening Approach
inferredcites →https://doi.org/10.1007/3-540-46011-x_28openalex-snapshot
Minimal Covers of Formal Languages
inferredcites →https://doi.org/10.1007/3-540-47764-0_20openalex-snapshot
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
inferredcites →https://doi.org/10.1007/3-540-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_10openalex-snapshot
String Constraints for Verification
inferredcites →https://doi.org/10.1007/978-3-319-77935-5_14openalex-snapshot
Static Value Analysis of Python Programs by Abstract Interpretation
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_25openalex-snapshot
Widening Arithmetic Automata
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_29openalex-snapshot
Abstract Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-70844-5_7openalex-snapshot
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
inferredcites →https://doi.org/10.1007/978-3-540-85114-1_21openalex-snapshot
Symbolic String Verification: An Automata-Based Approach
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_17openalex-snapshot
Type Analysis for JavaScript
inferredcites →https://doi.org/10.1007/978-3-642-14455-4_34openalex-snapshot
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages
inferredcites →https://doi.org/10.1007/978-3-662-53413-7_17openalex-snapshot
A Parametric Abstract Domain for Lattice-Valued Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_3openalex-snapshot
Combining String Abstract Domains for JavaScript Analysis: An Evaluation
inferredcites →https://doi.org/10.1016/0304-3975(92)00011-fopenalex-snapshot
The state complexities of some basic operations on regular languages
inferredcites →https://doi.org/10.1016/j.entcs.2017.02.003openalex-snapshot
Abstract Domains for Type Juggling
inferredcites →https://doi.org/10.1016/j.tcs.2009.05.019openalex-snapshot
Determination of finite automata accepting subregular languages
inferredcites →https://doi.org/10.1017/s0960129514000358openalex-snapshot
Making abstract models complete
inferredcites →https://doi.org/10.1093/logcom/2.4.511openalex-snapshot
Abstract Interpretation Frameworks
inferredcites →https://doi.org/10.1109/malware.2012.6461002openalex-snapshot
The power of obfuscation techniques in malicious JavaScript code: A measurement study
inferredcites →https://doi.org/10.1109/tase.2018.00009openalex-snapshot
M-String Segmentation: A Refined Abstract Domain for String Analysis in C Programs
inferredcites →https://doi.org/10.1142/s0129054102000960openalex-snapshot
AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
inferredcites →https://doi.org/10.1145/1926385.1926399openalex-snapshot
A parametric segmentation functor for fully automatic and scalable array content analysis
inferredcites →https://doi.org/10.1145/2338965.2336758openalex-snapshot
Remedying the eval that men do
inferredcites →https://doi.org/10.1145/2635868.2635904openalex-snapshot
JSAI: a static analysis platform for JavaScript
inferredcites →https://doi.org/10.1145/263699.263744openalex-snapshot
Types as abstract interpretations
inferredcites →https://doi.org/10.1145/2837614.2837641openalex-snapshot
String solving with word equations and transducers: towards a logic for analysing mutation XSS
inferredcites →https://doi.org/10.1145/2989225.2989228openalex-snapshot
Precise and scalable static analysis of jQuery using a regular expression domain
inferredcites →https://doi.org/10.1145/3158092openalex-snapshot
String constraints with concatenation and transducers solved efficiently
inferredcites →https://doi.org/10.1145/333979.333989openalex-snapshot
Making abstract interpretations complete
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/568438.568455openalex-snapshot
Introduction to automata theory, languages, and computation, 2nd edition
inferredcites →https://doi.org/10.2307/2275691openalex-snapshot
Martin D. Davis, Ron Sigal, and Elaine J. Weyuker. Computability, complexity, and languages. Fundamentals of theoretical computer science. Second edition of LII 293. Computer science and scientific computing. Academic Press, Boston, San Diego, New York, etc., 1994, xix + 609 pp.
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.519openalex-snapshot
The Good, the Bad, and the Ugly: An Empirical Study of Implicit Type Conversions in JavaScript
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.689openalex-snapshot
Framework for Static Analysis of PHP Applications
inferredcites →https://doi.org/10.4230/lipics.ecoop.2015.735openalex-snapshot
Scalable and Precise Static Analysis of JavaScript Applications via Loop-Sensitivity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_15openalex-snapshot
Completeness of Abstract Domains for String Analysis of JavaScript Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_9openalex-snapshot
An Abstract Domain for Objects in Dynamic Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_14openalex-snapshot
On Multi-language Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_2openalex-snapshot
Relational String Abstract Domains
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_15openalex-snapshot
A Product of Shape and Sequence Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-032-40374-2_2openalex-snapshot
Relaxed Residuation Theory
inferred← citeshttps://doi.org/10.1007/978-981-19-9601-6_7openalex-snapshot
Lifting String Analysis Domains
inferred← citeshttps://doi.org/10.1007/s10703-022-00405-8openalex-snapshot
On multi-language abstraction: Towards a static analysis of multi-language programs
inferred← citeshttps://doi.org/10.1145/3341105.3373964openalex-snapshot
A sound abstract interpreter for dynamic code
inferred← citeshttps://doi.org/10.3390/app10103525openalex-snapshot
Static Analysis for ECMAScript String Manipulation Programs
inferred← citeshttps://doi.org/10.4204/eptcs.341.2openalex-snapshot
Improving Dynamic Code Analysis by Code Abstraction
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.