Solving Regular Tree Grammar Based Constraints (2000)

by Yanhong A. Liu , Ning Li , Scott D. Stoller
Venue:In Proceedings of the 8th International Static Analysis Symposium
Citations:5 - 4 self

Documents Related by Co-Citation

50 Static caching for incremental computation – Yanhong A. Liu, Scott D. Stoller, Tim Teitelbaum - 1998
27 Finite dierencing of computable expressions – R Paige, S Koenig - 1982
1612 Foundations of Databases – S Abiteboul, R Hull, V Vianu - 1995
771 Data Structures and Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1983
2675 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999
520 Querying Semi-Structured Data – Serge Abiteboul - 1997
605 A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
477 The Omega Test: a fast and practical integer programming algorithm for dependence analysis – William Pugh - 1992
2004 Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints – P Cousot, R Cousot - 1977