Hybrid traversal: efficient source code analysis at scale
Abstract
References
Recommendations
Traversal of an Unknown Directed Graph by a Finite Robot
A covering path in a directed graph is a path passing through all vertices and arcs of the graph, with each arc being traversed only in the direction of its orientation. A covering path exists for any initial vertex only if the graph is strongly ...
Graph traversal and graph transformation
Graph traversal algorithms are important since graphs are a common data structure in which information is distributed. None of the existing algorithmic paradigms focuses on graph traversal. This article introduces enNCE substitution as an extension to ...
Comments
Information & Contributors
Information
Published In
- Conference Chair:
- Michel Chaudron,
- General Chair:
- Ivica Crnkovic,
- Program Chairs:
- Marsha Chechik,
- Mark Harman
Sponsors
- SIGSOFT: ACM Special Interest Group on Software Engineering
- IEEE-CS: Computer Society
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Poster
Conference
- SIGSOFT
- IEEE-CS
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 70Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in