Subject
Computer Science Applications,Information Systems,Software
Reference102 articles.
1. F. Afrati, C.H. Papadimitriou, The parallel complexity of simple chain queries, in: Proc. Sixth ACM Symp. on Prine. of Database Syst., San Diego, CA, Mar. 1987, pp. 210–214.
2. H. Agrawal, On slicing programs with jump statements, Proc. ACM SIGPL4N 94 Conf. on Prog. Lang. Design and Implementation, (Orlando, FL, June 22–24, 1994), SIGPLAN Not. 29(6), June 1994, pp. 302–312.
3. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
4. A.V. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen, (Ed.), Handbook of Theor. Comp. Sci., Vol. A. Algorithms and Complexity, The M.I.T. Press, Cambridge, MA, 1990, pp. 255–300.
5. A. Aiken, B.R. Murphy, Implementing regular tree expressions, in: J. Hughes (Ed.), Fune. Prog. and Comp. Arch., Fifth ACM Conf. (Cambridge, MA, Aug. 26–30, 1991), Lec. Notes in Comp. Sci., Vol. 523, Springer-Verlag, New York, NY, 1991, pp. 427–447.
Cited by
180 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Better Not Together: Staged Solving for Context-Free Language Reachability;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
2. Context-Free Language Reachability via Skewed Tabulation;Proceedings of the ACM on Programming Languages;2024-06-20
3. Falcon: A Fused Approach to Path-Sensitive Sparse Data Dependence Analysis;Proceedings of the ACM on Programming Languages;2024-06-20
4. A Better Approximation for Interleaved Dyck Reachability;Proceedings of the 13th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis;2024-06-20
5. Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search;ACM Transactions on Software Engineering and Methodology;2024-06-04