Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Theoretical Computer Science
Fixed point characterization of infinite behavior of finite-state systems
Theoretical Computer Science
Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM (JACM)
A faster solver for general systems of equations
Science of Computer Programming
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Fixpoints for Rabin Tree Automata Make Complementation Easy
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Extending H1-clauses with path disequalities
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Crossing the syntactic barrier: hom-disequalities for H1-clauses
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.01 |
For every hierarchicalsystem of equations S over some complete and distributive lattice we construct an equivalent system with the same set of variables which additionally is guarded. The price to be paid is that the resulting right-hand sides may grow exponentially. We therefore present methods how the exponentialbl ow-up can be avoided. Especially, the loop structure of the variable dependence graph is taken into account. Also we prove that size O(mċ|S|) suffices whenever S originates from a fixpoint expression where the nesting-depth of fixpoints is at most m. Finally, we sketch an application to regular tree pattern-matching.