scientific article; zbMATH DE number 1407672
From MaRDI portal
zbMATH Open0944.68038MaRDI QIDQ4940927FDOQ4940927
Authors: Thomas Reps 
Publication date: 28 February 2000
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cited In (23)
- Source-tracking unification
- TFA: an efficient and precise virtual method call resolution for Java
- Program analysis tools
- Context-sensitive data-dependence analysis via linear conjunctive language reachability
- XML graphs in program analysis
- Reachability analysis of program variables
- Title not available (Why is that?)
- 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
- On edge addition rewrite systems and their relevance to program analysis
- Refinement-based CFG reconstruction from unstructured programs
- Computational Science - ICCS 2004
- Finding fix locations for CFL-reachability analyses via minimum cuts
- Interprocedural reachability for flat integer programs
- A Computational Interpretation of Context-Free Expressions
- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interconvertibility of a class of set constraints and context-free-language reachability
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)
