Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Set based program analysis
Set-based analysis of ML programs
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Using multiset discrimination to solve language processing problems without hashing
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Flow analysis and optimization of LISP-like structures
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data Structures and Algorithms
Data Structures and Algorithms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Dependence Analysis for Recursive Data
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Infinitary relations and their representation
Science of Computer Programming - Special issue on static analysis (SAS'99)
Towards a Systematic Method for Proving Termination of Graph Transformation Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
XML graphs in program analysis
Science of Computer Programming
Functional term rewriting systems towards symbolic model-checking
International Journal of Critical Computer-Based Systems
| Hi-index | 0.00 |
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares substructures as much as possible. This maximal sharing allows substantial memory gain and speed up over previous techniques. For example, equality testing becomes constant time (instead of O(nlog(n))). The algorithms are incremental, and as such allow good reactive behavior. These new algorithms are then applied in a representation of sets of trees. The expressive power of this new representation is exactly what is needed by the original set-based analyses of Heintze and Jaffar [1990], or Heintze [1994].