Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Automated theorem proving for analysis and synthesis
Current trends in hardware verification and automated theorem proving
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Iteration abstraction in Sather
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generic programming and the STL: using and extending the C++ Standard Template Library
Generic programming and the STL: using and extending the C++ Standard Template Library
STL tutorial and reference guide, second edition: C++ programming with the standard template library
STL tutorial and reference guide, second edition: C++ programming with the standard template library
Java Structure: Data Structures in Java for the Principled Programmer
Java Structure: Data Structures in Java for the Principled Programmer
Elements of the Theory of Computation
Elements of the Theory of Computation
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
| Hi-index | 0.00 |
Standard iteration mechanisms, even ones of such generality as those in the C++ Standard Template Library (STL), do not allow insertions to be made in a container during a traversal of the container. Since ad hoc ways of handling such iterations are tedious to program and error-prone, programmers should ideally have at their command an efficient generic solution. In earlier work we formally characterized the complete traversal problem and presented generic solutions by means of two generic algorithms and a container adaptor, all defined within the STL framework. Here we develop additional theory for reasoning about complete traversals and address the question of how general the complete traversal problem is by showing that it subsumes well-known graph (or relation) problems such as reachability and transitive closure.