String analysis as an abstract interpretation
From MaRDI portal
Publication:3075489
DOI10.1007/978-3-642-18275-4_21zbMATH Open1317.68099OpenAlexW4242646994MaRDI QIDQ3075489FDOQ3075489
Authors: S. W. Kim, Kwang-Moo Choe 
Publication date: 15 February 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18275-4_21
Recommendations
Cites Work
- Visibly pushdown languages
- XML Validation for Context-Free Grammars
- A characterization of parenthesis languages
- Systematic design of program transformation frameworks by abstract interpretation
- The inclusion problem for simple languages
- Title not available (Why is that?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Abstract Interpretation Frameworks
- Title not available (Why is that?)
- Linear-time suffix parsing for deterministic languages
- On parsing and condensing substrings of LR languages in linear time
- Superdeterministic PDAs
- Programming Languages and Systems
- A Practical String Analyzer by the Widening Approach
Cited In (10)
- Intelligent Processing of an Unrestricted Text in First Order String Calculus
- Completeness of string analysis for dynamic languages
- Reference abstract domains and applications to string analysis
- Title not available (Why is that?)
- Relational string abstract domains
- Twinning automata and regular expressions for string static analysis
- Inferring grammatical summaries of string values
- String abstract domains and their combination
- A Practical String Analyzer by the Widening Approach
- String Analysis via Automata Manipulation with Logic Circuit Representation
This page was built for publication: String analysis as an abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075489)
