Interconvertibility of a class of set constraints and context-free-language reachability

DOI10.1016/S0304-3975(00)00049-9zbMath0949.68087WikidataQ126296747 ScholiaQ126296747MaRDI QIDQ1583350

Thomas W. Reps, David Melski

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

program analysispath problemcomplexity of program-analysis problemscontext-free-language reachabilitydefinite set constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Type-based flow analysis and context-free language reachability ⋮ Source-tracking unification ⋮ Generating Specialized Rules and Programs for Demand-Driven Analysis ⋮ Simplifying subtyping constraints: a theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Precise interprocedural dataflow analysis with applications to constant propagation
• Complete problems for deterministic polynomial time
• The method of attributes for data flow analysis. II: Demand analysis
• On the sequential nature of interprocedural program-analysis problems
• On the security of ping-pong protocols
• Program Slicing
• On Live-Dead Analysis for Global Data Flow Problems
• On edge addition rewrite systems and their relevance to program analysis
• On the complexity of set-based analysis

This page was built for publication: Interconvertibility of a class of set constraints and context-free-language reachability