scientific article; zbMATH DE number 1407672
From MaRDI portal
Recommendations
Cited in
(23)- TFA: an efficient and precise virtual method call resolution for Java
- Program analysis tools
- Source-tracking unification
- XML graphs in program analysis
- Context-sensitive data-dependence analysis via linear conjunctive language reachability
- Reachability analysis of program variables
- scientific article; zbMATH DE number 3885296 (Why is no real title available?)
- Iterative-free program analysis
- Path querying on acyclic graphs using Boolean grammars
- Tight bounds for reachability problems on one-counter and pushdown systems
- Reachability-based acyclicity analysis by abstract interpretation
- Abstract similarity analysis
- Paths vs. trees in set-based program analysis
- Refinement-based CFG reconstruction from unstructured programs
- On edge addition rewrite systems and their relevance to program analysis
- Finding fix locations for CFL-reachability analyses via minimum cuts
- Computational Science - ICCS 2004
- Interprocedural reachability for flat integer programs
- A Computational Interpretation of Context-Free Expressions
- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
- scientific article; zbMATH DE number 4086991 (Why is no real title available?)
- Interconvertibility of a class of set constraints and context-free-language reachability
- scientific article; zbMATH DE number 2243645 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4940927)
