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

DOI10.1016/S0304-3975(00)00049-9MaRDI QIDQ1583350zbMATH OpenWikidataFDO

Authors David Melski, Thomas Reps

Publication date 26 October 2000

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

zbMATH Keywords

path problemprogram analysiscomplexity of program-analysis problemscontext-free-language reachabilitydefinite set constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Set constraints with intersection
• Set constraints with projections
• Set constraints in some equational theories
• Introduction to set constraint-based program analysis
• Formal language constrained reachability and model checking propositional dynamic logics

Cites work

• scientific article; zbMATH DE number 3854429 (Why is no real title available?)
• scientific article; zbMATH DE number 3735091 (Why is no real title available?)
• scientific article; zbMATH DE number 3592938 (Why is no real title available?)
• scientific article; zbMATH DE number 1407672 (Why is no real title available?)
• scientific article; zbMATH DE number 3303661 (Why is no real title available?)
• Complete problems for deterministic polynomial time
• 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
• On the security of ping-pong protocols
• On the sequential nature of interprocedural program-analysis problems
• Precise interprocedural dataflow analysis with applications to constant propagation
• Program Slicing
• The method of attributes for data flow analysis. II: Demand analysis

Cited in

(6)

• Context-sensitive data-dependence analysis via linear conjunctive language reachability
• Source-tracking unification
• Type-based flow analysis and context-free language reachability
• Simplifying subtyping constraints: a theory
• The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds
• Generating Specialized Rules and Programs for Demand-Driven Analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583350)