String analysis as an abstract interpretation
From MaRDI portal
Publication:3075489
Recommendations
Cites work
- scientific article; zbMATH DE number 3470007 (Why is no real title available?)
- scientific article; zbMATH DE number 2090837 (Why is no real title available?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A Practical String Analyzer by the Widening Approach
- A characterization of parenthesis languages
- Abstract Interpretation Frameworks
- Linear-time suffix parsing for deterministic languages
- On parsing and condensing substrings of LR languages in linear time
- Programming Languages and Systems
- Superdeterministic PDAs
- Systematic design of program transformation frameworks by abstract interpretation
- The inclusion problem for simple languages
- Visibly pushdown languages
- XML Validation for Context-Free Grammars
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
- Relational string abstract domains
- scientific article; zbMATH DE number 2090837 (Why is no real title available?)
- 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)