String Analysis as an Abstract Interpretation

DOI10.1007/978-3-642-18275-4_21zbMATH Open1317.68099OpenAlexW4242646994MaRDI QIDQ3075489FDOQ3075489

Kwang-Moo Choe, S. W. Kim

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Abstract Interpretation Frameworks
• 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 (3)

• Intelligent Processing of an Unrestricted Text in First Order String Calculus
• Completeness of string analysis for dynamic languages
• 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)