Subject
General Computer Science,Theoretical Computer Science
Reference52 articles.
1. F. Afrati, C.H. Papadimitriou, The parallel complexity of simple chain queries, Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp. 210–214.
2. A. Aiken, B. Murphy, Implementing regular tree expressions, Proc. 1991 Conf. on Functional Programming Languages and Computer Architectue, August 1991, pp. 427–447.
3. A. Aiken, B. Murphy, Static type inference in a dynamically typed language, 18th Annual ACM Symp. on Principles of Programming Languages, January 1991, pp. 279–290.
4. A. Aiken, E. Wimmers, Type inclusion constraints and type inference, Proc. 1993 Conf. on Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, June 1993, pp. 31–41.
5. U. Assmann, On edge addition rewrite systems and their relevance to program analysis, in: J. Cuny, (Ed.), 5th Workshop on Graph Grammars and Their Application To Computer Science, Lecture Notes in Computer Science, Vol. 1073, Williamsburg, Virginia, Springer, Berlin, November 1994, 1995.
Cited by
62 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. Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2024-04-29
4. Two Birds with One Stone: Multi-Derivation for Fast Context-Free Language Reachability Analysis;2023 38th IEEE/ACM International Conference on Automated Software Engineering (ASE);2023-09-11
5. Recursive State Machine Guided Graph Folding for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2023-06-06