Context-sensitive data-dependence analysis via linear conjunctive language reachability
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1407672
- Type-based flow analysis and context-free language reachability
- Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability
- Interconvertibility of a class of set constraints and context-free-language reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
Cited in
(11)- Path querying on acyclic graphs using Boolean grammars
- A framework for memory efficient context-sensitive program analysis
- Selective context-sensitivity for \(k\)\textit{-CFA} with CFL-reachability
- Path querying with conjunctive grammars by matrix multiplication
- Summary-based context-sensitive data-dependence analysis in presence of callbacks
- Conditional Dyck-CFL reachability analysis for complete and efficient library summarization
- Type-based flow analysis and context-free language reachability
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
- scientific article; zbMATH DE number 1407672 (Why is no real title available?)
- Rational index of languages defined by grammars with bounded dimension of parse trees
- The complexity of bidirected reachability in valence systems
This page was built for publication: Context-sensitive data-dependence analysis via linear conjunctive language reachability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370873)
